pub fn wl_isomorphic(
g1: &Graph,
g2: &Graph,
labels1: Option<&[u32]>,
labels2: Option<&[u32]>,
max_iterations: u32,
) -> IgraphResult<bool>Expand description
Check if two graphs have equal WL hash (necessary but not sufficient for isomorphism).
ยงExamples
use rust_igraph::{Graph, wl_isomorphic};
let g1 = Graph::from_edges(&[(0,1),(1,2),(2,0)], false, Some(3)).unwrap();
let g2 = Graph::from_edges(&[(0,1),(1,2),(2,0)], false, Some(3)).unwrap();
assert!(wl_isomorphic(&g1, &g2, None, None, 5).unwrap());
let g3 = Graph::from_edges(&[(0,1),(1,2)], false, Some(3)).unwrap();
assert!(!wl_isomorphic(&g1, &g3, None, None, 5).unwrap());