1. Dijkstra algorithm is a single-source shortest path algorithm. Here, single-source means. that only one soutce is given, and we have to find the shortest path from the source to all the nodes. Let's understand the working of Dijkstra's algorithm. Consider the below graph. 2. To construct MST using Kruskal's Algorithm, ==2 1. Dijkstra algorithm is a single-source shortest path algorithm. Here, single-source means. that only one soutce is given, and we have to find the shortest path from the source to all the nodes. Let's understand the working of Dijkstra's algorithm. Consider the below graph. 2. To construct MST using Kruskal's Algorithm, ==2