dsalgo 0.3.10

A package for Datastructures and Algorithms.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60

use crate::{
    graph_edge_trait::{
        To,
        Weight,
    },
    priority_queue_trait::{
        Pop,
        Push,
    },
};

/// T is a numeric type.

pub fn dijkstra<Q, T, E, F>(
    adj_list: &[Vec<E>],
    src: usize,
    callback: &mut F,
) -> Vec<Option<T>>
where
    Q: Push<T = (T, usize)> + Pop<T = Option<(T, usize)>> + Default,
    T: Default + Ord + Copy + std::ops::Add<Output = T>,
    E: To<V = usize> + Weight<T = T>,
    F: FnMut(&Vec<Option<T>>, usize, &E),
{
    let g = adj_list;

    let n = g.len();

    let mut hq = Q::default();

    let mut dist: Vec<Option<T>> = vec![None; n];

    dist[src] = Some(T::default());

    hq.push((dist[src].unwrap(), src));

    while let Some((du, u)) = hq.pop() {
        if du > dist[u].unwrap() {
            continue;
        }

        for e in g[u].iter() {
            callback(&dist, u, e);

            let v = *e.to();

            let dv = du + *e.weight();

            if dist[v].is_some() && Some(dv) >= dist[v] {
                continue;
            }

            dist[v] = Some(dv);

            hq.push((dv, v));
        }
    }

    dist
}