Question: 5. (20%) Answer the questions using the following graph. 8 30 14 27 E 17 15 5 20 12 F 10 (a) Draw the sequence
5. (20%) Answer the questions using the following graph. 8 30 14 27 E 17 15 5 20 12 F 10 (a) Draw the sequence of edges (represented by edge weight) added to the minimal-cost spanning tree generated by the Kruskal's algorithm. (b) Do the same thing as (a) using Prim's algorithm. (c) Do the same thing as (a) using Sollin's algorithm. (d) Find the shortest paths from E to all other vertices using Dijkstra's algorithm
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
