Shortest path

chris cambré, 02/dic/2017

What's the shortest path between two points on a graph? The algorithm of Dijkstra is a way to find it. Explore step by step the algorithm and make some exercises yourself.


  • 1. Shortest path on a graph
  • 2. Dijkstra algorithm (1)
  • 3. Dijkstra algorithm (2)
  • 4. Dijkstra algorithm (3)
  • 5. exercise shortest path (1)
  • 6. exercise shortest path (2)

1.

Shortest path on a graph

What's the shortest path between the points A and G when following the connections of the graph? [br]Drag one or more points and see how the path changes with it.
– chris cambré

2.

–

3.

–

4.

–

5.

–

6.

–

Informazioni