portmatching 0.3.3

Fast Graph Matching for Port 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

//! Utility functions.

#[cfg(test)]
pub(crate) mod test;

mod depth;
mod pre_order;
pub use depth::is_connected;
use portgraph::{LinkView, NodeIndex, SecondaryMap};

use crate::{patterns::UnweightedEdge, WeightedGraphRef};

/// Check if an edge `e` is valid in a portgraph `g` without weights.
pub(crate) fn validate_unweighted_edge<G: LinkView>(
    graph: G,
) -> impl for<'a> Fn(NodeIndex, &'a UnweightedEdge) -> Option<NodeIndex> {
    move |src, &(src_port, tgt_port)| {
        let src_port_index = graph.port_index(src, src_port)?;
        let tgt_port_index = graph.port_link(src_port_index)?;
        let tgt = graph.port_node(tgt_port_index)?;
        if graph.port_offset(tgt_port_index)? != tgt_port {
            return None;
        }
        Some(tgt)
    }
}

/// Check if an edge `e` is valid in a weighted portgraph `g`.
pub(crate) fn validate_weighted_node<G, W, PNode>(
    graph: WeightedGraphRef<G, &W>,
) -> impl for<'a> Fn(NodeIndex, &PNode) -> bool + '_
where
    W: SecondaryMap<NodeIndex, PNode>,
    PNode: Eq,
{
    let (_, weights) = graph.into();
    move |node, node_prop| weights.get(node) == node_prop
}

pub(crate) fn always_true<A, B>(_: A, _: &B) -> bool {
    true
}