Question

Generic shortest path algorithm and dijkstra's algorithm are same?

Answer 1

In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.

The problem of finding the shortest path between two intersections on a road map may be modeled as a special case of the shortest path problem in graphs, where the vertices correspond to intersections and the edges correspond to road segments, each weighted by the length of the segment.

Answer 2

Dijkstra's algorithm doesn't create a MST, it finds the shortest path. The shortest path is 9, while the MST is a different 'path' at 10. Prim and Dijkstra algorithm are almost the same, except for the "relax function". Dijkstra finds the shortest path between it's beginning node and every other node.