tutORial's Shortest Path Problem

Dijkstra's Algorithm

Select the Origin and Destination nodes. When ready click the Start button. The algorithm with then start. Click the Next button to continue with the next step of the algorithm.

Please note that Infinity represents a large positive number. Don't worry if you do not see it in full in the form fields.

Origin node:
Destination node:

List of nodes:
Distance from origin (pixels):
Time elapsed since departure (sec):
Coordinates (from top-left corner):
x =
y =

Contributed by

21

94

123

73

86

155

69

159

56

181

52

84

156

81

57

67

170

85

Sorry, this is not a feasible link. Node is not an immediate successor of node .

Have you checked your eyesight, recently ?!

Dijkstra's Algorithm

Use the Next button to move to the next step of the algorithm. The results are displayed on the map.