multidigraph 0.2.0

A simple library for extraction multi digraph from a Vec of Paths
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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85


pub mod adjac;
pub mod multidigraph;

#[cfg(test)]
mod tests {
    //use crate::multidigraph::{FromNodePath, IntoNodePath};
    use super::*;
    use multidigraph::NodePath;

    #[test]
    fn it_create_agraph() {
        let mut agraph = multidigraph::Multidigraph::new();
        agraph.add_paths(vec![
            &NodePath::new(1, vec![2, 3]),
            &NodePath::new(2, vec![3]),
            &NodePath::new(3, vec![]),
            &NodePath::new(4, vec![1]),
            &NodePath::new(5, vec![4]),
            &NodePath::new(6, vec![5]),
            &NodePath::new(7, vec![6]),
            &NodePath::new(8, vec![7]),
            &NodePath::new(9, vec![8]),
        ]);
        agraph.build_adjac();
        let loops = agraph.check_loops();
        assert_eq!(loops.len(), 0);
        agraph.print_internal();
        let c_dag = agraph.connected_dags;
        println!("{:?}", c_dag);
    }

    #[test]
    fn it_create_agraph_string() {
        let mut agraph = multidigraph::Multidigraph::new();
        agraph.add_paths(vec![
            &NodePath::new("1".to_string(), vec!["2".to_string(), "3".to_string()]),
            &NodePath::new("2".to_string(), vec!["3".to_string()]),
            &NodePath::new("3".to_string(), vec![]),
            &NodePath::new("4".to_string(), vec!["1".to_string()]),
            &NodePath::new("5".to_string(), vec!["4".to_string()]),
            &NodePath::new("6".to_string(), vec!["5".to_string()]),
            &NodePath::new("7".to_string(), vec!["6".to_string()]),
            &NodePath::new("8".to_string(), vec!["7".to_string()]),
            &NodePath::new("9".to_string(), vec!["8".to_string()]),
            &NodePath::new("X".to_string(), vec![]),
        ]);
        agraph.build_adjac();
        let loops = agraph.check_loops();
        assert_eq!(loops.len(), 0);
        agraph.print_internal();
        let c_dag = &agraph.connected_dags;
        println!("{:?}", c_dag);
        let h_dag = agraph.hu_connected_dags();
        println!("{:?}", h_dag);
        println!("{}", agraph.dot_notation());
    }

    /*
    fn it_create_graph() {
        struct MyNodePath {
            node_name: String,
            transition_to: Vec<String>,
            calc_weight: f64,
            map: HashMap<String, usize>,
        }
        impl IntoNodePath<String> for MyNodePath {
            fn into_node_path(&self) -> NodePath<String> {
                NodePath::new(self.node_name.clone(), self.transition_to.clone())
                self.map.insert(self.node_name.clone(), 1);
            }
        }
        impl FromNodePath<String> for MyNodePath {
            fn from_node_path(node_path: &NodePath<String>) -> Self {
                MyNodePath {
                    node_name: node_path.node.clone(),
                    transition_to: node_path.edges.clone(),
                    calc_weight: 0.0,
                }
            }
        }
    }
     */

}