grabapl 0.0.4

A library for graph-based programming languages, with pluggable type systems and a focus on visible intermediate states.
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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149

use criterion::black_box;
use petgraph::algo::general_subgraph_monomorphisms_iter;
use petgraph::algo::isomorphism::general_subgraph_monomorphisms_iter_with_partial_mapping;
use petgraph::graphmap::DiGraphMap;
use std::hash::RandomState;

type G = DiGraphMap<u32, (), RandomState>;

fn match_with_input_mapping<'a>(
    query: &'a G,
    graph: &'a G,
    query_input_idx: u32,
    graph_input_idx: u32,
    gen_all: bool,
    partial: bool,
) {
    let mut nm = move |a: &u32, b: &u32| {
        if *a == query_input_idx {
            // We only match the designed input node to the user specified graph input node
            *b == graph_input_idx
        } else {
            true
        }
    };
    let mut em = |_a: &(), _b: &()| true;

    let partial_mapping = [(query_input_idx, graph_input_idx)];
    let query_wrapped = query;
    let graph_wrapped = graph;

    macro_rules! handle_iter {
        ($iter:expr) => {
            let mut isos = $iter;
            if gen_all {
                let all = isos.collect::<Vec<_>>();
                assert!(all.len() > 0);
                println!("Mappings ({}):\n{:?}", all.len(), all);
                black_box(all);
            } else {
                let first = isos.next().unwrap();
                println!("First mapping:\n{:?}", first);
                black_box(first);
            }
        };
    }

    if partial {
        let isos = general_subgraph_monomorphisms_iter_with_partial_mapping(
            &query_wrapped,
            &graph_wrapped,
            &mut nm,
            &mut em,
            &partial_mapping,
        );
        handle_iter!(isos.unwrap());
    } else {
        let isos =
            general_subgraph_monomorphisms_iter(&query_wrapped, &graph_wrapped, &mut nm, &mut em);
        handle_iter!(isos.unwrap());
    };
}

fn main() {
    let (query_high, query_high_idx) = {
        let mut query_high = G::new();
        // children of the input node
        query_high.add_node(0);
        query_high.add_node(1);
        query_high.add_node(2);
        // the input node
        query_high.add_node(3);

        query_high.add_edge(3, 0, ());
        query_high.add_edge(3, 1, ());
        query_high.add_edge(3, 2, ());
        (query_high, 3)
    };
    let (query_low, query_low_idx) = {
        let mut query_low = G::new();
        // the input node
        query_low.add_node(0);
        // children of the input node
        query_low.add_node(1);
        query_low.add_node(2);
        query_low.add_node(3);

        query_low.add_edge(0, 1, ());
        query_low.add_edge(0, 2, ());
        query_low.add_edge(0, 3, ());
        (query_low, 0)
    };

    for (qg, qi, qkind) in [(query_low, query_low_idx, "low")] {
        for partial in [false, true] {
            for gen_all in [true] {
                for graph_input_idx in [99] {
                    println!(
                        "Running: {},gidx:{},p:{},ga:{}",
                        qkind, graph_input_idx, partial, gen_all
                    );
                    // Generate the data graph. It is a complete graph, except for the input node which only has the desired amount of children.
                    // That means the number of expected output mappings should just be the number of permutations on 3 children.

                    let num_nodes = 1000;

                    let mut g = G::new();
                    for i in 0..num_nodes {
                        g.add_node(i);
                    }
                    for i in 0..num_nodes {
                        for j in 0..num_nodes {
                            if i == j {
                                continue;
                            }
                            if i == graph_input_idx {
                                // only add three outgoing edges
                                if graph_input_idx == 0 {
                                    if j > 3 || j == 0 {
                                        // 0 has children 1,2,3
                                        continue;
                                    }
                                } else {
                                    if j > 2 {
                                        // non 0 has children 0,1,2
                                        continue;
                                    }
                                }
                            }
                            g.add_edge(i, j, ());
                        }
                    }

                    if graph_input_idx == 99 {
                        assert!(g.edge_weight(99, 3).is_none());
                    }

                    match_with_input_mapping(
                        black_box(&qg),
                        black_box(&g),
                        black_box(qi),
                        black_box(graph_input_idx),
                        gen_all,
                        partial,
                    );
                }
            }
        }
    }
}