Data Structures and Algorithms207710 marksShortest Path Algorithms
What is shortest path? Explain Dijkstra algorithm for finding shortest path using suitable example.
What is shortest path? Explain Dijkstra algorithm for finding shortest path using suitable example.[10]
The shortest path between two vertices in a weighted graph is the path whose total sum of edge weights is minimum among all possible paths connecting those two vertices. - It is applicable in directed as well as undirected weighted graphs. - The result gives the minimum cost (distance) to travel ...