Dijkstra

Warning

This post is more than a year old. Information may be outdated.

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

Backlinks2

Project Core ML Foundation Internetworking

Comments0

No comments yet. Be the first to share your thoughts.

Comments