Package org.graph4j.isomorphism

package org.graph4j.isomorphism

Algorithms for testing graph isomorphism.

Related Packages

Package	Description
org.graph4j	The main interfaces and classes for representing and using graphs.

Class	Description
AbstractGraphIsomorphism	Abstract class for finding the isomorphism between two graphs.
AbstractState	Abstract class for the state of the search algorithm.
AbstractUllmanState	Abstract class for the Ullman's algorithm: exact isomorphism and subgraph isomorphism.
AbstractVF2State	Abstract class for the VF2(Vento Foggia) algorithm.
ForestIsomorphism	Algorithm for testing isomorphism of undirected forests.
GraphIsomorphism	Interface class for graph isomorphism.
Isomorphism	An immutable one-to-one correspondence (bijection) between the vertices of two graphs that preserves the edge connections.
IsomorphismAlgorithm	Interface for graph isomorphism algorithms.
OrderedDigraph	Class that orders the vertices of a digraph according to their degree.
RootedForestIsomorphism	Algorithm for testing isomorphism of forests with specified roots.
RootedTreeIsomorphism	Algorithm for testing isomorphism of rooted trees.
State	Interface for the state of the search algorithm.
TreeIsomorphism	Algorithm for testing isomorphism of undirected trees.
UllmanExactGraphIsomorphism	Class for the Ullman algorithm for exact graph isomorphism.
UllmanExactState	Class for the Ullman algorithm for exact graph isomorphism.
UllmanSubGraphIsomorphism	Class for the Ullman algorithm for subgraph isomorphism.
UllmanSubState	Class for the Ullman algorithm for exact graph isomorphism.
VF2ExactGraphIsomorphism	Class for the VF2 algorithm for exact graph isomorphism.
VF2ExactState	Class for the VF2 algorithm for exact graph isomorphism.
VF2SubGraphIsomorphism	Class for the VF2 algorithm for exact graph isomorphism.
VF2SubState	Class for the VF2 algorithm for subgraph isomorphism.