Module org.jgrapht.core
Package org.jgrapht.alg.isomorphism
package org.jgrapht.alg.isomorphism
Algorithms for (sub)graph isomorphism.
-
ClassDescriptionThis is an implementation of the AHU algorithm for detecting an (unweighted) isomorphism between two rooted forests.This is an implementation of the AHU algorithm for detecting an (unweighted) isomorphism between two rooted trees.This is an implementation of the AHU algorithm for detecting an (unweighted) isomorphism between two unrooted trees.Implementation of the color refinement algorithm isomorphism test using its feature of detecting isomorphism between two graphs as described in C.Representation of a graph vertex in the disjoint unionGraphOrdering<V,
E> This class represents the order on the graph vertices.This class represents a GraphMapping between two (subgraph)isomorphic graphs.IsomorphismInspector<V,E> General interface for graph and subgraph isomorphism.Implementation of IsomorphismUndecidableException to indicate undecidable isomorphism cases in isomorphism inspectorsBase implementation of the VF2 algorithm using its feature of detecting isomorphism between two graphs as described in Cordella et al.This is an implementation of the VF2 algorithm using its feature of detecting isomorphism between two graphs as described in Cordella et al.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.This is an implementation of the VF2 algorithm using its feature of detecting subgraph isomorphism between two graphs as described in Cordella et al.This class is used to iterate over all existing (subgraph isomorphic) mappings between two graphs.