Anonymous user
Dijkstra's algorithm: Difference between revisions
m
+ output in D entry
(+ D2 entry) |
m (+ output in D entry) |
||
Line 290:
writeln("Path : ", dijkstraGetShortestPathTo("e", previous));
}</lang>
{{out}}
<pre>Distance from a to e: 20
Path : ["a", "c", "f", "e"]</pre>
=={{header|Go}}==
| |||