Lab 6

1. Compute the minimum spanning tree of a given graph using Kruskal’s algorithm.

2. Find the shortest path in a graph from a given source node to a given destination using Dijkstra’s algorithm.