Dijkstra’s Algorithm An algorithm for finding the shortest path between to nodes in a weighted graph (a network). Related OSPF, Dynamic Routing