Struct petgraph::isomorphism::Vf2State

struct Vf2State<Ty, Ix> {
    mapping: Vec<NodeIndex<Ix>>,
    out: Vec<usize>,
    ins: Vec<usize>,
    out_size: usize,
    ins_size: usize,
    adjacency_matrix: FixedBitSet,
    generation: usize,
    _etype: PhantomData<Ty>,
}

Fields

mapping: Vec<NodeIndex<Ix>>

The current mapping M(s) of nodes from G0 → G1 and G1 → G0, NodeIndex::end() for no mapping.

out: Vec<usize>

out[i] is non-zero if i is in either M_0(s) or Tout_0(s) These are all the next vertices that are not mapped yet, but have an outgoing edge from the mapping.

ins: Vec<usize>

ins[i] is non-zero if i is in either M_0(s) or Tin_0(s) These are all the incoming vertices, those not mapped yet, but have an edge from them into the mapping. Unused if graph is undirected – it’s identical with out in that case.

out_size: usize

ins_size: usize

adjacency_matrix: FixedBitSet

generation: usize

_etype: PhantomData<Ty>

Implementations

impl<Ty, Ix> Vf2State<Ty, Ix>

where Ty: EdgeType, Ix: IndexType,

pub fn new<N, E>(g: &Graph<N, E, Ty, Ix>) -> Self

pub fn is_complete(&self) -> bool

Return true if we have a complete mapping

pub fn push_mapping<N, E>( &mut self, from: NodeIndex<Ix>, to: NodeIndex<Ix>, g: &Graph<N, E, Ty, Ix>, )

Add mapping from <-> to to the state.

pub fn pop_mapping<N, E>( &mut self, from: NodeIndex<Ix>, g: &Graph<N, E, Ty, Ix>, )

Restore the state to before the last added mapping

pub fn next_out_index(&self, from_index: usize) -> Option<usize>

Find the next (least) node in the Tout set.

pub fn next_in_index(&self, from_index: usize) -> Option<usize>

Find the next (least) node in the Tin set.

pub fn next_rest_index(&self, from_index: usize) -> Option<usize>

Find the next (least) node in the N - M set.

Trait Implementations

impl<Ty: Debug, Ix: Debug> Debug for Vf2State<Ty, Ix>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.