Module petgraph::algo::isomorphism

source ·

Functions

  • [Generic] Return true if the graphs g0 and g1 are isomorphic.
  • [Generic] Return true if the graphs g0 and g1 are isomorphic.
  • [Generic] Return true if g0 is isomorphic to a subgraph of g1.
  • [Generic] Return true if g0 is isomorphic to a subgraph of g1.
  • Using the VF2 algorithm, examine both syntactic and semantic graph isomorphism (graph structure and matching node and edge weights) and, if g0 is isomorphic to a subgraph of g1, return the mappings between them.