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