are_graphs_isomorphic

scirs2_graph::algorithms::isomorphism

Function are_graphs_isomorphic 

Source 
pub fn are_graphs_isomorphic<N1, N2, E, Ix>(
    graph1: &Graph<N1, E, Ix>,
    graph2: &Graph<N2, E, Ix>,
) -> bool
where
    N1: Node + Clone + Hash + Eq + Debug,
    N2: Node + Clone + Hash + Eq + Debug,
    E: EdgeWeight,
    Ix: IndexType,
Expand description

Check if two graphs are isomorphic

Two graphs are isomorphic if there exists a bijection between their vertices that preserves the edge-adjacency relationship.

§Arguments

  • graph1 - The first graph
  • graph2 - The second graph

§Returns

  • bool - True if the graphs are isomorphic, false otherwise