Definition[]
Dijkstra's algorithm is
| “ | [a]n algorithm that examines the connectivity of a network to find the shortest path between two points.[1] | ” |
Overview[]
Dijkstra's algorithm is named after the Dutch computer scientist Edsger Dijkstra (1930-2002).[2]
References[]
- ↑ Wiki.GIS.com, GIS Glossary (full-text).
- ↑ Id.