1. A weighted graph is given,
2. Find the shortest distance from a to z in the following graph using Dijkstra algorithm.
3. Find the minimal spanning tree of the graph

 

Transcribed Image Text:

5. A weighted graph is given below, a. Find the shortest distance from a to z in the following graph using Dijkstra algorithm. b. Find the minimal spanning tree of the graph 2 2 2 2 3 I 3 m 3 4 4 B 3 H E N - K 5. A weighted graph is given below, a. Find the shortest distance from a to z in the following graph using Dijkstra algorithm. b. Find the minimal spanning tree of the graph 2 2 2 2 3 I 3 m 3 4 4 B 3 H E N - K