weavatrix-graph 0.6.0

Deterministic, evidence-carrying graph primitives for repository intelligence
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

use super::SubgraphMode;

pub(super) fn edge_lists_compatible<P, T, E>(
    pattern: &[P],
    target: &[T],
    mode: SubgraphMode,
    edge_match: &E,
) -> bool
where
    E: Fn(P, T) -> bool,
    P: Copy,
    T: Copy,
{
    if pattern.len() > target.len()
        || (mode == SubgraphMode::Induced && pattern.len() != target.len())
    {
        return false;
    }
    match_edges(
        pattern,
        target,
        edge_match,
        0,
        &mut vec![false; target.len()],
    )
}

fn match_edges<P, T, E>(
    pattern: &[P],
    target: &[T],
    edge_match: &E,
    index: usize,
    used: &mut [bool],
) -> bool
where
    E: Fn(P, T) -> bool,
    P: Copy,
    T: Copy,
{
    if index == pattern.len() {
        return true;
    }
    for candidate in 0..target.len() {
        if !used[candidate] && edge_match(pattern[index], target[candidate]) {
            used[candidate] = true;
            if match_edges(pattern, target, edge_match, index + 1, used) {
                return true;
            }
            used[candidate] = false;
        }
    }
    false
}