Anonymous user
Dijkstra's algorithm: Difference between revisions
m
→{{header|Rust}}: Fixed tags
(→{{header|Rust}}: Added rust) |
m (→{{header|Rust}}: Fixed tags) |
||
Line 2,726:
=={{header|Rust}}==
This solution uses a very bare-bones implementation of an adjacency list to represent the graph.
<lang rust>use std::cmp::Ordering;
Line 2,855:
println!("\nCost: {}", cost);
}</lang
{{out}}
<pre>
| |||