libpitust 0.1.2

libpitust implements random utility functions I tend to use a lot
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

use crate::graph::{GraphRooted, GraphSucc, node_map::NodeMap};

fn impl_preorder<G: GraphSucc>(
    graph: G,
    vis: &mut NodeMap<G, bool>,
    items: &mut Vec<G::Node>,
    node: G::Node,
) {
    debug_assert!(!vis[node]);
    vis[node] = true;
    items.push(node);
    for node in graph.succ_of(node) {
        if !vis[node] {
            impl_preorder(graph, vis, items, node);
        }
    }
}
pub fn preorder_from<G: GraphSucc>(graph: G, roots: &[G::Node]) -> Vec<G::Node> {
    let mut vis = NodeMap::new_with(graph, |_| false);
    let mut items = vec![];
    for &root in roots {
        if !vis[root] {
            impl_preorder(graph, &mut vis, &mut items, root);
        }
    }

    items
}
pub fn preorder<G: GraphSucc + GraphRooted>(graph: G) -> Vec<G::Node> {
    let mut vis = NodeMap::new_with(graph, |_| false);
    let mut items = vec![];
    impl_preorder(graph, &mut vis, &mut items, graph.root_node());

    items
}