Dijkstra's algorithm: Difference between revisions

m
→‎{{header|Rust}}: Condensed lines in main
m (→‎{{header|Rust}}: Condensed lines in main)
Line 2,831:
fn main() {
let mut grid = Grid::new();
let (a,b,c,d,e,f) = (grid.add_node("a");, grid.add_node("b"),
let b = grid.add_node("c"), grid.add_node("bd");,
let c = grid.add_node("e"), grid.add_node("cf"));
let d = grid.add_node("d");
let e = grid.add_node("e");
let f = grid.add_node("f");
 
grid.create_edges(&[