Function dijkstra_path 

pub fn dijkstra_path(
    g: &Graph,
    start: usize,
    goal: usize,
) -> Option<(i64, Vec<usize>)>

Dijkstra + yo’lni tiklash: start dan goal gacha (narx, yo'l).

Misol

use rust_algorithms::graph::{Graph, dijkstra_path};

let mut g = Graph::new_undirected(4);
g.add_edge(0, 1, 4);
g.add_edge(0, 2, 1);
g.add_edge(2, 1, 2);
g.add_edge(1, 3, 1);

let (narx, yol) = dijkstra_path(&g, 0, 3).unwrap();
assert_eq!(narx, 4);
assert_eq!(yol, vec![0, 2, 1, 3]);