Function graphlang::are_graphs_isomorph

pub fn are_graphs_isomorph<I: Index, NL: Label, EL: Label>(
    lhs: &Graph<I, NL, EL>, 
    rhs: &Graph<I, NL, EL>
) -> bool

Checks if the two given graphs are (totally) isomorphic to each other, by checking if there exists a partial isomorphism from lhs to rhs and in the other direcetion. This function is very expensive.

Examples

use graphlang::{Node,Edge,Graph,are_graphs_isomorph};
let graph_a = Graph {
        nodes: vec![ Node::new(0u32, "a"), Node::new(1, "a") ],
        edges: vec![ Edge::new_unlabeled(0, 1), ] };
let graph_b = Graph {
        nodes: vec![ Node::new(10u32, "a"), Node::new(11, "a") ],
        edges: vec![ Edge::new_unlabeled(10, 11), ] };
assert!(are_graphs_isomorph(&graph_a, &graph_b));