Zero-click Info (?)
Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959, is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. More at
Wikipedia
Breadth-first search - In graph theory, breadth-first search is a graph search algorithm that begins at the root node and explores all the neighboring nodes.
Depth-first search - Depth-first search is an algorithm for traversing or searching a tree, tree structure, or graph.
Euclidean shortest path - The Euclidean shortest path problem is a problem in computational geometry: given a set of polyhedral obstacles in a Euclidean space, and two points, find the shortest path between the points th...
Floyd–Warshall algorithm - In computer science, the Floyd–Warshall algorithm is a graph analysis algorithm for finding shortest paths in a weighted graph.
Flood fill - Flood fill, also called seed fill, is an algorithm that determines the area connected to a given node in a multi-dimensional array.
Longest path problem - In the mathematical discipline of graph theory, the longest path problem is the problem of finding a simple path of maximum length in a given graph.
Oral history interview with Edsger W.
Dijkstra, Charles Babbage Institute University of Minnesota, Minneapolis.
cbi.umn.edu/oh/display.phtml?id=320 - Similar Sites
Applet by Carla Laffra of Pace
University
dgp.toronto.edu/people/JamesStewart/270/9798s/Laffra/Di... - Similar Sites
Animation of Dijkstra's
algorithm
cs.sunysb.edu/~skiena/combinatorica/animations/dijkst... - Similar Sites
Visualization of Dijkstra's
Algorithm
students.ceid.upatras.gr/~papagel/english/java_docs/minDijk.htm - Similar Sites
