Function petgraph::algo::is_isomorphic [−] [src]

pub fn is_isomorphic<N, E, Ty, Ix>(g0: &Graph<N, E, Ty, Ix>, g1: &Graph<N, E, Ty, Ix>) -> bool where Ty: EdgeType, Ix: IndexType

[Graph] Return true if the graphs g0 and g1 are isomorphic.

Using the VF2 algorithm, only matching graph syntactically (graph structure).

The graphs should not be multigraphs.

Reference

Luigi P. Cordella, Pasquale Foggia, Carlo Sansone, Mario Vento; A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs