Page 1 :
ASSIGNMENT IV, , 1. Explain Dijikstra’s algorithm with suitable example., 2. Consider the following undirected graph., , B. 20 c, ILI, A D, 8 NE °, F 7 tCO~E, a) Find the adjacency list representation of the graph., b) Find a minimum cost spanning tree by kruskal’s algorithm., 3. Illustrate the importance of various traversing techniques in graph along, with its application., 4, Discuss Prim’s Algorithm. Construct minimum spanning tree for the, below given graph using Prims algorithm (source node=a), , , , 5. Write the Floyd Warshall algorithm to compute the all pair shortest path., Apply the algorithm on following graph., , , , Scanned with CamScanner
Page 2 :
6. By considering vertex ‘1’ as source vertex, find the shortest paths to all, other vertices in the following graph using Dijikstra algorithms. Show all, the steps., , , , Scanned with CamScanner