Anonymous user
Dijkstra's algorithm: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
Line 1,975:
print( "{}\n".format( g.path( paths, "f" ) ) );
}</lang>
Sample run via: <pre>cat ~/graph.g | ./dijkstra.hgn</pre>, output:
<pre>a -> [b<7.0>, c<9.0>, f<14.0>]
b -> [c<10.0>, d<15.0>]
c -> [d<11.0>, f<2.0>]
d -> [e<6.0>]
e -> [f<9.0>]
a via none at cost 0.0
b via a at cost 7.0
c via a at cost 9.0
d via c at cost 20.0
e via d at cost 26.0
f via c at cost 11.0
[a, c, d, e]
[a, c, f]</pre>
=={{header|Icon}} and {{header|Unicon}}==
| |||