vf2 1.0.1

VF2 subgraph isomorphism algorithm in Rust.
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

use crate::{Direction, Graph, NodeIndex};
use petgraph::adj::IndexType;
use petgraph::EdgeType;
use std::fmt::Debug;

impl<N, E, Ty, Ix> Graph for petgraph::Graph<N, E, Ty, Ix>
where
    N: Debug,
    E: Debug,
    Ty: EdgeType,
    Ix: IndexType,
{
    type NodeLabel = N;
    type EdgeLabel = E;

    #[inline]
    fn is_directed(&self) -> bool {
        self.is_directed()
    }

    #[inline]
    fn node_count(&self) -> usize {
        self.node_count()
    }

    #[inline]
    fn node_label(&self, index: NodeIndex) -> Option<&Self::NodeLabel> {
        self.node_weight(petgraph::graph::NodeIndex::<Ix>::new(index))
    }

    #[inline]
    fn neighbors(&self, node: NodeIndex, direction: Direction) -> impl Iterator<Item = NodeIndex> {
        self.neighbors_directed(
            petgraph::graph::NodeIndex::<Ix>::new(node),
            match direction {
                Direction::Outgoing => petgraph::Direction::Outgoing,
                Direction::Incoming => petgraph::Direction::Incoming,
            },
        )
        .map(|neighbor| neighbor.index())
    }

    #[inline]
    fn contains_edge(&self, source: NodeIndex, target: NodeIndex) -> bool {
        self.contains_edge(
            petgraph::graph::NodeIndex::<Ix>::new(source),
            petgraph::graph::NodeIndex::<Ix>::new(target),
        )
    }

    #[inline]
    fn edge_label(&self, source: NodeIndex, target: NodeIndex) -> Option<&Self::EdgeLabel> {
        self.find_edge(
            petgraph::graph::NodeIndex::<Ix>::new(source),
            petgraph::graph::NodeIndex::<Ix>::new(target),
        )
        .and_then(|index| self.edge_weight(index))
    }
}