Perform a breadth-first search of the above graph - show the use of the queue and draw the spanning tree.
Perform a depth-first search of the above graph - show the use of the stack and draw the spanning tree.
5
b
16
12
3
10
3. For the graph above, perform Dijkstra's Shortest Path Single-Source with the source being the vertex a. Show your work.
4. For the graph used in problem 3, determine the minimum spanning tree using Kruskal's algorithm - show your work.