The IT Law Wiki

Dijkstra's algorithm

32,060pages on
this wiki
Add New Page
Add New Page Talk0

Definition Edit

Dijkstra's algorithm is

[a]n algorithm that examines the connectivity of a network to find the shortest path between two points.[1]

Overview Edit

Dijkstra's algorithm is named after the Dutch computer scientist Edsger Dijkstra (1930-2002).[2]

References Edit

  1., GIS Glossary (full-text).
  2. Id.

Also on Fandom

Random Wiki