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

use crate::{
    dijkstra_arborescence::dijkstra_arborescense,
    dijkstra_sparse_queue::DijkstraSparseQueue,
    graph::edge::{
        From,
        Reversed,
        To,
        ToDirected,
        Weight,
    },
    graphops::edges_to_directed,
};

/// return edge ids

pub fn dijkstra_tree<E1, E2, Q>(
    v_size: usize,
    undirected_edges: &[E1],
    root: usize,
) -> Vec<usize>
where
    E1: From<V = usize> + To<V = usize> + Clone + ToDirected<E = E2>,
    E2: Reversed + From<V = usize> + To<V = usize> + Weight<u64> + Clone,
    Q: DijkstraSparseQueue,
{
    let m = undirected_edges.len();

    let edges = edges_to_directed(undirected_edges.to_vec());

    dijkstra_arborescense::<_, Q>(v_size, &edges, root)
        .into_iter()
        .map(|i| i % m)
        .collect()
}

// TODO
#[cfg(test)]

mod tests {

    #[test]

    fn test() {}
}