Package edu.ucla.sspace.graph.isomorphism

Interface Summary

Interface	Description
IsomorphismTester	An interface for algorithms that detect whether two graphs are isomorphic.
State	An interface for representing the partial or complete state of an a attempted isomorphic mapping between two graphs.

Class Summary

Class	Description
AbstractIsomorphismTester	An abstraction of an IsomorphismTester that relies on algorithm-specific State implementations to check for edge and vertex contraints when performing isomorphism testing.
IsomorphicGraphCounter<G extends Graph<? extends Edge>>	A special-purpose Counter that counts graphs based on isomorphism, rather than object equivalence (which may take into account vertex labeling, etc.).
IsomorphicSet<G extends Graph<? extends Edge>>	A Set of Graph instances that maintains the invariant that all graphs in the set are non-isomorphisms of each other.
TypedIsomorphicGraphCounter<T,G extends Multigraph<T,? extends TypedEdge<T>>>	A special-purpose Counter that counts multigraphs based on typed isomorphism, rather than object equivalence (which may take into account vertex labeling, etc.).
TypedIsomorphicGraphIndexer<T,G extends Multigraph<T,? extends TypedEdge<T>>>	An indexer that records only indices for non-isomorphic Multigraph instances.
TypedVF2IsomorphismTester	An extension of the VF2 algorithm for detecting isomorphic graphs that tests for edge type equivalance.
TypedVF2State	A State implementation for testing isomorphism using the VF2 algorithm's logic with type constraints on the edges.
VF2IsomorphismTester	An implementation of the VF2 algorithm for detecting isomorphic graphs.
VF2State	A State implementation for testing isomorphism using the VF2 algorithm's logic.