Module org.jgrapht.core
Package org.jgrapht.alg.isomorphism
Algorithms for (sub)graph isomorphism.
-
Interface Summary Interface Description IsomorphismInspector<V,E> General interface for graph and subgraph isomorphism. -
Class Summary Class Description AHUForestIsomorphismInspector<V,E> This is an implementation of the AHU algorithm for detecting an (unweighted) isomorphism between two rooted forests.AHURootedTreeIsomorphismInspector<V,E> This is an implementation of the AHU algorithm for detecting an (unweighted) isomorphism between two rooted trees.AHUUnrootedTreeIsomorphismInspector<V,E> This is an implementation of the AHU algorithm for detecting an (unweighted) isomorphism between two unrooted trees.ColorRefinementIsomorphismInspector<V,E> Implementation of the color refinement algorithm isomorphism test using its feature of detecting isomorphism between two graphs as described in C.ColorRefinementIsomorphismInspector.DistinctGraphObject<T,V,E> Representation of a graph vertex in the disjoint unionGraphOrdering<V,E> This class represents the order on the graph vertices.IsomorphicGraphMapping<V,E> This class represents a GraphMapping between two (subgraph)isomorphic graphs.VF2AbstractIsomorphismInspector<V,E> Base implementation of the VF2 algorithm using its feature of detecting isomorphism between two graphs as described in Cordella et al.VF2GraphIsomorphismInspector<V,E> This is an implementation of the VF2 algorithm using its feature of detecting isomorphism between two graphs as described in Cordella et al.VF2GraphIsomorphismState<V,E> VF2GraphMappingIterator<V,E> This class is used to iterate over all existing (isomorphic) mappings between two graphs.VF2MappingIterator<V,E> VF2State<V,E> controls the matching between two graphs according to the VF2 algorithm.VF2SubgraphIsomorphismInspector<V,E> This is an implementation of the VF2 algorithm using its feature of detecting subgraph isomorphism between two graphs as described in Cordella et al.VF2SubgraphIsomorphismState<V,E> VF2SubgraphMappingIterator<V,E> This class is used to iterate over all existing (subgraph isomorphic) mappings between two graphs. -
Exception Summary Exception Description IsomorphismUndecidableException Implementation of IsomorphismUndecidableException to indicate undecidable isomorphism cases in isomorphism inspectors