Package com.jgalgo.alg.connect

package com.jgalgo.alg.connect

Algorithms for solving connectivity problems, such as strongly/weakly connected components, minimum edge/vertex cuts, ect.

Class	Description
BiConnectedComponentsAlgo	An algorithm that compute the bi-connected components of a graph.
BiConnectedComponentsAlgo.IResult	A result object of a BiConnectedComponentsAlgo computation for IntGraph.
BiConnectedComponentsAlgo.Result<V,E>	A result object of a BiConnectedComponentsAlgo computation.
BiConnectedComponentsAlgoAbstract	Abstract class for bi-connected components algorithms.
BiConnectedComponentsAlgoHopcroftTarjan	Hopcroft-Tarjan algorithm for bi-connected components.
KEdgeConnectedComponentsAlgo	An algorithm that compute the k-edge connected components of a graph.
KEdgeConnectedComponentsAlgoAbstract	Abstract class for k-edge connected components algorithms.
KEdgeConnectedComponentsWang	Wang's algorithm for computing the k-edge connected components of a graph.
KVertexConnectedComponentsAlgo	Finds the k-vertex connected components of a graph.
KVertexConnectedComponentsAlgoAbstract	Abstract class for k-vertex connected components algorithms.
KVertexConnectedComponentsWhiteMoody	White-Moody algorithm for finding k-vertex-connected components in an undirected graph.
MinimumEdgeCutAllSt	Minimum Edge-Cut algorithm that finds all minimum edge-cuts in a graph between two terminal vertices (source-sink, S-T).
MinimumEdgeCutAllStAbstract	Abstract class for computing all minimum edge cuts between two terminal nodes.
MinimumEdgeCutAllStPicardQueyranne	Picard-Queyranne algorithm for enumerating all the minimum edge cuts between two terminal nodes.
MinimumEdgeCutGlobal	Global Minimum Edge-Cut algorithm without terminal vertices.
MinimumEdgeCutGlobalAbstract	Abstract class for computing the global minimum edge cut in a graph.
MinimumEdgeCutGlobalStoerWagner	Stoer-Wagner Algorithm for global minimum cut.
MinimumEdgeCutSt	Minimum Edge-Cut algorithm with terminal vertices (source-sink, S-T).
MinimumEdgeCutStAbstract	Abstract class for computing the minimum edge cut between two vertices in a graph.
MinimumVertexCutAllGlobal	Minimum Vertex-Cut algorithm that finds all minimum vertex-cuts in a graph (global vertex-cut).
MinimumVertexCutAllGlobalAbstract	Abstract class for computing all global minimum vertex cuts in a graph.
MinimumVertexCutAllGlobalKanevsky	Kanevsky algorithm for computing all minimum unweighted vertex cuts in a graph.
MinimumVertexCutAllSt	Minimum Vertex-Cut algorithm that finds all minimum vertex-cuts in a graph between two terminal vertices (source-sink, S-T).
MinimumVertexCutAllStAbstract	Abstract class for computing all minimum vertex cuts between two vertices in a graph.
MinimumVertexCutAllStEdgeCut	All Minimum Vertex-Cuts algorithm with terminal vertices (source-sink, S-T) using All Minimum Edge-Cuts algorithm.
MinimumVertexCutGlobal	Minimum Vertex-Cut algorithm without terminal vertices.
MinimumVertexCutGlobalAbstract	Abstract class for computing the global minimum vertex cut in a graph.
MinimumVertexCutGlobalEsfahanianHakimi	Esfahanian-Hakimi algorithm for computing a minimum unweighted vertex cut in a graph.
MinimumVertexCutSt	Minimum Vertex-Cut algorithm with terminal vertices (source-sink, S-T).
MinimumVertexCutStAbstract	Abstract class for computing the minimum vertex cut between two vertices in a graph.
MinimumVertexCutStEdgeCut	Minimum Vertex-Cut algorithm with terminal vertices (source-sink, S-T) using Minimum Edge-Cut algorithm.
StronglyConnectedComponentsAlgo	Strongly Connected components algorithm.
StronglyConnectedComponentsAlgoAbstract	Abstract class for computing strongly connected components in a graph.
StronglyConnectedComponentsPathBasedDfs	Path based DFS implementation of Dijkstra's strongly connected components algorithm.
StronglyConnectedComponentsTarjan	Tarjan's strongly connected components algorithm.
WeaklyConnectedComponentsAlgo	Weakly Connected components algorithm.
WeaklyConnectedComponentsAlgoAbstract	Abstract class for computing weakly connected components in a graph.
WeaklyConnectedComponentsAlgoImpl	Simple implementation of the weakly connected components algorithm.