Questions:
Prim Algorithm and Kruskal's Algorithm
Given the graph , perform the following traversals in questions 1 and 2. Show the steps. Use extra space if needed.
1. Depth-First Search
2. Breadth-First Search
Give the weighted graph ; answer questions 3 - 4. Show the steps. Use extra space if needed.
3. Find the shortest paths from S to all the other nodes in the graph using Dijkstra Algorithm.
4. Find the Minimum-Cost Spanning Trees for the above graph using the following algorithms.
a. Prim Algorithm
b. Kruskal's Algorithm