Definition:Dijkstra's Algorithm

Definition

Dijkstra's algorithm is an algorithm for determining the optimum path that passes through all nodes of a network.

This article is complete as far as it goes, but it could do with expansion. In particular: Explain what it is You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding this information. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Expand}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.

Also see

• Results about Dijkstra's algorithm can be found here.

Source of Name

This entry was named for Edsger Wybe Dijkstra.

Sources

• 1998: David Nelson: The Penguin Dictionary of Mathematics (2nd ed.) ... (previous) ... (next): Dijkstra's algorithm
• 1998: David Nelson: The Penguin Dictionary of Mathematics (2nd ed.) ... (previous) ... (next): network analysis
• 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): Dijkstra's algorithm
• 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): network analysis