- Type Parameters:
V- the type of the vertices
E- the type of the edges
- All Implemented Interfaces:
public class ColorRefinementIsomorphismInspector<V,E> extends Object implements IsomorphismInspector<V,E>Implementation of the color refinement algorithm isomorphism test using its feature of detecting isomorphism between two graphs as described in C. Berkholz, P. Bonsma, and M. Grohe. Tight lower and upper bounds for the complexity of canonical colour refinement. Theory of Computing Systems,doi:10.1007/s00224-016-9686-0, 2016 (color refinement) The complexity of this algorithm is O(|V| + |E| log |V|).
- Christoph Grüne, Dennis Fischer
All Methods Instance Methods Concrete Methods Modifier and Type Method Description
getMappings()Get an iterator over all calculated (isomorphic) mappings between two graphs.
isomorphismExists()Check if an isomorphism exists.
ColorRefinementIsomorphismInspectorConstructor for a isomorphism inspector based on color refinement. It checks whether
graph1- the first graph
graph2- the second graph
public Iterator<GraphMapping<V,E>> getMappings()Get an iterator over all calculated (isomorphic) mappings between two graphs.
public boolean isomorphismExists()Check if an isomorphism exists.