Page 1 of 1
1. (40 points) Consider the following weighted undirected graph. 1 2 3 8 3 7 3 o Give the adjacency matrix of the graph.
Posted: Fri May 20, 2022 1:39 pm
by answerhappygod
- 1 40 Points Consider The Following Weighted Undirected Graph 1 2 3 8 3 7 3 O Give The Adjacency Matrix Of The Graph 1 (87.02 KiB) Viewed 48 times
1. (40 points) Consider the following weighted undirected graph. 1 2 3 8 3 7 3 o Give the adjacency matrix of the graph. o Use Kruskal's algorithm to find an MCST of the graph. Show your steps in detail. Sketch your final MCST. o Use Prim's algorithm to find an MCST of the graph. Show your steps in detail. Sketch your final MCST. o Use Dijkstra's algorithm to find the shortest paths from node 0 to other nodes. Show your steps in detail. List your final paths.