All Classes
-
All Classes Interface Summary Class Summary Enum Summary Class Description APSPBench BfsDfsExample BFSIter Bread first search (BFS) iterator.BiConnectedComponentsAlgo An algorithm that compute the bi-connected components of a graph.BiConnectedComponentsAlgo.Builder A builder forBiConnectedComponentsAlgoobjects.BiConnectedComponentsAlgo.Result A result object of aBiConnectedComponentsAlgocomputation.ChinesePostman An algorithm for the chinese postman problem.ChinesePostman.Builder A builder forChinesePostmanobjects.Coloring An algorithm that assign a color to each vertex in a graph while avoiding identical color for any pair of adjacent vertices.Coloring.Builder A builder forColoringobjects.Coloring.Result A coloring result containing a color for each vertex.ColoringBench ColoringExample ConnectedComponentsAlgo Connectivity components algorithm.ConnectedComponentsAlgo.Builder A builder forConnectedComponentsAlgoobjects.ConnectedComponentsAlgo.Result Result object for connectivity components calculation.CoreAlgo Cores computing algorithm.CoreAlgo.Builder A builder forCoreAlgoobjects.CoreAlgo.DegreeType The degree type the cores are defined with respect to.CoreAlgo.Result The result of the cores computation.Cut A cut that partition the vertices of a graph into two sets.CyclesFinder An algorithm that finds all cycles in a graph.CyclesFinder.Builder A builder forCyclesFinderobjects.CyclesFinderBench DFSIter Depth first search (DFS) iterator.EdgeIter Iterator used to iterate over edges of a vertex.EdgeIterationExample EdgeSet Set of graph edges.EulerianTourAlgo Eulerian tour calculation algorithm.EulerianTourAlgo.Builder A builder forEulerianTourAlgoobjects.FlowNetwork Flow on graph edges, with capacities and flows values.FlowNetwork.Int Flow on graph edges, with integer capacities and flows values.Graph A discrete graph with vertices and edges.GraphBuilder A builder for graphs.GraphCapabilities Object specifying the capabilities of a graph implementation.GraphFactory A factory forGraphobjects.GraphFactory.Hint Hints for a graph factory.Graphs Static methods class for graphs.GraphsUtils Static methods class for graphs.HeapBench HeapReferenceableBench 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 A mapping betweenGraphIDs toIndexGraphindices.IndexIdMaps Static methods class for index-id maps.IndexSwapListener A listener that will be notified when aIndexGraphchooses to swap two IDs (vertices/edges).JGAlgoConfig A global configuration class.LCADynamicBench LowestCommonAncestorDynamic Dynamic algorithm for Lowest Common Ancestor (LCA) queries.LowestCommonAncestorDynamic.Builder A builder forLowestCommonAncestorDynamicobjects.LowestCommonAncestorDynamic.Node A tree node in anLowestCommonAncestorDynamicdata structure.LowestCommonAncestorExample LowestCommonAncestorStatic Static Lowest Common Ancestor (LCA) algorithm.LowestCommonAncestorStatic.Builder A builder forLowestCommonAncestorStaticobjects.LowestCommonAncestorStatic.DataStructure Data structure result created from a static LCA pre-processing.Matching A matching in a graph.MatchingAlgorithm Maximum/minimum matching algorithm.MatchingAlgorithm.Builder A builder forMatchingAlgorithmobjects.MatchingBench MatchingBench.MaximumCardinality MatchingBench.MaximumCardinalityBipartite MatchingBench.MaximumWeighted MatchingBench.MaximumWeightedBipartite MatchingBench.MinimumPerfect MatchingBench.MinimumPerfectBipartite MaximalCliques Finds all maximal cliques in a graph.MaximalCliques.Builder A builder forMaximalCliquesobjects.MaximalCliquesBench MaximalCliquesBench.BarabasiAlbert MaximalCliquesBench.Gnp MaximalCliquesBench.RecursiveMatrix MaximumFlow Calculate the maximum flow in a flow network.MaximumFlow.Builder A builder forMaximumFlowobjects.MaximumFlowBench MaximumFlowBench.BarabasiAlbert MaximumFlowBench.Gnp MaximumFlowBench.RecursiveMatrix MaximumMatchingExample MinCostFlowBench MinCostFlowBench.MaxFlow MinCostFlowBench.MaxFlow.BarabasiAlbert MinCostFlowBench.MaxFlow.Gnp MinCostFlowBench.MaxFlow.RecursiveMatrix MinCostFlowBench.Supply MinCostFlowBench.Supply.BarabasiAlbert MinCostFlowBench.Supply.Gnp MinCostFlowBench.Supply.RecursiveMatrix MinimumCostFlow Compute the minimum-cost (max) flow in a flow network.MinimumCostFlow.Builder A builder forMinimumCostFlowobjects.MinimumCutGlobal Global Minimum Cut algorithm without terminal vertices.MinimumCutGlobal.Builder A builder forMinimumCutGlobalobjects.MinimumCutST Minimum Cut algorithm with terminal vertices (source-sink, S-T).MinimumCutST.Builder A builder forMinimumCutSTobjects.MinimumDirectedSpanningTree Minimum spanning tree algorithm for directed graphs.MinimumDirectedSpanningTree.Builder A builder forMinimumDirectedSpanningTreeobjects.MinimumMeanCycle Algorithm that find the cycle with the minimum mean weight.MinimumMeanCycle.Builder A builder forMinimumMeanCycleobjects.MinimumMeanCycleBench MinimumSpanningTree Minimum spanning tree algorithm.MinimumSpanningTree.Builder A builder forMinimumSpanningTreeobjects.MinimumSpanningTree.Result A result object forMinimumSpanningTreecomputation.MinimumSpanningTreeExample MSTBench Path A path of edges in a graph.RMQStaticBench RMQStaticBench.PreProcess RMQStaticBench.PreProcessPlusMinusOne RMQStaticBench.Query RMQStaticBench.Query.CartesianTrees RMQStaticBench.Query.LookupTable RMQStaticBench.Query.PlusMinusOne RMQStaticBench.Query.PowerOf2Table ShortestPathAllPairs An algorithm that compute all pairs shortest path (APSP) in a graph.ShortestPathAllPairs.Builder A builder forShortestPathAllPairsobjects.ShortestPathAllPairs.Result A result object for anShortestPathAllPairsalgorithm.ShortestPathExample ShortestPathSingleSource Single Source Shortest Path algorithm.ShortestPathSingleSource.Builder A builder forShortestPathSingleSourceobjects.ShortestPathSingleSource.Result A result object for theShortestPathSingleSourceproblem.ShortestPathWithHeuristic Shortest path algorithm that uses a distance heuristic function.ShortestPathWithHeuristic.Builder A builder forShortestPathWithHeuristicobjects.SSSPNegativeWeightsBench SSSPNegativeWeightsBench.BarabasiAlbert SSSPNegativeWeightsBench.Gnp SSSPNegativeWeightsBench.RecursiveMatrix SSSPPositiveWeightsBench SSSPPositiveWeightsBench.BarabasiAlbert SSSPPositiveWeightsBench.Gnp SSSPPositiveWeightsBench.RecursiveMatrix TopologicalOrderAlgo Algorithm that calculate a topological order of graph vertices.TopologicalOrderAlgo.Builder A builder forTopologicalOrderAlgoobjects.TopologicalOrderAlgo.Result A result object of aTopologicalOrderAlgoalgorithm.TreePathMaxima Tree Path Maxima (TPM) algorithm.TreePathMaxima.Builder A builder forTreePathMaximaobjects.TreePathMaxima.Queries Queries container forTreePathMaximacomputations.TreePathMaxima.Result A result object forTreePathMaximaalgorithm.TreePathMaximaBench 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.UnionFindBench VertexCover Minimum weighted vertex cover algorithm.VertexCover.Builder A builder forVertexCoveralgorithms.VertexCover.Result A result object ofVertexCovercomputation.WeightFunction Weight function that maps graph edges (or vertices) to weights.WeightFunction.Int Weight function that maps graph edges (or vertices) to integer weights.WeightFunctions Static methods class for weight functions.Weights<W> Weights of graph vertices or edges.Weights.Bool Specific weights of primitive typeboolean.Weights.Byte Specific weights of primitive typebyte.Weights.Char Specific weights of primitive typechar.Weights.Double Specific weights of primitive typedouble.Weights.Float Specific weights of primitive typefloat.Weights.Int Specific weights of primitive typeint.Weights.Long Specific weights of primitive typelong.Weights.Short Specific weights of primitive typeshort.