Dijkstra’s algorithm

Dijkstra’s algorithm is way of finding shortest path from a source vertex to sink in a given connected and weighted graph.It is somewhat similar to Prim’s algorithm.It works for directed as well as undirected graphs. Source vertex is chosen and marked. Mark distances at all vertices as infinity and at source vertex as 0. Update the… read more »