**Dijkstra’s algorithm** is a greedy algorithm for finding the shortest path between a single source node and all other nodes in a weighted graph.

• It was developed by Edsger W. Dijkstra in 1956 and published three years later.

Skip to content
# Dijkstra’s Algorithm

**Dijkstra’s algorithm** is a greedy algorithm for finding the shortest path between a single source node and all other nodes in a weighted graph.

• It was developed by Edsger W. Dijkstra in 1956 and published three years later.

You May Have Missed