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

Return true if the graphs g0 and g1 are isomorphic.

Using the VF2 algorithm.

Not implemented: Vertex or edge weight matching.

References

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