Dijkstra's algorithm --- Introduction ---

Dijkstra's algorithm is an exercice where one executes step by step Dijkstra's agorithm. This algorithm calculates the shortest path between two vertices of a weighted graph.
You can find an explanation of the algorithm from the help once inside the exercise.
Set up Choose
  • the number of vertices of the graph (between 5 and 12): -  +
  • the difficulty, according to the size of possible costs -  +

The most recent version

This page is not in its usual appearance because WIMS is unable to recognize your web browser.
In order to access WIMS services, you need a browser supporting forms. In order to test the browser you are using, please type the word wims here: and press ``Enter''.

Please take note that WIMS pages are interactively generated; they are not ordinary HTML files. They must be used interactively ONLINE. It is useless for you to gather them through a robot program.