graphfind-rs 0.1.0

Library for finding patterns in graphs
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

use crate::pattern_matching::{PatternElement, PatternGraph};

/// Defines an PatternGraph over an directed petgraph. Guarantees that
/// our graph should always be directed.
impl<NodeWeight, EdgeWeight> PatternGraph<NodeWeight, EdgeWeight>
    for petgraph::graph::Graph<PatternElement<NodeWeight>, PatternElement<EdgeWeight>>
{
    /// Adds a hidden node to match, and returns the reference.
    fn add_hidden_node<C>(&mut self, condition: C) -> Self::NodeRef
    where
        C: Fn(&NodeWeight) -> bool + 'static,
    {
        self.add_node(PatternElement::new(Box::new(condition), true))
    }

    /// Adds a visible node to match, and returns the reference.
    fn add_node<C>(&mut self, condition: C) -> Self::NodeRef
    where
        C: Fn(&NodeWeight) -> bool + 'static,
    {
        self.add_node(PatternElement::new(Box::new(condition), false))
    }

    /// Adds a hidden/ignored edge to match, and returns the reference.
    fn add_hidden_edge<C>(
        &mut self,
        from: Self::NodeRef,
        to: Self::NodeRef,
        condition: C,
    ) -> Self::EdgeRef
    where
        C: Fn(&EdgeWeight) -> bool + 'static,
    {
        self.add_edge(from, to, PatternElement::new(Box::new(condition), true))
    }

    /// Adds an edge to match, and returns the reference.
    fn add_edge<C>(&mut self, from: Self::NodeRef, to: Self::NodeRef, condition: C) -> Self::EdgeRef
    where
        C: Fn(&EdgeWeight) -> bool + 'static,
    {
        if !self.node_weight(from).unwrap().should_appear()
            || !self.node_weight(to).unwrap().should_appear()
        {
            panic!("Must not refer to an edge that refers to nodes that cannot be referred!")
        }
        self.add_edge(from, to, PatternElement::new(Box::new(condition), false))
    }
}