Package org.graph4j.isomorphism
package org.graph4j.isomorphism
Algorithms for testing graph isomorphism.
-
ClassDescriptionAbstract class for finding the isomorphism between two graphs.Abstract class for the state of the search algorithm.Abstract class for the Ullman's algorithm: exact isomorphism and subgraph isomorphism.Abstract class for the VF2(Vento Foggia) algorithm.Algorithm for testing isomorphism of undirected forests.Interface class for graph isomorphism.An immutable one-to-one correspondence (bijection) between the vertices of two graphs that preserves the edge connections.Interface for graph isomorphism algorithms.Class that orders the vertices of a digraph according to their degree.Algorithm for testing isomorphism of forests with specified roots.Algorithm for testing isomorphism of rooted trees.Interface for the state of the search algorithm.Algorithm for testing isomorphism of undirected trees.Class for the Ullman algorithm for exact graph isomorphism.Class for the Ullman algorithm for exact graph isomorphism.Class for the Ullman algorithm for subgraph isomorphism.Class for the Ullman algorithm for exact graph isomorphism.Class for the VF2 algorithm for exact graph isomorphism.Class for the VF2 algorithm for exact graph isomorphism.Class for the VF2 algorithm for exact graph isomorphism.Class for the VF2 algorithm for subgraph isomorphism.