1 answer questions for the following graph if a new vertex is visited and there is m 5346375

1. Answer questions for the following graph, if a new vertex is visited and there is more than one possibility to select, following the alphabet order. If you are not sure, using the applet to verify your answer.

a. Depth-first traversal starting at vertex A.

b. Depth-first traversal starting at vertex F.

c. Breadth-first traversal starting at vertex A.

d. Breadth-first traversal starting at vertex F.

e. Shortest path from vertex A to vertex E using breadth-first search.

f. Shortest path from vertex G to vertex C using breadth-first search.

g. Shortest path from vertex F to vertex A using breadth-first search.

"Get 15% discount on your first 3 orders with us"
Use the following coupon
FIRST15

Order Now