Uses of Class
org.graph4j.SimpleGraphAlgorithm

Packages that use SimpleGraphAlgorithm

Package	Description
org.graph4j.clique	Clique related algorithms, such as enumerating all maximal cliques of a graph.
org.graph4j.coloring
org.graph4j.coloring.bw	Algorithms for the bandwith graph coloring problem.
org.graph4j.coloring.eq	Algorithms for the equitable graph coloring problem.
org.graph4j.connectivity	Algorithms for analyzing connectivity of graphs and digraphs.
org.graph4j.converters
org.graph4j.hamiltonian
org.graph4j.matching	Algorithms for determining matchings, such as the maximum cardinality matching in bipartite graphs.
org.graph4j.ordering	Algorithms that produce various orderings of the vertices of a graph.
org.graph4j.support	Support algorithms for various type of graphs (bipartite, tournament, etc.).
org.graph4j.vsp	Algorithms for the Vertex Separator Problem (VSP).

Uses of SimpleGraphAlgorithm in org.graph4j.clique

Subclasses of SimpleGraphAlgorithm in org.graph4j.clique

Modifier and Type	Class	Description
class	BFSCliqueIterator	Iterates over all cliques in a graph in a BFS manner.
class	BoundedCliqueIterator	Deprecated.
class	BronKerboschCliqueFinder	Deprecated.
class	BronKerboschCliqueIterator	Iterates over all the maximal cliques of a graph.
class	DFSCliqueIterator	Iterates over all cliques in a graph in a DFS manner.
class	MaximalCliqueFinder	Computes a maximal clique.

Uses of SimpleGraphAlgorithm in org.graph4j.coloring

Subclasses of SimpleGraphAlgorithm in org.graph4j.coloring

Modifier and Type	Class	Description
class	BacktrackColoring	Attempts at finding the optimum coloring of a graph using a systematic exploration of the search space.
class	BacktrackColoringBase	Attempts at finding the optimum coloring of a graph using a systematic exploration of the search space.
class	DSaturGreedyColoring
class	ExactColoringBase	Base class for exact vertex coloring algorithms.
class	GreedyColoring
class	GreedyColoringBase	Greedy coloring is a simple heuristic algorithm that assigns colors to the vertices of a graph in a greedy manner, that is, by selecting the smallest possible color that has not yet been used by any of the neighboring vertices.
class	LargestDegreeFirstColoring
class	RandomGreedyColoring
class	RecursiveLargestFirstColoring
class	SmallestDegreeLastColoring

Uses of SimpleGraphAlgorithm in org.graph4j.coloring.bw

Subclasses of SimpleGraphAlgorithm in org.graph4j.coloring.bw

Modifier and Type	Class	Description
class	BacktrackBandwithColoring	Attempts at finding an optimum bandwith coloring of a graph using a systematic exploration of the search space.
class	GreedyBandwithColoring

Uses of SimpleGraphAlgorithm in org.graph4j.coloring.eq

Subclasses of SimpleGraphAlgorithm in org.graph4j.coloring.eq

Modifier and Type	Class	Description
class	BacktrackEquitableColoring	Attempts at finding an optimum equitable coloring of the vertices of a graph using a systematic exploration of the search space.
class	GreedyEquitableColoring	Creates an equitable coloring in a greedy manner.

Uses of SimpleGraphAlgorithm in org.graph4j.connectivity

Subclasses of SimpleGraphAlgorithm in org.graph4j.connectivity

Modifier and Type	Class	Description
class	BridgeDetectionAlgorithm	A bridge in an undirected graph is defined as an edge which, when removed, increases the number of connected components in the graph).
class	ConnectivityAlgorithm	Determines the connected components of a graph.
class	StoerWagnerMinimumCut	Provides a method to find the minimum weighted cut of an undirected graph using the Stoer-Wagner algorithm.
class	StoerWagnerMinimumCut1	Provides a method to find the minimum weighted cut of an undirected graph using the Stoer-Wagner algorithm.
class	StoerWagnerMinimumCut2	Provides a method to find the minimum weighted cut of an undirected graph using the Stoer-Wagner algorithm.
class	StoerWagnerMinimumCut3	Provides a method to find the minimum weighted cut of an undirected graph using the Stoer-Wagner algorithm.
class	TarjanBiconnectivity	The algorithm for computing biconnected components in a connected undirected graph is due to John Hopcroft and Robert Tarjan (1973).

Uses of SimpleGraphAlgorithm in org.graph4j.converters

Subclasses of SimpleGraphAlgorithm in org.graph4j.converters

Modifier and Type	Class	Description
class	PruferTreeEncoder	Encodes a tree to its Prufer sequence.

Uses of SimpleGraphAlgorithm in org.graph4j.hamiltonian

Subclasses of SimpleGraphAlgorithm in org.graph4j.hamiltonian

Modifier and Type	Class	Description
class	PalmerHamiltonianCycle	The algorithm finds a Hamiltonian cycle in an undirected simple graph that satisfies Ore's condition: deg(v) + deg(u) >= |V(G)|, for every pair of distinct non-adjacent vertices v and u.

Uses of SimpleGraphAlgorithm in org.graph4j.matching

Subclasses of SimpleGraphAlgorithm in org.graph4j.matching

Modifier and Type	Class	Description
class	EdmondsMaximumMatching	TODO Goldberg, p.95
class	HopcroftKarpMaximumMatching	Computes the maximum cardinality matching in a bipartite graph.

Uses of SimpleGraphAlgorithm in org.graph4j.ordering

Subclasses of SimpleGraphAlgorithm in org.graph4j.ordering

Modifier and Type	Class	Description
class	AcyclicOrientation	An acyclic orientation of an undirected graph is an assignment of a direction to each edge (an orientation) that does not form any directed cycle and therefore makes it into a directed acyclic graph.

Uses of SimpleGraphAlgorithm in org.graph4j.support

Subclasses of SimpleGraphAlgorithm in org.graph4j.support

Modifier and Type	Class	Description
class	BipartiteGraphSupport	Support class for bipartite graphs.

Uses of SimpleGraphAlgorithm in org.graph4j.vsp

Subclasses of SimpleGraphAlgorithm in org.graph4j.vsp

Modifier and Type	Class	Description
class	BacktrackVertexSeparator	WORK IN PROGRESS.
class	GreedyVertexSeparator
class	VertexSeparatorBase	The vertex separator problem (VSP) is to find a partition of V into nonempty three classes A, B, C such that there is no edge between A and B, max(|A|,|B|) <= f(n) and |C| is minimum.