graph-simulation 0.1.21

A library for simulation algorithm
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

use graph_base::impls::standard::StandardLabeledGraph;
use graph_simulation::algorithm::simulation::Simulation;
use std::fs;

#[test]
fn simulation_inter_test() {
    let paths = fs::read_dir(format!("{}/data/label_graph/simulation_test/", env!("CARGO_MANIFEST_DIR"))).expect("Unable to read directory");
    for path in paths {
        if let Ok(entry) = path {
            let path = entry.path();
            if path.is_file() {
                let graph_name = path.file_name().unwrap().to_str().unwrap();
                let content = fs::read_to_string(&path).expect("Unable to read file");

                let mut lines = content.split_whitespace();
                    let is_true = lines.next().unwrap() == "t";
                    let n1: usize = lines.next().unwrap().parse().unwrap();
                    let m1: usize = lines.next().unwrap().parse().unwrap();
                    let _: usize = lines.next().unwrap().parse().unwrap();

                    let mut graph1 = StandardLabeledGraph::new();
                    for _ in 0..n1 {
                        let node: u64 = lines.next().unwrap().parse().unwrap();
                        let label: String = lines.next().unwrap().parse().unwrap();
                        graph1.add_node(node, label);
                    }

                    for _ in 0..m1 {
                        let source: u64 = lines.next().unwrap().parse().unwrap();
                        let destination: u64 = lines.next().unwrap().parse().unwrap();
                        graph1.add_edge(source, destination);
                    }

                    let n2: usize = lines.next().unwrap().parse().unwrap();
                    let m2: usize = lines.next().unwrap().parse().unwrap();
                    let _: usize = lines.next().unwrap().parse().unwrap();

                    let mut graph2 = StandardLabeledGraph::new();
                    for _ in 0..n2 {
                        let node: u64 = lines.next().unwrap().parse().unwrap();
                        let label: String = lines.next().unwrap().parse().unwrap();
                        graph2.add_node(node, label);
                    }

                    for _ in 0..m2 {
                        let source: u64 = lines.next().unwrap().parse().unwrap();
                        let destination: u64 = lines.next().unwrap().parse().unwrap();
                        graph2.add_edge(source, destination);
                    }

                    let sim = graph1.get_simulation_inter(&graph2);
                    let has_sim=  StandardLabeledGraph::has_simulation(sim);
            }
        }
    }
}