Dijkstra's Algorithm

Dijkstra's algorithm finds the shortest-path spanning tree of a connected graph starting at a given vertex: the unique path in the tree from the starting vertex to any other vertex is the shortest path in the graph between those vertices. If you are interested only in the shortest path to a particular vertex, the algorithm can be stopped once that vertex is reached.
The numbers in parentheses at each vertex are called labels. Initially, the starting vertex has a label of 0, and all other vertices are labeled with . At each stage, the algorithm selects a previously unselected vertex with a minimal label. That vertex and its label turn red (and are added to the tree indicated by blue edges). That label will no longer change and is the length of the shortest path in the graph from the starting vertex to that particular vertex. Other labels are updated to reflect the distance to the corresponding vertex using a path only through previously selected vertices.
Weights for the edges are generated at random, but a fixed set of weights is included to have a repeatable example.
  • Contributed by: Marc Brodie
  • (Wheeling Jesuit University)


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.

Mathematica »
The #1 tool for creating Demonstrations
and anything technical.
Wolfram|Alpha »
Explore anything with the first
computational knowledge engine.
MathWorld »
The web's most extensive
mathematics resource.
Course Assistant Apps »
An app for every course—
right in the palm of your hand.
Wolfram Blog »
Read our views on math,
science, and technology.
Computable Document Format »
The format that makes Demonstrations
(and any information) easy to share and
interact with.
STEM Initiative »
Programs & resources for
educators, schools & students.
Computerbasedmath.org »
Join the initiative for modernizing
math education.
Step-by-Step Solutions »
Walk through homework problems one step at a time, with hints to help along the way.
Wolfram Problem Generator »
Unlimited random practice problems and answers with built-in step-by-step solutions. Practice online or make a printable study sheet.
Wolfram Language »
Knowledge-based programming for everyone.
Powered by Wolfram Mathematica © 2018 Wolfram Demonstrations Project & Contributors  |  Terms of Use  |  Privacy Policy  |  RSS Give us your feedback
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to Mathematica Player 7EX
I already have Mathematica Player or Mathematica 7+