Skip to main content


Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. Dijkstra's algorithm

  • In Internetworking, Dijkstra is used for resolving network graphs and finding the closest connection