An algorithm that examines the connectivity of a network to find the shortest path between two points. Dijkstra’s algorithm is named after the Dutch computer scientist Edsger Dijkstra (1930-2002).
An algorithm that examines the connectivity of a network to find the shortest path between two points. Dijkstra’s algorithm is named after the Dutch computer scientist Edsger Dijkstra (1930-2002).