All Classes

Class	Description
AlgorithmBuilderBase	A base interface for all algorithm builders.
BarabasiAlbertGraphGenerator<V,E>	Generates a Barabási–Albert graph.
Bfs	Bread first search (BFS) iterator.
Bfs.IntIter	A BFS iterator for IntGraph.
Bfs.Iter<V,E>	A BFS iterator.
BfsDfsExample	This example demonstrates how to use the BFS and DFS algorithms.
BiConnectedComponentsAlgo	An algorithm that compute the bi-connected components of a graph.
BiConnectedComponentsAlgo.Builder	A builder for BiConnectedComponentsAlgo objects.
BiConnectedComponentsAlgo.IResult	A result object of a BiConnectedComponentsAlgo computation for IntGraph.
BiConnectedComponentsAlgo.Result<V,E>	A result object of a BiConnectedComponentsAlgo computation.
BipartiteGraphs	Static class for bipartite graphs.
ChinesePostman	An algorithm for the chinese postman problem.
ChinesePostman.Builder	A builder for ChinesePostman objects.
ClosuresEnumerator	An algorithm that enumerate all the closure subsets in a directed graph.
ClosuresEnumerator.Builder	A builder for ClosuresEnumerator objects.
ColoringAlgo	An algorithm that assign a color to each vertex in a graph while avoiding identical color for any pair of adjacent vertices.
ColoringAlgo.Builder	A builder for ColoringAlgo objects.
ColoringExample	This example demonstrates how to use the coloring algorithm.
CompleteGraphGenerator<V,E>	Generates a complete graph.
CoresAlgo	Cores computing algorithm.
CoresAlgo.Builder	A builder for CoresAlgo objects.
CoresAlgo.IResult	The result of the cores computation for IntGraph.
CoresAlgo.Result<V,E>	The result of the cores computation.
CyclesEnumerator	An algorithm that enumerate all cycles in a graph.
CyclesEnumerator.Builder	A builder for CyclesEnumerator objects.
Dfs	Depth first search (DFS) iterator.
Dfs.IntIter	A DFS iterator for IntGraph.
Dfs.Iter<V,E>	A DFS iterator.
DominatingSetAlgo	An algorithm for computing a minimum dominating set.
DominatingSetAlgo.Builder	A builder for DominatingSetAlgo algorithms.
EdgeCover	Minimum edge vertex cover algorithm.
EdgeCover.Builder	A builder for EdgeCover algorithms.
EdgeDirection	The direction type of an edge with respect to a vertex.
EdgeIter<V,E>	Iterator used to iterate over graph edges.
EdgeIterationExample	This example demonstrates how to iterate over the edges of a graph.
EdgeSet<V,E>	Set of graph edges.
EmptyGraphGenerator<V,E>	A generator of empty graphs.
EulerianTourAlgo	Eulerian tour calculation algorithm.
EulerianTourAlgo.Builder	A builder for EulerianTourAlgo objects.
Flow<V,E>	Flow on graph edges.
GnpGraphGenerator<V,E>	Generates a random graph using the G(n,p) model.
Graph<V,E>	A discrete graph with vertices and edges.
GraphBaseWithEdgeEndpointsContainer
GraphBuilder<V,E>	A builder for graphs.
GraphFactory<V,E>	A factory for Graph objects.
GraphFactory.Hint	Hints for a graph factory.
GraphGenerator<V,E>	A generator of graphs.
Graphs	Static methods class for graphs.
GraphsUtils	Static methods class for graphs.
IEdgeIter	Iterator used to iterate over int graph edges.
IEdgeSet	Set of int graph edges.
IFlow	Flow on IntGraph edges.
IMatching	A matching in a IntGraph.
IndexGraph	A graph whose vertices and edges identifiers are indices.
IndexGraphBuilder	A builder for Index graphs.
IndexGraphBuilder.ReIndexedGraph	A result object of re-indexing and building a graph operation.
IndexGraphBuilder.ReIndexingMap	A map of indices, mapping an original index to a re-indexed index.
IndexGraphFactory	A factory for Index graphs.
IndexIdMap<K>	A mapping between Graph IDs to IndexGraph indices.
IndexIdMaps	Static methods class for index-id maps.
IndexIntIdMap	A mapping between IntGraph IDs to IndexGraph indices.
IndexRemoveListener	A listener that will be notified when an IndexGraph remove a vertex or an edge.
IntGraph	A discrete graph with int vertices and edges.
IntGraphBuilder	A builder for int graphs.
IntGraphFactory	A factory for IntGraph objects.
IPath	A path of edges in an int graph.
IVertexBiPartition	A partition of the vertices of an int graph into two blocks.
IVertexPartition	A partition of the vertices of an int graph.
IWeightFunction	Weight function that maps graph edges or vertices of IntGraph to weights.
IWeightFunctionInt	Weight function that maps graph edges or vertices of IntGraph to integer weights.
IWeights<T>	Weights of int graph vertices or edges.
IWeightsBool	Specific weights of boolean for int graphs.
IWeightsByte	Specific weights of byte for int graphs.
IWeightsChar	Specific weights of char for int graphs.
IWeightsDouble	Specific weights of double for int graphs.
IWeightsFloat	Specific weights of float for int graphs.
IWeightsInt	Specific weights of int for int graphs.
IWeightsLong	Specific weights of long for int graphs.
IWeightsObj<T>	Specific weights of Object for int graphs.
IWeightsShort	Specific weights of short for int graphs.
JGAlgoConfig	A global configuration class.
KEdgeConnectedComponentsAlgo	An algorithm that compute the k-edge connected components of a graph.
KEdgeConnectedComponentsAlgo.Builder	A builder for KEdgeConnectedComponentsAlgo objects.
KShortestPathsST	An algorithm for computing the K shortest paths between two vertices in a graph.
KShortestPathsST.Builder	A builder for KShortestPathsST objects.
KVertexConnectedComponentsAlgo	Finds the k-vertex connected components of a graph.
KVertexConnectedComponentsAlgo.Builder	A builder for KVertexConnectedComponentsAlgo objects.
KVertexConnectedComponentsAlgo.IResult	Result of a KVertexConnectedComponentsAlgo computation for IntGraph.
KVertexConnectedComponentsAlgo.Result<V,E>	Result of a KVertexConnectedComponentsAlgo computation.
LowestCommonAncestorDynamic	Dynamic algorithm for Lowest Common Ancestor (LCA) queries.
LowestCommonAncestorDynamic.Builder	A builder for LowestCommonAncestorDynamic objects.
LowestCommonAncestorDynamic.Vertex	A tree vertex in an LowestCommonAncestorDynamic data structure.
LowestCommonAncestorExample	This example demonstrates how to use the lowest common ancestor algorithm.
LowestCommonAncestorOffline	An algorithm for computing the lowest common ancestor (LCA) of two vertices in a tree, offline.
LowestCommonAncestorOffline.Builder	A builder for LowestCommonAncestorOffline objects.
LowestCommonAncestorOffline.IQueries	Queries container for LowestCommonAncestorOffline computations for IntGraph.
LowestCommonAncestorOffline.IResult	Result of a LowestCommonAncestorOffline computation for IntGraph.
LowestCommonAncestorOffline.Queries<V,E>	Queries container for LowestCommonAncestorOffline computations.
LowestCommonAncestorOffline.Result<V,E>	Result of a LowestCommonAncestorOffline computation.
LowestCommonAncestorStatic	Static Lowest Common Ancestor (LCA) algorithm.
LowestCommonAncestorStatic.Builder	A builder for LowestCommonAncestorStatic objects.
LowestCommonAncestorStatic.DataStructure<V,E>	Data structure result created from a static LCA pre-processing.
LowestCommonAncestorStatic.IDataStructure	Data structure result created from a static LCA pre-processing for IntGraph.
Matching<V,E>	A matching in a graph.
MatchingAlgo	Maximum/minimum matching algorithm.
MatchingAlgo.Builder	A builder for MatchingAlgo objects.
MaximalCliquesEnumerator	Algorithm for enumerating over all maximal cliques in a graph.
MaximalCliquesEnumerator.Builder	A builder for MaximalCliquesEnumerator objects.
MaximumFlow	Calculate the maximum flow in a flow network.
MaximumFlow.Builder	A builder for MaximumFlow objects.
MaximumMatchingExample	This example demonstrates how to use the maximum matching algorithm.
MinimumCostFlow	Compute the minimum-cost (max) flow in a flow network.
MinimumCostFlow.Builder	A builder for MinimumCostFlow objects.
MinimumDirectedSpanningTree	Minimum spanning tree algorithm for directed graphs.
MinimumDirectedSpanningTree.Builder	A builder for MinimumDirectedSpanningTree objects.
MinimumEdgeCutAllST	Minimum Edge-Cut algorithm that finds all minimum edge-cuts in a graph between two terminal vertices (source-sink, S-T).
MinimumEdgeCutAllST.Builder	A builder for MinimumEdgeCutAllST objects.
MinimumEdgeCutGlobal	Global Minimum Edge-Cut algorithm without terminal vertices.
MinimumEdgeCutGlobal.Builder	A builder for MinimumEdgeCutGlobal objects.
MinimumEdgeCutST	Minimum Edge-Cut algorithm with terminal vertices (source-sink, S-T).
MinimumEdgeCutST.Builder	A builder for MinimumEdgeCutST objects.
MinimumMeanCycle	Algorithm that find the cycle with the minimum mean weight.
MinimumMeanCycle.Builder	A builder for MinimumMeanCycle objects.
MinimumSpanningTree	Minimum spanning tree algorithm.
MinimumSpanningTree.Builder	A builder for MinimumSpanningTree objects.
MinimumSpanningTree.IResult	A result object for MinimumSpanningTree computation for IntGraph.
MinimumSpanningTree.Result<V,E>	A result object for MinimumSpanningTree computation.
MinimumSpanningTreeExample	This example demonstrates how to use the minimum spanning tree algorithm.
MinimumVertexCutAllGlobal	Minimum Vertex-Cut algorithm that finds all minimum vertex-cuts in a graph (global vertex-cut).
MinimumVertexCutAllGlobal.Builder	A builder for MinimumVertexCutAllGlobal objects.
MinimumVertexCutAllST	Minimum Vertex-Cut algorithm that finds all minimum vertex-cuts in a graph between two terminal vertices (source-sink, S-T).
MinimumVertexCutAllST.Builder	A builder for MinimumVertexCutAllST objects.
MinimumVertexCutGlobal	Minimum Vertex-Cut algorithm without terminal vertices.
MinimumVertexCutGlobal.Builder	A builder for MinimumVertexCutGlobal objects.
MinimumVertexCutST	Minimum Vertex-Cut algorithm with terminal vertices (source-sink, S-T).
MinimumVertexCutST.Builder	A builder for MinimumVertexCutST objects.
NoSuchEdgeException	Exception thrown when an edge is not found in a graph.
NoSuchVertexException	Exception thrown when a vertex is not found in a graph.
Path<V,E>	A path of edges in a graph.
RandomizedAlgorithm	Randomized algorithm interface.
RecursiveMatrixGraphGenerator<V,E>	Generates a random graph using the R-MAT model.
ShortestPathAllPairs	An algorithm that compute all pairs shortest path (APSP) in a graph.
ShortestPathAllPairs.Builder	A builder for ShortestPathAllPairs objects.
ShortestPathAllPairs.IResult	A result object for an ShortestPathAllPairs algorithm for IntGraph.
ShortestPathAllPairs.Result<V,E>	A result object for an ShortestPathAllPairs algorithm.
ShortestPathExample	This example demonstrates how to use the single-source shortest path algorithm.
ShortestPathHeuristicST	Shortest path algorithm that uses a distance heuristic function.
ShortestPathHeuristicST.Builder	A builder for ShortestPathHeuristicST objects.
ShortestPathSingleSource	Single Source Shortest Path algorithm.
ShortestPathSingleSource.Builder	A builder for ShortestPathSingleSource objects.
ShortestPathSingleSource.IResult	A result object for the ShortestPathSingleSource problem for IntGraph.
ShortestPathSingleSource.Result<V,E>	A result object for the ShortestPathSingleSource problem.
ShortestPathST	An algorithm for computing the shortest path between two vertices in a graph.
ShortestPathST.Builder	A builder for ShortestPathST objects.
SimplePathsEnumerator	An algorithm that enumerate over simple paths between a source and a target.
SimplePathsEnumerator.Builder	A builder for SimplePathsEnumerator objects.
SteinerTreeAlgo	An algorithm for the Steiner tree problem.
SteinerTreeAlgo.Builder	A builder for SteinerTreeAlgo objects.
SteinerTreeAlgo.IResult	A result object for SteinerTreeAlgo computation for IntGraph.
SteinerTreeAlgo.Result<V,E>	A result object for SteinerTreeAlgo computation.
StronglyConnectedComponentsAlgo	Strongly Connected components algorithm.
StronglyConnectedComponentsAlgo.Builder	A builder for StronglyConnectedComponentsAlgo objects.
TopologicalOrderAlgo	Algorithm that calculate a topological order of graph vertices.
TopologicalOrderAlgo.Builder	A builder for TopologicalOrderAlgo objects.
TopologicalOrderAlgo.IResult	A result object of a TopologicalOrderAlgo algorithm for IntGraph.
TopologicalOrderAlgo.Result<V,E>	A result object of a TopologicalOrderAlgo algorithm.
TreePathMaxima	Tree Path Maxima (TPM) algorithm.
TreePathMaxima.Builder	A builder for TreePathMaxima objects.
TreePathMaxima.IQueries	Queries container for TreePathMaxima computations for IntGraph.
TreePathMaxima.IResult	A result object for TreePathMaxima algorithm for IntGraph.
TreePathMaxima.Queries<V,E>	Queries container for TreePathMaxima computations.
TreePathMaxima.Result<V,E>	A result object for TreePathMaxima algorithm.
Trees	Static methods class for tree graphs.
TspMetric	Metric Traveling Salesman Problem (TSP) algorithm.
TspMetricMatchingAppx	TSP \(3/2\)-approximation using maximum matching.
TspMetricMSTAppx	TSP \(2\)-approximation using MST.
VertexBiPartition<V,E>	A partition of the vertices of a graph into two blocks.
VertexCover	Minimum weighted vertex cover algorithm.
VertexCover.Builder	A builder for VertexCover algorithms.
VertexPartition<V,E>	A partition of the vertices of a graph.
VoronoiAlgo	Voronoi cells algorithm.
VoronoiAlgo.Builder	A builder for VoronoiAlgo algorithms.
VoronoiAlgo.IResult	A result object of VoronoiAlgo computation for IntGraph.
VoronoiAlgo.Result<V,E>	A result object of VoronoiAlgo computation.
WeaklyConnectedComponentsAlgo	Weakly Connected components algorithm.
WeaklyConnectedComponentsAlgo.Builder	A builder for WeaklyConnectedComponentsAlgo objects.
WeightFunction<K>	Weight function that maps graph edges or vertices to weights.
WeightFunctionInt<K>	Weight function that maps graph edges or vertices to integer weights.
WeightFunctions	Static methods class for weight functions.
Weights<K,T>	Weights of graph vertices or edges.
WeightsBool<K>	Specific weights of boolean.
WeightsByte<K>	Specific weights of byte.
WeightsChar<K>	Specific weights of char.
WeightsDouble<K>	Specific weights of double.
WeightsFloat<K>	Specific weights of float.
WeightsInt<K>	Specific weights of int.
WeightsLong<K>	Specific weights of long.
WeightsObj<K,T>	Specific weights of Object.
WeightsShort<K>	Specific weights of short.