FANDOM


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. Wiki.GIS.com, GIS Glossary (full-text).
  2. Id.

Ad blocker interference detected!


Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.