- Run Dijkstra’s algorithm on the following directed graph and show the result of each step.(1) First, using vertex a as the source, show the shortest paths from the source vertex to every other vertex.
(2) Then, using vertex e as the source, show the shortest paths from the source vertex to every other vertex. - Find a Minimum Spanning Tree for the following graph.
1
