Dijkstra's algorithm: Difference between revisions
m
→{{header|Go}}: directed graph
m (lang tag) |
m (→{{header|Go}}: directed graph) |
||
Line 525:
{"e", "f", 9},
}
directed :=
start := "a"
end := "e"
Line 710:
return r
}</lang>
{{out}}
<pre>
Shortest path(s):
[a c
</pre>
| |||