Dijkstra's algorithm: Difference between revisions
m
no edit summary
No edit summary |
mNo edit summary |
||
Line 2,139:
(calculate-shortest-path)
</
outputs:
<pre>
from a to e:
shortest distance: 26
shortest route: (a c d e)
Line 2,150 ⟶ 2,151:
shortest distance: 11
shortest route: (a c f)
--
</pre>
=={{header|Erlang}}==
| |||