A B C D E F G H I J K L M N O P Q R S T U V W Y
All Classes All Packages
All Classes All Packages
All Classes All Packages
A
- addEdge(int, int) - Method in interface com.jgalgo.graph.Graph
-
Add a new edge to the graph.
- addEdge(int, int) - Method in interface com.jgalgo.graph.GraphBuilder
-
Add a new edge to the graph.
- addEdge(int, int) - Method in interface com.jgalgo.graph.IndexGraphBuilder
-
Add a new edge to the graph.
- addEdge(int, int, int) - Method in interface com.jgalgo.graph.Graph
-
Add a new edge to the graph with user chosen ID.
- addEdge(int, int, int) - Method in interface com.jgalgo.graph.GraphBuilder
-
Add a new edge to the graph, with user-chosen identifier.
- addEdge(int, int, int) - Method in interface com.jgalgo.graph.IndexGraph
-
Deprecated.
- addEdge(int, int, int) - Method in interface com.jgalgo.graph.IndexGraphBuilder
-
Add a new edge to the graph, with user-chosen identifier.
- addEdgeSwapListener(IndexSwapListener) - Method in interface com.jgalgo.graph.IndexGraph
-
Adds a listener that will be called each time a edge swap is performed.
- addEdgesWeights(Object, Class<? super E>) - Method in interface com.jgalgo.graph.Graph
-
Add a new weights container associated with the edges of this graph.
- addEdgesWeights(Object, Class<? super E>) - Method in interface com.jgalgo.graph.GraphBuilder
-
Add a new weights container associated with the edges of the built graph.
- addEdgesWeights(Object, Class<? super E>) - Method in interface com.jgalgo.graph.IndexGraphBuilder
-
Add a new weights container associated with the edges of the built graph.
- addEdgesWeights(Object, Class<? super E>, E) - Method in interface com.jgalgo.graph.Graph
-
Add a new weights container associated with the edges of this graph with default value.
- addEdgesWeights(Object, Class<? super E>, E) - Method in interface com.jgalgo.graph.GraphBuilder
-
Add a new weights container associated with the edges of the built graph with default value.
- addEdgesWeights(Object, Class<? super E>, E) - Method in interface com.jgalgo.graph.IndexGraphBuilder
-
Add a new weights container associated with the edges of the built graph with default value.
- addHint(GraphFactory.Hint) - Method in interface com.jgalgo.graph.GraphFactory
-
Add a hint to this factory.
- addHint(GraphFactory.Hint) - Method in interface com.jgalgo.graph.IndexGraphFactory
-
Add a hint to this factory.
- addLeaf(LowestCommonAncestorDynamic.Node) - Method in interface com.jgalgo.LowestCommonAncestorDynamic
-
Add a new leaf node to the tree.
- addQuery(int, int) - Method in interface com.jgalgo.TreePathMaxima.Queries
-
Add a query for the heaviest edge in a tree between two vertices.
- addVertex() - Method in interface com.jgalgo.graph.Graph
-
Add a new vertex to the graph.
- addVertex() - Method in interface com.jgalgo.graph.GraphBuilder
-
Add a new vertex to the graph.
- addVertex() - Method in interface com.jgalgo.graph.IndexGraphBuilder
-
Add a new vertex to the graph.
- addVertex(int) - Method in interface com.jgalgo.graph.Graph
-
Add a new vertex to the graph with user chosen ID.
- addVertex(int) - Method in interface com.jgalgo.graph.GraphBuilder
-
Add a new vertex to the graph, with user-chosen identifier.
- addVertex(int) - Method in interface com.jgalgo.graph.IndexGraph
-
Deprecated.
- addVertexSwapListener(IndexSwapListener) - Method in interface com.jgalgo.graph.IndexGraph
-
Adds a listener that will be called each time a vertex swap is performed.
- addVerticesWeights(Object, Class<? super V>) - Method in interface com.jgalgo.graph.Graph
-
Add a new weights container associated with the vertices of this graph.
- addVerticesWeights(Object, Class<? super V>) - Method in interface com.jgalgo.graph.GraphBuilder
-
Add a new weights container associated with the vertices of the built graph.
- addVerticesWeights(Object, Class<? super V>) - Method in interface com.jgalgo.graph.IndexGraphBuilder
-
Add a new weights container associated with the vertices of the built graph.
- addVerticesWeights(Object, Class<? super V>, V) - Method in interface com.jgalgo.graph.Graph
-
Add a new weights container associated with the vertices of this graph with default value.
- addVerticesWeights(Object, Class<? super V>, V) - Method in interface com.jgalgo.graph.GraphBuilder
-
Add a new weights container associated with the vertices of built graph with default value.
- addVerticesWeights(Object, Class<? super V>, V) - Method in interface com.jgalgo.graph.IndexGraphBuilder
-
Add a new weights container associated with the vertices of built graph with default value.
- allowParallelEdges(boolean) - Method in interface com.jgalgo.graph.GraphFactory
-
Determine if graphs built by this factory should be support parallel edges.
- allowParallelEdges(boolean) - Method in interface com.jgalgo.graph.IndexGraphFactory
-
Determine if graphs built by this factory should be support parallel edges.
- allowSelfEdges(boolean) - Method in interface com.jgalgo.graph.GraphFactory
-
Determine if graphs built by this factory should be support self edges.
- allowSelfEdges(boolean) - Method in interface com.jgalgo.graph.IndexGraphFactory
-
Determine if graphs built by this factory should be support self edges.
- APSPBench - Class in com.jgalgo.bench.impls
- APSPBench() - Constructor for class com.jgalgo.bench.impls.APSPBench
- args - Variable in class com.jgalgo.bench.impls.APSPBench
- args - Variable in class com.jgalgo.bench.impls.ColoringBench
- args - Variable in class com.jgalgo.bench.impls.CyclesFinderBench
- args - Variable in class com.jgalgo.bench.impls.HeapBench
- args - Variable in class com.jgalgo.bench.impls.HeapReferenceableBench
- args - Variable in class com.jgalgo.bench.impls.LCADynamicBench
- args - Variable in class com.jgalgo.bench.impls.MatchingBench.MaximumCardinality
- args - Variable in class com.jgalgo.bench.impls.MatchingBench.MaximumCardinalityBipartite
- args - Variable in class com.jgalgo.bench.impls.MatchingBench.MaximumWeighted
- args - Variable in class com.jgalgo.bench.impls.MatchingBench.MaximumWeightedBipartite
- args - Variable in class com.jgalgo.bench.impls.MatchingBench.MinimumPerfect
- args - Variable in class com.jgalgo.bench.impls.MatchingBench.MinimumPerfectBipartite
- args - Variable in class com.jgalgo.bench.impls.MaximalCliquesBench.BarabasiAlbert
- args - Variable in class com.jgalgo.bench.impls.MaximalCliquesBench.Gnp
- args - Variable in class com.jgalgo.bench.impls.MaximalCliquesBench.RecursiveMatrix
- args - Variable in class com.jgalgo.bench.impls.MaximumFlowBench.BarabasiAlbert
- args - Variable in class com.jgalgo.bench.impls.MaximumFlowBench.Gnp
- args - Variable in class com.jgalgo.bench.impls.MaximumFlowBench.RecursiveMatrix
- args - Variable in class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow.BarabasiAlbert
- args - Variable in class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow.Gnp
- args - Variable in class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow.RecursiveMatrix
- args - Variable in class com.jgalgo.bench.impls.MinCostFlowBench.Supply.BarabasiAlbert
- args - Variable in class com.jgalgo.bench.impls.MinCostFlowBench.Supply.Gnp
- args - Variable in class com.jgalgo.bench.impls.MinCostFlowBench.Supply.RecursiveMatrix
- args - Variable in class com.jgalgo.bench.impls.MinimumMeanCycleBench
- args - Variable in class com.jgalgo.bench.impls.MSTBench
- args - Variable in class com.jgalgo.bench.impls.RMQStaticBench.PreProcess
- args - Variable in class com.jgalgo.bench.impls.RMQStaticBench.PreProcessPlusMinusOne
- args - Variable in class com.jgalgo.bench.impls.RMQStaticBench.Query.CartesianTrees
- args - Variable in class com.jgalgo.bench.impls.RMQStaticBench.Query.LookupTable
- args - Variable in class com.jgalgo.bench.impls.RMQStaticBench.Query.PlusMinusOne
- args - Variable in class com.jgalgo.bench.impls.RMQStaticBench.Query.PowerOf2Table
- args - Variable in class com.jgalgo.bench.impls.SSSPNegativeWeightsBench.BarabasiAlbert
- args - Variable in class com.jgalgo.bench.impls.SSSPNegativeWeightsBench.Gnp
- args - Variable in class com.jgalgo.bench.impls.SSSPNegativeWeightsBench.RecursiveMatrix
- args - Variable in class com.jgalgo.bench.impls.SSSPPositiveWeightsBench.BarabasiAlbert
- args - Variable in class com.jgalgo.bench.impls.SSSPPositiveWeightsBench.Gnp
- args - Variable in class com.jgalgo.bench.impls.SSSPPositiveWeightsBench.RecursiveMatrix
- args - Variable in class com.jgalgo.bench.impls.TreePathMaximaBench
- args - Variable in class com.jgalgo.bench.impls.UnionFindBench
B
- BarabasiAlbert() - Constructor for class com.jgalgo.bench.impls.MaximalCliquesBench.BarabasiAlbert
- BarabasiAlbert() - Constructor for class com.jgalgo.bench.impls.MaximumFlowBench.BarabasiAlbert
- BarabasiAlbert() - Constructor for class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow.BarabasiAlbert
- BarabasiAlbert() - Constructor for class com.jgalgo.bench.impls.MinCostFlowBench.Supply.BarabasiAlbert
- BarabasiAlbert() - Constructor for class com.jgalgo.bench.impls.SSSPNegativeWeightsBench.BarabasiAlbert
- BarabasiAlbert() - Constructor for class com.jgalgo.bench.impls.SSSPPositiveWeightsBench.BarabasiAlbert
- BellmanFord(Blackhole) - Method in class com.jgalgo.bench.impls.SSSPNegativeWeightsBench.BarabasiAlbert
- BellmanFord(Blackhole) - Method in class com.jgalgo.bench.impls.SSSPNegativeWeightsBench.Gnp
- BellmanFord(Blackhole) - Method in class com.jgalgo.bench.impls.SSSPNegativeWeightsBench.RecursiveMatrix
- benchPreProcess(Blackhole) - Method in class com.jgalgo.bench.impls.RMQStaticBench.PreProcessPlusMinusOne
- benchQuery(Blackhole) - Method in class com.jgalgo.bench.impls.RMQStaticBench.Query.CartesianTrees
- benchQuery(Blackhole) - Method in class com.jgalgo.bench.impls.RMQStaticBench.Query.LookupTable
- benchQuery(Blackhole) - Method in class com.jgalgo.bench.impls.RMQStaticBench.Query.PlusMinusOne
- benchQuery(Blackhole) - Method in class com.jgalgo.bench.impls.RMQStaticBench.Query.PowerOf2Table
- BfsDfsExample - Class in com.jgalgo.example
- BfsDfsExample() - Constructor for class com.jgalgo.example.BfsDfsExample
- BFSExample() - Static method in class com.jgalgo.example.BfsDfsExample
- BFSIter - Interface in com.jgalgo
-
Bread first search (BFS) iterator.
- BiConnectedComponentsAlgo - Interface in com.jgalgo
-
An algorithm that compute the bi-connected components of a graph.
- BiConnectedComponentsAlgo.Builder - Interface in com.jgalgo
-
A builder for
BiConnectedComponentsAlgo
objects. - BiConnectedComponentsAlgo.Result - Interface in com.jgalgo
-
A result object of a
BiConnectedComponentsAlgo
computation. - Binary(Blackhole) - Method in class com.jgalgo.bench.impls.HeapBench
- Binomial(Blackhole) - Method in class com.jgalgo.bench.impls.HeapBench
- Binomial(Blackhole) - Method in class com.jgalgo.bench.impls.HeapReferenceableBench
- BipartiteHungarianMethod(Blackhole) - Method in class com.jgalgo.bench.impls.MatchingBench.MaximumWeightedBipartite
- BipartiteHungarianMethod(Blackhole) - Method in class com.jgalgo.bench.impls.MatchingBench.MinimumPerfectBipartite
- BipartiteSSSP(Blackhole) - Method in class com.jgalgo.bench.impls.MatchingBench.MaximumWeightedBipartite
- BlossomV(Blackhole) - Method in class com.jgalgo.bench.impls.MatchingBench.MaximumWeighted
- BlossomV(Blackhole) - Method in class com.jgalgo.bench.impls.MatchingBench.MaximumWeightedBipartite
- BlossomV(Blackhole) - Method in class com.jgalgo.bench.impls.MatchingBench.MinimumPerfect
- BlossomV(Blackhole) - Method in class com.jgalgo.bench.impls.MatchingBench.MinimumPerfectBipartite
- Boruvka(Blackhole) - Method in class com.jgalgo.bench.impls.MSTBench
- BronKerbosch(Blackhole) - Method in class com.jgalgo.bench.impls.MaximalCliquesBench.BarabasiAlbert
- BronKerbosch(Blackhole) - Method in class com.jgalgo.bench.impls.MaximalCliquesBench.Gnp
- BronKerbosch(Blackhole) - Method in class com.jgalgo.bench.impls.MaximalCliquesBench.RecursiveMatrix
- BronKerboschPivot(Blackhole) - Method in class com.jgalgo.bench.impls.MaximalCliquesBench.BarabasiAlbert
- BronKerboschPivot(Blackhole) - Method in class com.jgalgo.bench.impls.MaximalCliquesBench.Gnp
- BronKerboschPivot(Blackhole) - Method in class com.jgalgo.bench.impls.MaximalCliquesBench.RecursiveMatrix
- build() - Method in interface com.jgalgo.BiConnectedComponentsAlgo.Builder
-
Create a new algorithm object for bi-connected components computation.
- build() - Method in interface com.jgalgo.ChinesePostman.Builder
-
Create a new algorithm object for chinese postman problem.
- build() - Method in interface com.jgalgo.Coloring.Builder
-
Create a new algorithm object for coloring computation.
- build() - Method in interface com.jgalgo.ConnectedComponentsAlgo.Builder
-
Create a new algorithm object for connectivity components computation.
- build() - Method in interface com.jgalgo.CoreAlgo.Builder
-
Build a new
CoreAlgo
object. - build() - Method in interface com.jgalgo.CyclesFinder.Builder
-
Create a new algorithm object for cycles computation.
- build() - Method in interface com.jgalgo.EulerianTourAlgo.Builder
-
Create a new algorithm object for Eulerian tours computation.
- build() - Method in interface com.jgalgo.graph.GraphBuilder
-
Build a new immutable graph with the builder vertices and edges.
- build() - Method in interface com.jgalgo.graph.IndexGraphBuilder
-
Build a new immutable index graph with the builder vertices and edges.
- build() - Method in interface com.jgalgo.LowestCommonAncestorDynamic.Builder
-
Create a new dynamic LCA algorithm.
- build() - Method in interface com.jgalgo.LowestCommonAncestorStatic.Builder
-
Create a new static LCA algorithm.
- build() - Method in interface com.jgalgo.MatchingAlgorithm.Builder
-
Create a new matching algorithm object.
- build() - Method in interface com.jgalgo.MaximalCliques.Builder
-
Build a new
MaximalCliques
object. - build() - Method in interface com.jgalgo.MaximumFlow.Builder
-
Create a new algorithm object for maximum flow computation.
- build() - Method in interface com.jgalgo.MinimumCostFlow.Builder
-
Create a new algorithm object for minimum cost flow computation.
- build() - Method in interface com.jgalgo.MinimumCutGlobal.Builder
-
Create a new algorithm object for global minimum cut computation.
- build() - Method in interface com.jgalgo.MinimumCutST.Builder
-
Create a new algorithm object for minimum cut computation.
- build() - Method in interface com.jgalgo.MinimumDirectedSpanningTree.Builder
-
Create a new algorithm object for minimum directed spanning tree computation.
- build() - Method in interface com.jgalgo.MinimumMeanCycle.Builder
-
Create a new algorithm object for minimum mean cycle computation.
- build() - Method in interface com.jgalgo.MinimumSpanningTree.Builder
-
Create a new algorithm object for minimum spanning tree computation.
- build() - Method in interface com.jgalgo.ShortestPathAllPairs.Builder
-
Create a new algorithm object for all pairs shortest paths computation.
- build() - Method in interface com.jgalgo.ShortestPathSingleSource.Builder
-
Create a new algorithm object for single source shortest path computation.
- build() - Method in interface com.jgalgo.ShortestPathWithHeuristic.Builder
-
Create a new algorithm object for shortest path with heuristic computation.
- build() - Method in interface com.jgalgo.TopologicalOrderAlgo.Builder
-
Create a new algorithm object for topological order computation.
- build() - Method in interface com.jgalgo.TreePathMaxima.Builder
-
Create a new algorithm object for tree path maxima computation.
- build() - Method in interface com.jgalgo.VertexCover.Builder
-
Create a new algorithm object for minimum vertex cover computation.
- buildMutable() - Method in interface com.jgalgo.graph.GraphBuilder
-
Build a new mutable graph with the builder vertices and edges.
- buildMutable() - Method in interface com.jgalgo.graph.IndexGraphBuilder
-
Build a new mutable index graph with the builder vertices and edges.
C
- CardinalityBipartiteHopcroftKarp(Blackhole) - Method in class com.jgalgo.bench.impls.MatchingBench.MaximumCardinalityBipartite
- CardinalityGabow1976(Blackhole) - Method in class com.jgalgo.bench.impls.MatchingBench.MaximumCardinality
- CardinalityGabow1976(Blackhole) - Method in class com.jgalgo.bench.impls.MatchingBench.MaximumCardinalityBipartite
- CardinalityWeightFunction - Static variable in interface com.jgalgo.graph.WeightFunction
-
A weight function that assign a weight of
1
to any element. - CartesianTrees() - Constructor for class com.jgalgo.bench.impls.RMQStaticBench.Query.CartesianTrees
- CartesianTrees(Blackhole) - Method in class com.jgalgo.bench.impls.RMQStaticBench.PreProcess
- ChinesePostman - Interface in com.jgalgo
-
An algorithm for the chinese postman problem.
- ChinesePostman.Builder - Interface in com.jgalgo
-
A builder for
ChinesePostman
objects. - clear() - Method in interface com.jgalgo.graph.Graph
-
Clear the graph completely by removing all vertices and edges.
- clear() - Method in interface com.jgalgo.graph.GraphBuilder
-
Clear the builder by removing all vertices and edges added to it.
- clear() - Method in interface com.jgalgo.graph.IndexGraphBuilder
-
Clear the builder by removing all vertices and edges added to it.
- clear() - Method in interface com.jgalgo.LowestCommonAncestorDynamic
-
Clear the data structure by removing all nodes in the tree.
- clear() - Method in interface com.jgalgo.TreePathMaxima.Queries
-
Clear the container from all existing queries.
- clearEdges() - Method in interface com.jgalgo.graph.Graph
-
Remove all the edges from the graph.
- Coloring - Interface in com.jgalgo
-
An algorithm that assign a color to each vertex in a graph while avoiding identical color for any pair of adjacent vertices.
- Coloring.Builder - Interface in com.jgalgo
-
A builder for
Coloring
objects. - Coloring.Result - Interface in com.jgalgo
-
A coloring result containing a color for each vertex.
- ColoringBench - Class in com.jgalgo.bench.impls
- ColoringBench() - Constructor for class com.jgalgo.bench.impls.ColoringBench
- coloringExample() - Static method in class com.jgalgo.example.ColoringExample
- ColoringExample - Class in com.jgalgo.example
- ColoringExample() - Constructor for class com.jgalgo.example.ColoringExample
- colorOf(int) - Method in interface com.jgalgo.Coloring.Result
-
Get the color assigned to a vertex.
- colorsNum() - Method in interface com.jgalgo.Coloring.Result
-
The total number of different colors used in the coloring.
- com.jgalgo - package com.jgalgo
- com.jgalgo.bench.impls - package com.jgalgo.bench.impls
- com.jgalgo.example - package com.jgalgo.example
- com.jgalgo.graph - package com.jgalgo.graph
- compare(int, int) - Method in interface com.jgalgo.graph.WeightFunction
-
Compare two elements by their weights.
- compare(int, int) - Method in interface com.jgalgo.graph.WeightFunction.Int
- computeAllCardinalityShortestPaths(Graph) - Method in interface com.jgalgo.ShortestPathAllPairs
-
Compute the cardinality shortest path between each pair of vertices in a graph.
- computeAllShortestPaths(Graph, WeightFunction) - Method in interface com.jgalgo.ShortestPathAllPairs
-
Compute the shortest path between each pair of vertices in a graph.
- computeBiConnectivityComponents(Graph) - Method in interface com.jgalgo.BiConnectedComponentsAlgo
-
Compute all maximal bi-connected components of a graph.
- computeCardinalityShortestPaths(Graph, int) - Method in interface com.jgalgo.ShortestPathSingleSource
-
Compute the cardinality shortest paths from a source to any other vertex in a graph.
- computeColoring(Graph) - Method in interface com.jgalgo.Coloring
-
Assign a color to each vertex of the given graph, resulting in a valid coloring.
- computeConnectivityComponents(Graph) - Method in interface com.jgalgo.ConnectedComponentsAlgo
-
Find all (strongly) connected components in a graph.
- computeCores(Graph) - Method in interface com.jgalgo.CoreAlgo
-
Compute the cores of the graph with respect to both in and out degree of the vertices.
- computeCores(Graph, CoreAlgo.DegreeType) - Method in interface com.jgalgo.CoreAlgo
-
Compute the cores of the graph with respect the given degree type.
- computeEulerianTour(Graph) - Method in interface com.jgalgo.EulerianTourAlgo
-
Compute an Eulerian tour in the graph that visit all edges exactly once.
- computeHeaviestEdgeInTreePaths(Graph, WeightFunction, TreePathMaxima.Queries) - Method in interface com.jgalgo.TreePathMaxima
-
Compute the heaviest edge in multiple tree paths.
- computeMaximumCardinalityMatching(Graph) - Method in interface com.jgalgo.MatchingAlgorithm
-
Compute the maximum matching of unweighted undirected graph.
- computeMaximumFlow(Graph, FlowNetwork, int, int) - Method in interface com.jgalgo.MaximumFlow
-
Calculate the maximum flow in a network between a source and a sink.
- computeMaximumFlow(Graph, FlowNetwork, IntCollection, IntCollection) - Method in interface com.jgalgo.MaximumFlow
-
Calculate the maximum flow in a network between a set of sources and a set of sinks.
- computeMaximumWeightedMatching(Graph, WeightFunction) - Method in interface com.jgalgo.MatchingAlgorithm
-
Compute the maximum weighted matching of a weighted undirected graph.
- computeMaximumWeightedPerfectMatching(Graph, WeightFunction) - Method in interface com.jgalgo.MatchingAlgorithm
-
Compute the maximum perfect matching of a weighted undirected graph.
- computeMinCostFlow(Graph, FlowNetwork, WeightFunction, WeightFunction) - Method in interface com.jgalgo.MinimumCostFlow
-
Compute the min-cost (not maximum!) flow in a network given a supply for each vertex.
- computeMinCostFlow(Graph, FlowNetwork, WeightFunction, WeightFunction, WeightFunction) - Method in interface com.jgalgo.MinimumCostFlow
-
Compute the min-cost (not maximum!) flow in a network given a supply for each vertex and a lower bound for the edges flows.
- computeMinCostMaxFlow(Graph, FlowNetwork, WeightFunction, int, int) - Method in interface com.jgalgo.MinimumCostFlow
-
Compute the min-cost max-flow in a network between a source and a sink.
- computeMinCostMaxFlow(Graph, FlowNetwork, WeightFunction, WeightFunction, int, int) - Method in interface com.jgalgo.MinimumCostFlow
-
Compute the min-cost max-flow in a network between a source and a sink given a lower bound for the edges flows.
- computeMinCostMaxFlow(Graph, FlowNetwork, WeightFunction, WeightFunction, IntCollection, IntCollection) - Method in interface com.jgalgo.MinimumCostFlow
-
Compute the min-cost max-flow in a network between a set of sources and a set of sinks given a lower bound for the edges flows.
- computeMinCostMaxFlow(Graph, FlowNetwork, WeightFunction, IntCollection, IntCollection) - Method in interface com.jgalgo.MinimumCostFlow
-
Compute the min-cost max-flow in a network between a set of sources and a set of sinks.
- computeMinimumCut(Graph, WeightFunction) - Method in interface com.jgalgo.MinimumCutGlobal
-
Compute the global minimum cut in a graph.
- computeMinimumCut(Graph, WeightFunction, int, int) - Method in interface com.jgalgo.MinimumCutST
-
Compute the minimum cut in a graph between two terminal vertices.
- computeMinimumCut(Graph, WeightFunction, IntCollection, IntCollection) - Method in interface com.jgalgo.MinimumCutST
-
Compute the minimum cut in a graph between two sets of vertices.
- computeMinimumDirectedSpanningTree(Graph, WeightFunction, int) - Method in interface com.jgalgo.MinimumDirectedSpanningTree
-
Compute a minimum directed spanning tree (MDST) in a directed graph, rooted at the given vertex.
- computeMinimumMeanCycle(Graph, WeightFunction) - Method in interface com.jgalgo.MinimumMeanCycle
-
Compute the minimum mean cycle in a graph.
- computeMinimumSpanningTree(Graph, WeightFunction) - Method in interface com.jgalgo.MinimumSpanningTree
-
Compute the minimum spanning tree (MST) of a given graph.
- computeMinimumVertexCover(Graph, WeightFunction) - Method in interface com.jgalgo.VertexCover
-
Compute a minimum vertex cover of a graph with respect to a vertex weight function.
- computeMinimumWeightedMatching(Graph, WeightFunction) - Method in interface com.jgalgo.MatchingAlgorithm
-
Compute the minimum weighted matching of a weighted undirected graph.
- computeMinimumWeightedPerfectMatching(Graph, WeightFunction) - Method in interface com.jgalgo.MatchingAlgorithm
-
Compute the minimum perfect matching of a weighted undirected graph.
- computeShortestEdgeVisitorCircle(Graph, WeightFunction) - Method in interface com.jgalgo.ChinesePostman
-
Compute the shortest circuit that visits all edges in the graph at least once.
- computeShortestPath(Graph, WeightFunction, int, int, IntToDoubleFunction) - Method in interface com.jgalgo.ShortestPathWithHeuristic
-
Compute the shortest path between two vertices in a graph.
- computeShortestPaths(Graph, WeightFunction, int) - Method in interface com.jgalgo.ShortestPathSingleSource
-
Compute the shortest paths from a source to any other vertex in a graph.
- computeShortestTour(Graph, WeightFunction) - Method in interface com.jgalgo.TSPMetric
-
Compute the shortest tour that visit all vertices.
- computeSubsetCardinalityShortestPaths(Graph, IntCollection) - Method in interface com.jgalgo.ShortestPathAllPairs
-
Compute the cardinality shortest path between each pair of vertices in a given subset of the vertices of the graph.
- computeSubsetShortestPaths(Graph, IntCollection, WeightFunction) - Method in interface com.jgalgo.ShortestPathAllPairs
-
Compute the shortest path between each pair of vertices in a given subset of the vertices of the graph.
- computeTopologicalSorting(Graph) - Method in interface com.jgalgo.TopologicalOrderAlgo
-
Compute the topological order of a DAG vertices.
- computeWeaklyConnectivityComponents(Graph) - Method in interface com.jgalgo.ConnectedComponentsAlgo
-
Compute all weakly connected components in a directed graph.
- ConnectedComponentsAlgo - Interface in com.jgalgo
-
Connectivity components algorithm.
- ConnectedComponentsAlgo.Builder - Interface in com.jgalgo
-
A builder for
ConnectedComponentsAlgo
objects. - ConnectedComponentsAlgo.Result - Interface in com.jgalgo
-
Result object for connectivity components calculation.
- containsEdge(int) - Method in interface com.jgalgo.Matching
-
Check whether an edge is part of the matching.
- containsParallelEdges(Graph) - Static method in class com.jgalgo.GraphsUtils
-
Check whether a graph contain parallel edges.
- containsSelfEdges(Graph) - Static method in class com.jgalgo.GraphsUtils
-
Check whether a graph contain self edges.
- containsVertex(int) - Method in interface com.jgalgo.Cut
-
Check whether a vertex is in the cut.
- copy() - Method in interface com.jgalgo.graph.Graph
-
Create a copy of this graph, with the same vertices and edges, without copying weights.
- copy() - Method in interface com.jgalgo.graph.IndexGraph
- copy(boolean) - Method in interface com.jgalgo.graph.Graph
-
Create a copy of this graph, with the same vertices and edges, with/without copying weights.
- copy(boolean) - Method in interface com.jgalgo.graph.IndexGraph
- CoreAlgo - Interface in com.jgalgo
-
Cores computing algorithm.
- CoreAlgo.Builder - Interface in com.jgalgo
-
A builder for
CoreAlgo
objects. - CoreAlgo.DegreeType - Enum in com.jgalgo
-
The degree type the cores are defined with respect to.
- CoreAlgo.Result - Interface in com.jgalgo
-
The result of the cores computation.
- coreVertices(int) - Method in interface com.jgalgo.CoreAlgo.Result
-
The vertices of the given core.
- CostScaling(Blackhole) - Method in class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow.BarabasiAlbert
- CostScaling(Blackhole) - Method in class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow.Gnp
- CostScaling(Blackhole) - Method in class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow.RecursiveMatrix
- CostScaling(Blackhole) - Method in class com.jgalgo.bench.impls.MinCostFlowBench.Supply.BarabasiAlbert
- CostScaling(Blackhole) - Method in class com.jgalgo.bench.impls.MinCostFlowBench.Supply.Gnp
- CostScaling(Blackhole) - Method in class com.jgalgo.bench.impls.MinCostFlowBench.Supply.RecursiveMatrix
- createExternalEdgesWeights(Graph, Class<? super E>) - Static method in interface com.jgalgo.graph.Weights
-
Create an external edge weights container.
- createExternalEdgesWeights(Graph, Class<? super E>, E) - Static method in interface com.jgalgo.graph.Weights
-
Create an external edge weights container with default values.
- createExternalVerticesWeights(Graph, Class<? super E>) - Static method in interface com.jgalgo.graph.Weights
-
Create an external vertex weights container.
- createExternalVerticesWeights(Graph, Class<? super E>, E) - Static method in interface com.jgalgo.graph.Weights
-
Create an external vertex weights container with default values.
- createFromEdgeWeights(Graph) - Static method in interface com.jgalgo.FlowNetwork
-
Create a flow network by adding edge weights using
Graph.addEdgesWeights(java.lang.Object, java.lang.Class<? super E>)
. - createFromEdgeWeights(Graph) - Static method in interface com.jgalgo.FlowNetwork.Int
-
Create an integer flow network by adding edge weights using
Graph.addEdgesWeights(java.lang.Object, java.lang.Class<? super E>)
. - createFromEdgeWeights(Weights.Double, Weights.Double) - Static method in interface com.jgalgo.FlowNetwork
-
Create a flow network by using existing edge weights.
- createFromEdgeWeights(Weights.Int, Weights.Int) - Static method in interface com.jgalgo.FlowNetwork.Int
-
Create a flow network by using existing edge weights.
- createGraph() - Static method in class com.jgalgo.example.BfsDfsExample
- createGraph() - Static method in class com.jgalgo.example.ColoringExample
- createGraph() - Static method in class com.jgalgo.example.MaximumMatchingExample
- Cut - Interface in com.jgalgo
-
A cut that partition the vertices of a graph into two sets.
- CycleCanceling(Blackhole) - Method in class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow.BarabasiAlbert
- CycleCanceling(Blackhole) - Method in class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow.Gnp
- CycleCanceling(Blackhole) - Method in class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow.RecursiveMatrix
- CycleCanceling(Blackhole) - Method in class com.jgalgo.bench.impls.MinCostFlowBench.Supply.BarabasiAlbert
- CycleCanceling(Blackhole) - Method in class com.jgalgo.bench.impls.MinCostFlowBench.Supply.Gnp
- CycleCanceling(Blackhole) - Method in class com.jgalgo.bench.impls.MinCostFlowBench.Supply.RecursiveMatrix
- CyclesFinder - Interface in com.jgalgo
-
An algorithm that finds all cycles in a graph.
- CyclesFinder.Builder - Interface in com.jgalgo
-
A builder for
CyclesFinder
objects. - CyclesFinderBench - Class in com.jgalgo.bench.impls
- CyclesFinderBench() - Constructor for class com.jgalgo.bench.impls.CyclesFinderBench
D
- DasdanGupta(Blackhole) - Method in class com.jgalgo.bench.impls.MinimumMeanCycleBench
- DefaultBipartiteWeightKey - Static variable in interface com.jgalgo.graph.Weights
-
The default vertices weight key of the bipartite property.
- defaultWeight() - Method in interface com.jgalgo.graph.Weights.Bool
-
Deprecated.
- defaultWeight() - Method in interface com.jgalgo.graph.Weights.Byte
-
Deprecated.
- defaultWeight() - Method in interface com.jgalgo.graph.Weights.Char
-
Deprecated.
- defaultWeight() - Method in interface com.jgalgo.graph.Weights
-
Get the default weight of this weights container.
- defaultWeight() - Method in interface com.jgalgo.graph.Weights.Double
-
Deprecated.
- defaultWeight() - Method in interface com.jgalgo.graph.Weights.Float
-
Deprecated.
- defaultWeight() - Method in interface com.jgalgo.graph.Weights.Int
-
Deprecated.
- defaultWeight() - Method in interface com.jgalgo.graph.Weights.Long
-
Deprecated.
- defaultWeight() - Method in interface com.jgalgo.graph.Weights.Short
-
Deprecated.
- defaultWeightBool() - Method in interface com.jgalgo.graph.Weights.Bool
-
Get the default weight of this weights container.
- defaultWeightByte() - Method in interface com.jgalgo.graph.Weights.Byte
-
Get the default weight of this weights container.
- defaultWeightChar() - Method in interface com.jgalgo.graph.Weights.Char
-
Get the default weight of this weights container.
- defaultWeightDouble() - Method in interface com.jgalgo.graph.Weights.Double
-
Get the default weight of this weights container.
- defaultWeightFloat() - Method in interface com.jgalgo.graph.Weights.Float
-
Get the default weight of this weights container.
- defaultWeightInt() - Method in interface com.jgalgo.graph.Weights.Int
-
Get the default weight of this weights container.
- defaultWeightLong() - Method in interface com.jgalgo.graph.Weights.Long
-
Get the default weight of this weights container.
- defaultWeightShort() - Method in interface com.jgalgo.graph.Weights.Short
-
Get the default weight of this weights container.
- DenseGraph - com.jgalgo.graph.GraphFactory.Hint
-
The graph density (# of edges) will be high, a constant fraction of \(O(n^2)\)
- DFSExample() - Static method in class com.jgalgo.example.BfsDfsExample
- DFSIter - Interface in com.jgalgo
-
Depth first search (DFS) iterator.
- Dial(Blackhole) - Method in class com.jgalgo.bench.impls.SSSPPositiveWeightsBench.BarabasiAlbert
- Dial(Blackhole) - Method in class com.jgalgo.bench.impls.SSSPPositiveWeightsBench.Gnp
- Dial(Blackhole) - Method in class com.jgalgo.bench.impls.SSSPPositiveWeightsBench.RecursiveMatrix
- Dijkstra(Blackhole) - Method in class com.jgalgo.bench.impls.SSSPPositiveWeightsBench.BarabasiAlbert
- Dijkstra(Blackhole) - Method in class com.jgalgo.bench.impls.SSSPPositiveWeightsBench.Gnp
- Dijkstra(Blackhole) - Method in class com.jgalgo.bench.impls.SSSPPositiveWeightsBench.RecursiveMatrix
- Dinic(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.BarabasiAlbert
- Dinic(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.Gnp
- Dinic(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.RecursiveMatrix
- DinicDynamicTrees(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.BarabasiAlbert
- DinicDynamicTrees(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.RecursiveMatrix
- directed - Variable in class com.jgalgo.bench.impls.MaximumFlowBench.BarabasiAlbert
- directed - Variable in class com.jgalgo.bench.impls.MaximumFlowBench.Gnp
- directed - Variable in class com.jgalgo.bench.impls.MaximumFlowBench.RecursiveMatrix
- directed - Variable in class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow.BarabasiAlbert
- directed - Variable in class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow.Gnp
- directed - Variable in class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow.RecursiveMatrix
- directed - Variable in class com.jgalgo.bench.impls.MinCostFlowBench.Supply.BarabasiAlbert
- directed - Variable in class com.jgalgo.bench.impls.MinCostFlowBench.Supply.Gnp
- directed - Variable in class com.jgalgo.bench.impls.MinCostFlowBench.Supply.RecursiveMatrix
- directed() - Method in interface com.jgalgo.graph.GraphCapabilities
-
Checks whether the graph is directed.
- distance(int) - Method in interface com.jgalgo.ShortestPathSingleSource.Result
-
Get the distance to a target vertex.
- distance(int, int) - Method in interface com.jgalgo.ShortestPathAllPairs.Result
-
Get the distance of the shortest path between two vertices.
- DSatur(Blackhole) - Method in class com.jgalgo.bench.impls.ColoringBench
- dynamicLCAExample() - Static method in class com.jgalgo.example.LowestCommonAncestorExample
E
- edgeEndpoint(int, int) - Method in interface com.jgalgo.graph.Graph
-
Get the other end-point of an edge.
- edgeIter() - Method in interface com.jgalgo.Path
-
Get an
EdgeIter
that iterate over the edges of the path. - EdgeIter - Interface in com.jgalgo.graph
-
Iterator used to iterate over edges of a vertex.
- edgeIterationExample() - Static method in class com.jgalgo.example.EdgeIterationExample
- EdgeIterationExample - Class in com.jgalgo.example
- EdgeIterationExample() - Constructor for class com.jgalgo.example.EdgeIterationExample
- edgePath() - Method in interface com.jgalgo.DFSIter
-
Get the path from the source to the last vertex returned by
DFSIter.nextInt()
. - edges() - Method in interface com.jgalgo.Cut
-
Get the collection of all the edges that cross the cut.
- edges() - Method in interface com.jgalgo.graph.Graph
-
Get the set of all edges of the graph.
- edges() - Method in interface com.jgalgo.graph.GraphBuilder
-
Get the set of edges that were added to the graph.
- edges() - Method in interface com.jgalgo.graph.IndexGraph
-
Get the set of all edges of the graph.
- edges() - Method in interface com.jgalgo.graph.IndexGraphBuilder
-
Get the set of edges that were added to the graph.
- edges() - Method in interface com.jgalgo.Matching
-
The collection of edges forming this matching.
- edges() - Method in interface com.jgalgo.MinimumSpanningTree.Result
-
Get all the edges that form the spanning tree.
- EdgeSet - Interface in com.jgalgo.graph
-
Set of graph edges.
- edgeSource(int) - Method in interface com.jgalgo.graph.Graph
-
Get the source vertex of an edge.
- edgesReIndexing() - Method in interface com.jgalgo.graph.IndexGraphBuilder.ReIndexedGraph
-
Get the re-indexing map of the edges.
- edgeTarget(int) - Method in interface com.jgalgo.graph.Graph
-
Get the target vertex of an edge.
- EdmondsKarp(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.BarabasiAlbert
- EdmondsKarp(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.Gnp
- EdmondsKarp(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.RecursiveMatrix
- EmptyGraphDirected - Static variable in class com.jgalgo.graph.Graphs
-
A directed graphs with no vertices and no edges
- EmptyGraphUndirected - Static variable in class com.jgalgo.graph.Graphs
-
An undirected graphs with no vertices and no edges
- emptyIterator() - Static method in interface com.jgalgo.graph.EdgeIter
-
Get an empty edge iterator.
- EulerianTourAlgo - Interface in com.jgalgo
-
Eulerian tour calculation algorithm.
- EulerianTourAlgo.Builder - Interface in com.jgalgo
-
A builder for
EulerianTourAlgo
objects. - expectedEdgesNum(int) - Method in interface com.jgalgo.graph.GraphBuilder
-
Hint about the number of edges expected to be added to the builder.
- expectedEdgesNum(int) - Method in interface com.jgalgo.graph.GraphFactory
-
Set the expected number of edges that will exist in the graph.
- expectedEdgesNum(int) - Method in interface com.jgalgo.graph.IndexGraphBuilder
-
Hint about the number of edges expected to be added to the builder.
- expectedEdgesNum(int) - Method in interface com.jgalgo.graph.IndexGraphFactory
-
Set the expected number of edges that will exist in the graph.
- expectedVerticesNum(int) - Method in interface com.jgalgo.graph.GraphBuilder
-
Hint about the number of vertices expected to be added to the builder.
- expectedVerticesNum(int) - Method in interface com.jgalgo.graph.GraphFactory
-
Set the expected number of vertices that will exist in the graph.
- expectedVerticesNum(int) - Method in interface com.jgalgo.graph.IndexGraphBuilder
-
Hint about the number of vertices expected to be added to the builder.
- expectedVerticesNum(int) - Method in interface com.jgalgo.graph.IndexGraphFactory
-
Set the expected number of vertices that will exist in the graph.
F
- FastEdgeLookup - com.jgalgo.graph.GraphFactory.Hint
-
The graph should support fast edge lookup via
Graph.getEdge(int, int)
- FastEdgeRemoval - com.jgalgo.graph.GraphFactory.Hint
-
The graph should support fast edge removal via
Graph.removeEdge(int)
- Fibonacci(Blackhole) - Method in class com.jgalgo.bench.impls.HeapBench
- Fibonacci(Blackhole) - Method in class com.jgalgo.bench.impls.HeapReferenceableBench
- findAllCycles(Graph) - Method in interface com.jgalgo.CyclesFinder
-
Find all cycles in the given graph.
- findAllMaximalCliques(Graph) - Method in interface com.jgalgo.MaximalCliques
-
Finds all the maximal cliques in a graph.
- findLowestCommonAncestor(int, int) - Method in interface com.jgalgo.LowestCommonAncestorStatic.DataStructure
-
Find the lowest common ancestor of two vertices in the tree.
- findLowestCommonAncestor(LowestCommonAncestorDynamic.Node, LowestCommonAncestorDynamic.Node) - Method in interface com.jgalgo.LowestCommonAncestorDynamic
-
Find the lowest common ancestor of two nodes in the tree.
- findPath(Graph, int, int) - Static method in interface com.jgalgo.Path
-
Find a valid path from \(u\) to \(v\).
- FlowNetwork - Interface in com.jgalgo
-
Flow on graph edges, with capacities and flows values.
- FlowNetwork.Int - Interface in com.jgalgo
-
Flow on graph edges, with integer capacities and flows values.
- FloydWarshall(Blackhole) - Method in class com.jgalgo.bench.impls.APSPBench
- foundNegativeCycle() - Method in interface com.jgalgo.ShortestPathAllPairs.Result
-
Check whether a negative cycle was found.
- foundNegativeCycle() - Method in interface com.jgalgo.ShortestPathSingleSource.Result
-
Check whether a negative cycle was found.
- FredmanTarjan(Blackhole) - Method in class com.jgalgo.bench.impls.MSTBench
G
- Gabow1990(Blackhole) - Method in class com.jgalgo.bench.impls.MatchingBench.MaximumWeighted
- Gabow1990(Blackhole) - Method in class com.jgalgo.bench.impls.MatchingBench.MinimumPerfect
- Gabow1990Simpler(Blackhole) - Method in class com.jgalgo.bench.impls.MatchingBench.MaximumWeighted
- Gabow1990Simpler(Blackhole) - Method in class com.jgalgo.bench.impls.MatchingBench.MinimumPerfect
- Gabow1990Simpler(Blackhole) - Method in class com.jgalgo.bench.impls.MatchingBench.MinimumPerfectBipartite
- GabowLinear(Blackhole) - Method in class com.jgalgo.bench.impls.LCADynamicBench
- GabowSimple(Blackhole) - Method in class com.jgalgo.bench.impls.LCADynamicBench
- get(int) - Method in interface com.jgalgo.graph.Weights.Bool
-
Deprecated.
- get(int) - Method in interface com.jgalgo.graph.Weights.Byte
-
Deprecated.
- get(int) - Method in interface com.jgalgo.graph.Weights.Char
-
Deprecated.
- get(int) - Method in interface com.jgalgo.graph.Weights.Double
-
Deprecated.
- get(int) - Method in interface com.jgalgo.graph.Weights.Float
-
Deprecated.
- get(int) - Method in interface com.jgalgo.graph.Weights
-
Get the weight associated with the given id.
- get(int) - Method in interface com.jgalgo.graph.Weights.Int
-
Deprecated.
- get(int) - Method in interface com.jgalgo.graph.Weights.Long
-
Deprecated.
- get(int) - Method in interface com.jgalgo.graph.Weights.Short
-
Deprecated.
- getBiCcEdges(int) - Method in interface com.jgalgo.BiConnectedComponentsAlgo.Result
-
Get the edges contained in a single bi-connected component.
- getBiCcVertices(int) - Method in interface com.jgalgo.BiConnectedComponentsAlgo.Result
-
Get the vertices contained in a single bi-connected component.
- getBool(int) - Method in interface com.jgalgo.graph.Weights.Bool
-
Get the weight associated with the given id.
- getByte(int) - Method in interface com.jgalgo.graph.Weights.Byte
-
Get the weight associated with the given id.
- getCapabilities() - Method in interface com.jgalgo.graph.Graph
-
Get the capabilities of this graph.
- getCapacity(int) - Method in interface com.jgalgo.FlowNetwork
-
Get the capacity of an edge.
- getCapacity(int) - Method in interface com.jgalgo.FlowNetwork.Int
-
Deprecated.
- getCapacityInt(int) - Method in interface com.jgalgo.FlowNetwork.Int
-
Get the integer capacity of an edge.
- getCcEdges(int) - Method in interface com.jgalgo.ConnectedComponentsAlgo.Result
-
Get all the edges that are part of a connectivity component.
- getCcVertices(int) - Method in interface com.jgalgo.ConnectedComponentsAlgo.Result
-
Get all the vertices that are part of a connectivity component.
- getChar(int) - Method in interface com.jgalgo.graph.Weights.Char
-
Get the weight associated with the given id.
- getCostSum(IntCollection, WeightFunction) - Method in interface com.jgalgo.FlowNetwork
-
Get the cost of the flow along a set of edges.
- getCostSum(IntCollection, WeightFunction) - Method in interface com.jgalgo.FlowNetwork.Int
- getDouble(int) - Method in interface com.jgalgo.graph.Weights.Double
-
Get the weight associated with the given id.
- getEdge(int, int) - Method in interface com.jgalgo.graph.Graph
-
Get the edge whose source is
source
and target istarget
. - getEdges(int, int) - Method in interface com.jgalgo.graph.Graph
-
Get the edges whose source is
source
and target istarget
. - getEdgesWeights(Object) - Method in interface com.jgalgo.graph.Graph
-
Get the edges weights of some key.
- getEdgesWeights(Object) - Method in interface com.jgalgo.graph.GraphBuilder
-
Get the edges weights of some key.
- getEdgesWeights(Object) - Method in interface com.jgalgo.graph.IndexGraphBuilder
-
Get the edges weights of some key.
- getEdgesWeightsKeys() - Method in interface com.jgalgo.graph.Graph
-
Get the keys of all the associated edges weights.
- getEdgesWeightsKeys() - Method in interface com.jgalgo.graph.GraphBuilder
-
Get the keys of all the associated edges weights.
- getEdgesWeightsKeys() - Method in interface com.jgalgo.graph.IndexGraphBuilder
-
Get the keys of all the associated edges weights.
- getFloat(int) - Method in interface com.jgalgo.graph.Weights.Float
-
Get the weight associated with the given id.
- getFlow(int) - Method in interface com.jgalgo.FlowNetwork
-
Get the amount of flow units going along an edge.
- getFlow(int) - Method in interface com.jgalgo.FlowNetwork.Int
-
Deprecated.
- getFlowInt(int) - Method in interface com.jgalgo.FlowNetwork.Int
-
Get the integer amount of flow units going along an edge.
- getFlowSum(Graph, int) - Method in interface com.jgalgo.FlowNetwork
-
Get the sum of flow units going out of a source vertex.
- getFlowSum(Graph, IntCollection) - Method in interface com.jgalgo.FlowNetwork
-
Get the sum of flow units going out of a set of source vertices.
- getHeaviestEdge(int) - Method in interface com.jgalgo.TreePathMaxima.Result
-
Get the heaviest edge found for a single query.
- getInt(int) - Method in interface com.jgalgo.graph.Weights.Int
-
Get the weight associated with the given id.
- getLong(int) - Method in interface com.jgalgo.graph.Weights.Long
-
Get the weight associated with the given id.
- getMatchedEdge(int) - Method in interface com.jgalgo.Matching
-
Get the only matched edge adjacent to a given vertex.
- getNegativeCycle() - Method in interface com.jgalgo.ShortestPathAllPairs.Result
-
Get the negative cycle that was found.
- getNegativeCycle() - Method in interface com.jgalgo.ShortestPathSingleSource.Result
-
Get the negative cycle that was found.
- getNodeData() - Method in interface com.jgalgo.LowestCommonAncestorDynamic.Node
-
Get the user data of this node.
- getNumberOfBiCcs() - Method in interface com.jgalgo.BiConnectedComponentsAlgo.Result
-
Get the number of bi-connected components computed in the graph.
- getNumberOfCcs() - Method in interface com.jgalgo.ConnectedComponentsAlgo.Result
-
Get the number of connectivity components in the graph.
- getOption(String) - Static method in class com.jgalgo.JGAlgoConfig
-
Get a supplier of an option value.
- getParent() - Method in interface com.jgalgo.LowestCommonAncestorDynamic.Node
-
Get the parent node of this node.
- getPath(int) - Method in interface com.jgalgo.ShortestPathSingleSource.Result
-
Get shortest path to a target vertex.
- getPath(int, int) - Method in interface com.jgalgo.ShortestPathAllPairs.Result
-
Get the shortest path between vertices.
- getQuery(int) - Method in interface com.jgalgo.TreePathMaxima.Queries
-
Get a query by index.
- getShort(int) - Method in interface com.jgalgo.graph.Weights.Short
-
Get the weight associated with the given id.
- getVertexBiCcs(int) - Method in interface com.jgalgo.BiConnectedComponentsAlgo.Result
-
Get the bi-connected components a vertex is contained in.
- getVertexCc(int) - Method in interface com.jgalgo.ConnectedComponentsAlgo.Result
-
Get the connectivity component containing a vertex.
- getVerticesWeights(Object) - Method in interface com.jgalgo.graph.Graph
-
Get the vertices weights of some key.
- getVerticesWeights(Object) - Method in interface com.jgalgo.graph.GraphBuilder
-
Get the vertices weights of some key.
- getVerticesWeights(Object) - Method in interface com.jgalgo.graph.IndexGraphBuilder
-
Get the vertices weights of some key.
- getVerticesWeightsKeys() - Method in interface com.jgalgo.graph.Graph
-
Get the keys of all the associated vertices weights.
- getVerticesWeightsKeys() - Method in interface com.jgalgo.graph.GraphBuilder
-
Get the keys of all the associated vertices weights.
- getVerticesWeightsKeys() - Method in interface com.jgalgo.graph.IndexGraphBuilder
-
Get the keys of all the associated vertices weights.
- Gnp() - Constructor for class com.jgalgo.bench.impls.MaximalCliquesBench.Gnp
- Gnp() - Constructor for class com.jgalgo.bench.impls.MaximumFlowBench.Gnp
- Gnp() - Constructor for class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow.Gnp
- Gnp() - Constructor for class com.jgalgo.bench.impls.MinCostFlowBench.Supply.Gnp
- Gnp() - Constructor for class com.jgalgo.bench.impls.SSSPNegativeWeightsBench.Gnp
- Gnp() - Constructor for class com.jgalgo.bench.impls.SSSPPositiveWeightsBench.Gnp
- Goldberg(Blackhole) - Method in class com.jgalgo.bench.impls.SSSPNegativeWeightsBench.BarabasiAlbert
- Goldberg(Blackhole) - Method in class com.jgalgo.bench.impls.SSSPNegativeWeightsBench.Gnp
- Goldberg(Blackhole) - Method in class com.jgalgo.bench.impls.SSSPNegativeWeightsBench.RecursiveMatrix
- graph() - Method in interface com.jgalgo.graph.IndexGraphBuilder.ReIndexedGraph
-
Get the newly created re-indexed graph
- Graph - Interface in com.jgalgo.graph
-
A discrete graph with vertices and edges.
- GraphBuilder - Interface in com.jgalgo.graph
-
A builder for graphs.
- GraphCapabilities - Interface in com.jgalgo.graph
-
Object specifying the capabilities of a graph implementation.
- GraphFactory - Interface in com.jgalgo.graph
-
A factory for
Graph
objects. - GraphFactory.Hint - Enum in com.jgalgo.graph
-
Hints for a graph factory.
- Graphs - Class in com.jgalgo.graph
-
Static methods class for graphs.
- GraphsUtils - Class in com.jgalgo
-
Static methods class for graphs.
- Greedy(Blackhole) - Method in class com.jgalgo.bench.impls.ColoringBench
H
- hasNext() - Method in interface com.jgalgo.BFSIter
-
Check whether there is more vertices to iterate over.
- hasNext() - Method in interface com.jgalgo.DFSIter
-
Check whether there is more vertices to iterate over.
- HeapBench - Class in com.jgalgo.bench.impls
- HeapBench() - Constructor for class com.jgalgo.bench.impls.HeapBench
- HeapReferenceableBench - Class in com.jgalgo.bench.impls
- HeapReferenceableBench() - Constructor for class com.jgalgo.bench.impls.HeapReferenceableBench
- Howard(Blackhole) - Method in class com.jgalgo.bench.impls.MinimumMeanCycleBench
I
- idToIndex(int) - Method in interface com.jgalgo.graph.IndexIdMap
-
Get the index of an element by its ID.
- idToIndexCollection(IntCollection, IndexIdMap) - Static method in class com.jgalgo.graph.IndexIdMaps
-
Create an indices collection from a collection of IDs.
- idToIndexIterator(IntIterator, IndexIdMap) - Static method in class com.jgalgo.graph.IndexIdMaps
-
Create an indices iterator from an iterator of IDs.
- idToIndexWeightFunc(WeightFunction.Int, IndexIdMap) - Static method in class com.jgalgo.graph.IndexIdMaps
-
Create a weight function that accept elements indices, given a weight function that accept elements IDs.
- idToIndexWeightFunc(WeightFunction, IndexIdMap) - Static method in class com.jgalgo.graph.IndexIdMaps
-
Create a weight function that accept elements indices, given a weight function that accept elements IDs.
- idToIndexWeights(Weights.Byte, IndexIdMap) - Static method in class com.jgalgo.graph.IndexIdMaps
-
Create a weights view that is accessed by the elements indices, given a weights container that is accessed by the element IDs.
- idToIndexWeights(Weights.Char, IndexIdMap) - Static method in class com.jgalgo.graph.IndexIdMaps
-
Create a weights view that is accessed by the elements indices, given a weights container that is accessed by the elements IDs.
- idToIndexWeights(Weights.Double, IndexIdMap) - Static method in class com.jgalgo.graph.IndexIdMaps
-
Create a weights view that is accessed by the elements indices, given a weights container that is accessed by the element IDs.
- idToIndexWeights(Weights.Float, IndexIdMap) - Static method in class com.jgalgo.graph.IndexIdMaps
-
Create a weights view that is accessed by the elements indices, given a weights container that is accessed by the element IDs.
- idToIndexWeights(Weights.Int, IndexIdMap) - Static method in class com.jgalgo.graph.IndexIdMaps
-
Create a weights view that is accessed by the elements indices, given a weights container that is accessed by the element IDs.
- idToIndexWeights(Weights.Long, IndexIdMap) - Static method in class com.jgalgo.graph.IndexIdMaps
-
Create a weights view that is accessed by the elements indices, given a weights container that is accessed by the element IDs.
- idToIndexWeights(Weights.Short, IndexIdMap) - Static method in class com.jgalgo.graph.IndexIdMaps
-
Create a weights view that is accessed by the elements indices, given a weights container that is accessed by the element IDs.
- idToIndexWeights(Weights<W>, IndexIdMap) - Static method in class com.jgalgo.graph.IndexIdMaps
-
Create a weights view that is accessed by the elements indices, given a weights container that is accessed by the element IDs.
- immutableCopy() - Method in interface com.jgalgo.graph.Graph
-
Create an immutable copy of this graph, with the same vertices and edges, without copying weights.
- immutableCopy() - Method in interface com.jgalgo.graph.IndexGraph
- immutableCopy(boolean) - Method in interface com.jgalgo.graph.Graph
-
Create an immutable copy of this graph, with the same vertices and edges, with/without copying weights.
- immutableCopy(boolean) - Method in interface com.jgalgo.graph.IndexGraph
- immutableView() - Method in interface com.jgalgo.graph.Graph
-
Get an immutable view of this graph.
- immutableView() - Method in interface com.jgalgo.graph.IndexGraph
- InDegree - com.jgalgo.CoreAlgo.DegreeType
-
Cores will be computed with respect to the in-degree of the vertices, namely the number of incoming edges.
- indexGraph() - Method in interface com.jgalgo.graph.Graph
-
Get an Index graph view of this graph.
- indexGraph() - Method in interface com.jgalgo.graph.IndexGraph
-
Deprecated.this function will always return the same graph, no reason to call it
- IndexGraph - Interface in com.jgalgo.graph
-
A graph whose vertices and edges identifiers are indices.
- IndexGraphBuilder - Interface in com.jgalgo.graph
-
A builder for Index graphs.
- IndexGraphBuilder.ReIndexedGraph - Interface in com.jgalgo.graph
-
A result object of re-indexing and building a graph operation.
- IndexGraphBuilder.ReIndexingMap - Interface in com.jgalgo.graph
-
A map of indices, mapping an original index to a re-indexed index.
- indexGraphEdgesMap() - Method in interface com.jgalgo.graph.Graph
-
Get the index-id edges mapping of this graph.
- indexGraphEdgesMap() - Method in interface com.jgalgo.graph.IndexGraph
-
Deprecated.this function will always return the identity mapping, no reason to call it
- IndexGraphFactory - Interface in com.jgalgo.graph
-
A factory for Index graphs.
- indexGraphVerticesMap() - Method in interface com.jgalgo.graph.Graph
-
Get the index-id vertices mapping of this graph.
- indexGraphVerticesMap() - Method in interface com.jgalgo.graph.IndexGraph
-
Deprecated.this function will always return the identity mapping, no reason to call it
- IndexIdMap - Interface in com.jgalgo.graph
-
A mapping between
Graph
IDs toIndexGraph
indices. - IndexIdMaps - Class in com.jgalgo.graph
-
Static methods class for index-id maps.
- IndexSwapListener - Interface in com.jgalgo.graph
-
A listener that will be notified when a
IndexGraph
chooses to swap two IDs (vertices/edges). - indexToId(int) - Method in interface com.jgalgo.graph.IndexIdMap
-
Get the ID of an element by its index.
- indexToIdCollection(IntCollection, IndexIdMap) - Static method in class com.jgalgo.graph.IndexIdMaps
-
Create an IDs collection from a collection of indices.
- indexToIdEdgeIter(EdgeIter, IndexIdMap, IndexIdMap) - Static method in class com.jgalgo.graph.IndexIdMaps
- indexToIdIterator(IntIterator, IndexIdMap) - Static method in class com.jgalgo.graph.IndexIdMaps
-
Create an IDs iterator from an iterator of indices.
- indexToIdList(IntList, IndexIdMap) - Static method in class com.jgalgo.graph.IndexIdMaps
-
Create an IDs list from a list of indices.
- indexWeightsFromWeights(Weights.Bool, IndexIdMap) - Static method in class com.jgalgo.graph.IndexIdMaps
-
Create a weights view that is accessed by the elements indices, given a weights container that is accessed by the element IDs.
- inEdges(int) - Method in interface com.jgalgo.graph.Graph
-
Get the edges whose target is
target
. - initTree() - Method in interface com.jgalgo.LowestCommonAncestorDynamic
-
Initialize the tree the LCA will operate on and create a root node.
- integerCosts(boolean) - Method in interface com.jgalgo.MinimumCostFlow.Builder
-
Enable/disable integer costs.
- integerNetwork(boolean) - Method in interface com.jgalgo.MinimumCostFlow.Builder
-
Enable/disable integer network (capacities, flows, vertices supplies and edges flow lower bound).
- intIterator() - Method in interface com.jgalgo.graph.EdgeSet
-
Return an edge iterator that iterate over the edges in this set
- isCycle() - Method in interface com.jgalgo.Path
-
Check whether this path form a cycle.
- isForest(Graph) - Static method in class com.jgalgo.Trees
-
Check if a graph is a forest.
- isInCover(int) - Method in interface com.jgalgo.VertexCover.Result
-
Check whether a vertex is included in the cover.
- isPerfect() - Method in interface com.jgalgo.Matching
-
Check whether this matching is perfect.
- isTree(Graph) - Static method in class com.jgalgo.Trees
-
Check if an undirected graph is a tree.
- isTree(Graph, int) - Static method in class com.jgalgo.Trees
-
Check if a graph is a tree rooted as some vertex.
- isVertexMatched(int) - Method in interface com.jgalgo.Matching
-
Check whether a vertex is matched by the matching.
- iterateMaximalCliques(Graph) - Method in interface com.jgalgo.MaximalCliques
-
Iterate over all maximal cliques in a graph.
- iterator() - Method in interface com.jgalgo.graph.EdgeSet
-
Return an edge iterator that iterate over the edges in this set
- iterator() - Method in interface com.jgalgo.Path
-
Get an iterator that iterate over the edges of the path.
J
- JGAlgoConfig - Class in com.jgalgo
-
A global configuration class.
- Johnson(Blackhole) - Method in class com.jgalgo.bench.impls.APSPBench
- Johnson(Blackhole) - Method in class com.jgalgo.bench.impls.CyclesFinderBench
K
- KargerKleinTarjan(Blackhole) - Method in class com.jgalgo.bench.impls.MSTBench
- Kruskal(Blackhole) - Method in class com.jgalgo.bench.impls.MSTBench
L
- lastEdge() - Method in interface com.jgalgo.BFSIter
-
Get the edge that led to the last vertex returned by
BFSIter.nextInt()
. - layer() - Method in interface com.jgalgo.BFSIter
-
Get the layer of the last vertex returned by
BFSIter.nextInt()
. - LCADynamicBench - Class in com.jgalgo.bench.impls
- LCADynamicBench() - Constructor for class com.jgalgo.bench.impls.LCADynamicBench
- localEdgeWeightFunction(IndexGraph, WeightFunction) - Static method in class com.jgalgo.graph.WeightFunctions
-
Get a 'local' version of a given weight function.
- localEdgeWeightFunction(IndexGraph, WeightFunction.Int) - Static method in class com.jgalgo.graph.WeightFunctions
-
Get a 'local' version of a given weight function.
- LookupTable() - Constructor for class com.jgalgo.bench.impls.RMQStaticBench.Query.LookupTable
- LookupTable(Blackhole) - Method in class com.jgalgo.bench.impls.RMQStaticBench.PreProcess
- LowestCommonAncestorDynamic - Interface in com.jgalgo
-
Dynamic algorithm for Lowest Common Ancestor (LCA) queries.
- LowestCommonAncestorDynamic.Builder - Interface in com.jgalgo
-
A builder for
LowestCommonAncestorDynamic
objects. - LowestCommonAncestorDynamic.Node - Interface in com.jgalgo
-
A tree node in an
LowestCommonAncestorDynamic
data structure. - LowestCommonAncestorExample - Class in com.jgalgo.example
- LowestCommonAncestorExample() - Constructor for class com.jgalgo.example.LowestCommonAncestorExample
- LowestCommonAncestorStatic - Interface in com.jgalgo
-
Static Lowest Common Ancestor (LCA) algorithm.
- LowestCommonAncestorStatic.Builder - Interface in com.jgalgo
-
A builder for
LowestCommonAncestorStatic
objects. - LowestCommonAncestorStatic.DataStructure - Interface in com.jgalgo
-
Data structure result created from a static LCA pre-processing.
M
- m - Variable in class com.jgalgo.bench.impls.TreePathMaximaBench
- main(String[]) - Static method in class com.jgalgo.example.BfsDfsExample
- main(String[]) - Static method in class com.jgalgo.example.ColoringExample
- main(String[]) - Static method in class com.jgalgo.example.EdgeIterationExample
- main(String[]) - Static method in class com.jgalgo.example.LowestCommonAncestorExample
- main(String[]) - Static method in class com.jgalgo.example.MaximumMatchingExample
- main(String[]) - Static method in class com.jgalgo.example.MinimumSpanningTreeExample
- main(String[]) - Static method in class com.jgalgo.example.ShortestPathExample
- matchedVertices() - Method in interface com.jgalgo.Matching
-
Get all the vertices matched by the matching.
- Matching - Interface in com.jgalgo
-
A matching in a graph.
- MatchingAlgorithm - Interface in com.jgalgo
-
Maximum/minimum matching algorithm.
- MatchingAlgorithm.Builder - Interface in com.jgalgo
-
A builder for
MatchingAlgorithm
objects. - MatchingBench - Class in com.jgalgo.bench.impls
- MatchingBench() - Constructor for class com.jgalgo.bench.impls.MatchingBench
- MatchingBench.MaximumCardinality - Class in com.jgalgo.bench.impls
- MatchingBench.MaximumCardinalityBipartite - Class in com.jgalgo.bench.impls
- MatchingBench.MaximumWeighted - Class in com.jgalgo.bench.impls
- MatchingBench.MaximumWeightedBipartite - Class in com.jgalgo.bench.impls
- MatchingBench.MinimumPerfect - Class in com.jgalgo.bench.impls
- MatchingBench.MinimumPerfectBipartite - Class in com.jgalgo.bench.impls
- maxCore() - Method in interface com.jgalgo.CoreAlgo.Result
-
The maximum core number of the graph.
- MaxFlow() - Constructor for class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow
- MaximalCliques - Interface in com.jgalgo
-
Finds all maximal cliques in a graph.
- MaximalCliques.Builder - Interface in com.jgalgo
-
A builder for
MaximalCliques
objects. - MaximalCliquesBench - Class in com.jgalgo.bench.impls
- MaximalCliquesBench() - Constructor for class com.jgalgo.bench.impls.MaximalCliquesBench
- MaximalCliquesBench.BarabasiAlbert - Class in com.jgalgo.bench.impls
- MaximalCliquesBench.Gnp - Class in com.jgalgo.bench.impls
- MaximalCliquesBench.RecursiveMatrix - Class in com.jgalgo.bench.impls
- MaximumCardinality() - Constructor for class com.jgalgo.bench.impls.MatchingBench.MaximumCardinality
- MaximumCardinalityBipartite() - Constructor for class com.jgalgo.bench.impls.MatchingBench.MaximumCardinalityBipartite
- MaximumFlow - Interface in com.jgalgo
-
Calculate the maximum flow in a flow network.
- MaximumFlow.Builder - Interface in com.jgalgo
-
A builder for
MaximumFlow
objects. - MaximumFlowBench - Class in com.jgalgo.bench.impls
- MaximumFlowBench() - Constructor for class com.jgalgo.bench.impls.MaximumFlowBench
- MaximumFlowBench.BarabasiAlbert - Class in com.jgalgo.bench.impls
- MaximumFlowBench.Gnp - Class in com.jgalgo.bench.impls
- MaximumFlowBench.RecursiveMatrix - Class in com.jgalgo.bench.impls
- maximumMatchingExample() - Static method in class com.jgalgo.example.MaximumMatchingExample
- MaximumMatchingExample - Class in com.jgalgo.example
- MaximumMatchingExample() - Constructor for class com.jgalgo.example.MaximumMatchingExample
- MaximumWeighted() - Constructor for class com.jgalgo.bench.impls.MatchingBench.MaximumWeighted
- MaximumWeightedBipartite() - Constructor for class com.jgalgo.bench.impls.MatchingBench.MaximumWeightedBipartite
- MinCostFlowBench - Class in com.jgalgo.bench.impls
- MinCostFlowBench() - Constructor for class com.jgalgo.bench.impls.MinCostFlowBench
- MinCostFlowBench.MaxFlow - Class in com.jgalgo.bench.impls
- MinCostFlowBench.MaxFlow.BarabasiAlbert - Class in com.jgalgo.bench.impls
- MinCostFlowBench.MaxFlow.Gnp - Class in com.jgalgo.bench.impls
- MinCostFlowBench.MaxFlow.RecursiveMatrix - Class in com.jgalgo.bench.impls
- MinCostFlowBench.Supply - Class in com.jgalgo.bench.impls
- MinCostFlowBench.Supply.BarabasiAlbert - Class in com.jgalgo.bench.impls
- MinCostFlowBench.Supply.Gnp - Class in com.jgalgo.bench.impls
- MinCostFlowBench.Supply.RecursiveMatrix - Class in com.jgalgo.bench.impls
- MinimumCostFlow - Interface in com.jgalgo
-
Compute the minimum-cost (max) flow in a flow network.
- MinimumCostFlow.Builder - Interface in com.jgalgo
-
A builder for
MinimumCostFlow
objects. - MinimumCutGlobal - Interface in com.jgalgo
-
Global Minimum Cut algorithm without terminal vertices.
- MinimumCutGlobal.Builder - Interface in com.jgalgo
-
A builder for
MinimumCutGlobal
objects. - MinimumCutST - Interface in com.jgalgo
-
Minimum Cut algorithm with terminal vertices (source-sink, S-T).
- MinimumCutST.Builder - Interface in com.jgalgo
-
A builder for
MinimumCutST
objects. - MinimumDirectedSpanningTree - Interface in com.jgalgo
-
Minimum spanning tree algorithm for directed graphs.
- MinimumDirectedSpanningTree.Builder - Interface in com.jgalgo
-
A builder for
MinimumDirectedSpanningTree
objects. - MinimumMeanCycle - Interface in com.jgalgo
-
Algorithm that find the cycle with the minimum mean weight.
- MinimumMeanCycle.Builder - Interface in com.jgalgo
-
A builder for
MinimumMeanCycle
objects. - MinimumMeanCycleBench - Class in com.jgalgo.bench.impls
- MinimumMeanCycleBench() - Constructor for class com.jgalgo.bench.impls.MinimumMeanCycleBench
- MinimumPerfect() - Constructor for class com.jgalgo.bench.impls.MatchingBench.MinimumPerfect
- MinimumPerfectBipartite() - Constructor for class com.jgalgo.bench.impls.MatchingBench.MinimumPerfectBipartite
- MinimumSpanningTree - Interface in com.jgalgo
-
Minimum spanning tree algorithm.
- MinimumSpanningTree.Builder - Interface in com.jgalgo
-
A builder for
MinimumSpanningTree
objects. - MinimumSpanningTree.Result - Interface in com.jgalgo
-
A result object for
MinimumSpanningTree
computation. - MinimumSpanningTreeExample - Class in com.jgalgo.example
- MinimumSpanningTreeExample() - Constructor for class com.jgalgo.example.MinimumSpanningTreeExample
- MSTBench - Class in com.jgalgo.bench.impls
- MSTBench() - Constructor for class com.jgalgo.bench.impls.MSTBench
- MSTExample() - Static method in class com.jgalgo.example.MinimumSpanningTreeExample
N
- n - Variable in class com.jgalgo.bench.impls.RMQStaticBench.PreProcess
- n - Variable in class com.jgalgo.bench.impls.RMQStaticBench.PreProcessPlusMinusOne
- n - Variable in class com.jgalgo.bench.impls.RMQStaticBench.Query.CartesianTrees
- n - Variable in class com.jgalgo.bench.impls.RMQStaticBench.Query.LookupTable
- n - Variable in class com.jgalgo.bench.impls.RMQStaticBench.Query.PlusMinusOne
- n - Variable in class com.jgalgo.bench.impls.RMQStaticBench.Query.PowerOf2Table
- n - Variable in class com.jgalgo.bench.impls.TreePathMaximaBench
- newBuilder() - Static method in interface com.jgalgo.BiConnectedComponentsAlgo
-
Create a new bi-connected components algorithm builder.
- newBuilder() - Static method in interface com.jgalgo.ChinesePostman
-
Create a new builder for chinese postman algorithms.
- newBuilder() - Static method in interface com.jgalgo.Coloring
-
Create a new coloring algorithm builder.
- newBuilder() - Static method in interface com.jgalgo.ConnectedComponentsAlgo
-
Create a new connectivity algorithm builder.
- newBuilder() - Static method in interface com.jgalgo.CoreAlgo
-
Create a new builder for core algorithms.
- newBuilder() - Static method in interface com.jgalgo.CyclesFinder
-
Create a new cycles finder algorithm builder.
- newBuilder() - Static method in interface com.jgalgo.EulerianTourAlgo
-
Create a new Eulerian tour algorithm builder.
- newBuilder() - Static method in interface com.jgalgo.LowestCommonAncestorDynamic
-
Create a new dynamic LCA algorithm builder.
- newBuilder() - Static method in interface com.jgalgo.LowestCommonAncestorStatic
-
Create a new static LCA algorithm builder.
- newBuilder() - Static method in interface com.jgalgo.MatchingAlgorithm
-
Create a new matching algorithm builder.
- newBuilder() - Static method in interface com.jgalgo.MaximalCliques
-
Create a new builder for maximal cliques algorithms.
- newBuilder() - Static method in interface com.jgalgo.MaximumFlow
-
Create a new maximum flow algorithm builder.
- newBuilder() - Static method in interface com.jgalgo.MinimumCostFlow
-
Create a new minimum cost flow algorithm builder.
- newBuilder() - Static method in interface com.jgalgo.MinimumCutGlobal
-
Create a new global minimum cut algorithm builder.
- newBuilder() - Static method in interface com.jgalgo.MinimumCutST
-
Create a new minimum cut algorithm builder.
- newBuilder() - Static method in interface com.jgalgo.MinimumDirectedSpanningTree
-
Create a new minimum directed spanning tree algorithm builder.
- newBuilder() - Static method in interface com.jgalgo.MinimumMeanCycle
-
Create a new minimum mean cycle algorithm builder.
- newBuilder() - Static method in interface com.jgalgo.MinimumSpanningTree
-
Create a new minimum spanning tree algorithm builder.
- newBuilder() - Static method in interface com.jgalgo.ShortestPathAllPairs
-
Create a new all pairs shortest paths algorithm builder.
- newBuilder() - Static method in interface com.jgalgo.ShortestPathSingleSource
-
Create a new single source shortest path algorithm builder.
- newBuilder() - Static method in interface com.jgalgo.ShortestPathWithHeuristic
-
Create a new heuristic shortest path algorithm builder.
- newBuilder() - Static method in interface com.jgalgo.TopologicalOrderAlgo
-
Create a new topological order algorithm builder.
- newBuilder() - Static method in interface com.jgalgo.TreePathMaxima
-
Create a new tree path maxima algorithm builder.
- newBuilder() - Static method in interface com.jgalgo.VertexCover
-
Create a new vertex cover algorithm builder.
- newCompleteGraphDirected(int) - Static method in class com.jgalgo.graph.Graphs
-
Create a new directed complete graph with a fixed number of vertices.
- newCompleteGraphUndirected(int) - Static method in class com.jgalgo.graph.Graphs
-
Create a new undirected complete graph with a fixed number of vertices.
- newCopyOf(Graph) - Method in interface com.jgalgo.graph.GraphFactory
-
Create a copy of a given graph, with the same vertices and edges, without copying weights.
- newCopyOf(Graph, boolean) - Method in interface com.jgalgo.graph.GraphFactory
-
Create a copy of a given graph, with the same vertices and edges, with/without copying weights.
- newCopyOf(IndexGraph) - Method in interface com.jgalgo.graph.IndexGraphFactory
-
Create a copy of a given index graph, with the same vertices and edges, without copying weights.
- newCopyOf(IndexGraph, boolean) - Method in interface com.jgalgo.graph.IndexGraphFactory
-
Create a copy of a given index graph, with the same vertices and edges, with/without copying weights.
- newDirected() - Static method in interface com.jgalgo.graph.GraphBuilder
-
Create a new builder that builds directed graphs.
- newDirected() - Static method in interface com.jgalgo.graph.GraphFactory
-
Create a directed graph factory.
- newDirected() - Static method in interface com.jgalgo.graph.IndexGraphBuilder
-
Create a new builder that builds directed graphs.
- newDirected() - Static method in interface com.jgalgo.graph.IndexGraphFactory
-
Create a directed index graph factory.
- newFrom(Graph) - Static method in interface com.jgalgo.graph.GraphBuilder
-
Create a new builder initialized with an existing graph vertices and edges, without copying the weights.
- newFrom(Graph) - Static method in interface com.jgalgo.graph.GraphFactory
-
Create a new graph factory based on a given implementation.
- newFrom(Graph, boolean) - Static method in interface com.jgalgo.graph.GraphBuilder
-
Create a new builder initialized with an existing graph vertices and edges, with/without copying the weights.
- newFrom(IndexGraph) - Static method in interface com.jgalgo.graph.IndexGraphBuilder
-
Create a new builder initialized with an existing graph vertices and edges, without copying the weights.
- newFrom(IndexGraph) - Static method in interface com.jgalgo.graph.IndexGraphFactory
-
Create a new index graph factory based on a given implementation.
- newFrom(IndexGraph, boolean) - Static method in interface com.jgalgo.graph.IndexGraphBuilder
-
Create a new builder initialized with an existing graph vertices and edges, with/without copying the weights.
- newFromMaximumFlow(MaximumFlow) - Static method in interface com.jgalgo.MinimumCutST
-
Create a new minimum cut algorithm using a maximum flow algorithm.
- newGraph() - Method in interface com.jgalgo.graph.GraphFactory
-
Create a new empty graph.
- newGraph() - Method in interface com.jgalgo.graph.IndexGraphFactory
-
Create a new empty index graph.
- newInstance() - Static method in interface com.jgalgo.TreePathMaxima.Queries
-
Create an empty queries container.
- newInstance(Graph, int) - Static method in interface com.jgalgo.BFSIter
-
Create a BFS iterator rooted at a single source vertex.
- newInstance(Graph, int) - Static method in interface com.jgalgo.DFSIter
-
Create a DFS iterator rooted at some source vertex.
- newInstanceBackward(Graph, int) - Static method in interface com.jgalgo.BFSIter
-
Create a backward BFS iterator rooted at a single source vertex.
- newUndirected() - Static method in interface com.jgalgo.graph.GraphBuilder
-
Create a new builder that builds undirected graphs.
- newUndirected() - Static method in interface com.jgalgo.graph.GraphFactory
-
Create an undirected graph factory.
- newUndirected() - Static method in interface com.jgalgo.graph.IndexGraphBuilder
-
Create a new builder that builds undirected graphs.
- newUndirected() - Static method in interface com.jgalgo.graph.IndexGraphFactory
-
Create an undirected index graph factory.
- nextInt() - Method in interface com.jgalgo.BFSIter
-
Advance the iterator and return a vertex that was not visited by the iterator yet.
- nextInt() - Method in interface com.jgalgo.DFSIter
-
Advance the iterator and return a vertex that was not visited by the iterator yet.
O
- origToReIndexed(int) - Method in interface com.jgalgo.graph.IndexGraphBuilder.ReIndexingMap
-
Map an element's original index to its re-indexed index.
- OutAndInDegree - com.jgalgo.CoreAlgo.DegreeType
-
Cores will be computed with respect to the sum of the in and out degrees of the vertices.
- OutDegree - com.jgalgo.CoreAlgo.DegreeType
-
Cores will be computed with respect to the out-degree of the vertices, namely the number of outgoing edges.
- outEdges(int) - Method in interface com.jgalgo.graph.Graph
-
Get the edges whose source is
source
.
P
- Pairing(Blackhole) - Method in class com.jgalgo.bench.impls.HeapBench
- Pairings(Blackhole) - Method in class com.jgalgo.bench.impls.HeapReferenceableBench
- PairingWithoutPrimitives(Blackhole) - Method in class com.jgalgo.bench.impls.HeapReferenceableBench
- parallelEdges() - Method in interface com.jgalgo.graph.GraphCapabilities
-
Checks whether parallel edges are supported.
- Path - Interface in com.jgalgo
-
A path of edges in a graph.
- peekNext() - Method in interface com.jgalgo.graph.EdgeIter
-
Peek at the next edge of the iterator without advancing it.
- PlusMinusOne() - Constructor for class com.jgalgo.bench.impls.RMQStaticBench.Query.PlusMinusOne
- PowerOf2Table() - Constructor for class com.jgalgo.bench.impls.RMQStaticBench.Query.PowerOf2Table
- PowerOf2Table(Blackhole) - Method in class com.jgalgo.bench.impls.RMQStaticBench.PreProcess
- PreProcess() - Constructor for class com.jgalgo.bench.impls.RMQStaticBench.PreProcess
- PreProcessPlusMinusOne() - Constructor for class com.jgalgo.bench.impls.RMQStaticBench.PreProcessPlusMinusOne
- preProcessTree(Graph, int) - Method in interface com.jgalgo.LowestCommonAncestorStatic
-
Perform a static pre processing of a tree for future LCA (Lowest common ancestor) queries.
- Prim(Blackhole) - Method in class com.jgalgo.bench.impls.MSTBench
- PushRelabelDynamicTrees(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.BarabasiAlbert
- PushRelabelDynamicTrees(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.RecursiveMatrix
- PushRelabelFifo(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.BarabasiAlbert
- PushRelabelFifo(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.Gnp
- PushRelabelFifo(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.RecursiveMatrix
- PushRelabelHighestFirst(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.BarabasiAlbert
- PushRelabelHighestFirst(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.Gnp
- PushRelabelHighestFirst(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.RecursiveMatrix
- PushRelabelLowestFirst(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.BarabasiAlbert
- PushRelabelLowestFirst(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.Gnp
- PushRelabelLowestFirst(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.RecursiveMatrix
- PushRelabelPartialAugment(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.BarabasiAlbert
- PushRelabelPartialAugment(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.Gnp
- PushRelabelPartialAugment(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.RecursiveMatrix
- PushRelabelToFront(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.BarabasiAlbert
- PushRelabelToFront(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.Gnp
- PushRelabelToFront(Blackhole) - Method in class com.jgalgo.bench.impls.MaximumFlowBench.RecursiveMatrix
Q
- Query() - Constructor for class com.jgalgo.bench.impls.RMQStaticBench.Query
R
- RecursiveLargestFirst(Blackhole) - Method in class com.jgalgo.bench.impls.ColoringBench
- RecursiveMatrix() - Constructor for class com.jgalgo.bench.impls.MaximalCliquesBench.RecursiveMatrix
- RecursiveMatrix() - Constructor for class com.jgalgo.bench.impls.MaximumFlowBench.RecursiveMatrix
- RecursiveMatrix() - Constructor for class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow.RecursiveMatrix
- RecursiveMatrix() - Constructor for class com.jgalgo.bench.impls.MinCostFlowBench.Supply.RecursiveMatrix
- RecursiveMatrix() - Constructor for class com.jgalgo.bench.impls.SSSPNegativeWeightsBench.RecursiveMatrix
- RecursiveMatrix() - Constructor for class com.jgalgo.bench.impls.SSSPPositiveWeightsBench.RecursiveMatrix
- RedBlackTree(Blackhole) - Method in class com.jgalgo.bench.impls.HeapBench
- RedBlackTree(Blackhole) - Method in class com.jgalgo.bench.impls.HeapReferenceableBench
- reIndexAndBuild(boolean, boolean) - Method in interface com.jgalgo.graph.IndexGraphBuilder
-
Re-Index the vertices/edges and build a new immutable graph with the new indexing.
- reIndexAndBuildMutable(boolean, boolean) - Method in interface com.jgalgo.graph.IndexGraphBuilder
-
Re-Index the vertices/edges and build a new mutable graph with the new indexing.
- reIndexedToOrig(int) - Method in interface com.jgalgo.graph.IndexGraphBuilder.ReIndexingMap
-
Map an element's re-indexed index to its original index.
- removeEdge(int) - Method in interface com.jgalgo.graph.Graph
-
Remove an edge from the graph.
- removeEdge(int) - Method in interface com.jgalgo.graph.IndexGraph
-
Remove an edge from the graph.
- removeEdgesOf(int) - Method in interface com.jgalgo.graph.Graph
-
Remove all the edges of a vertex.
- removeEdgesOf(int) - Method in interface com.jgalgo.graph.IndexGraph
-
Remove all the edges of a vertex.
- removeEdgeSwapListener(IndexSwapListener) - Method in interface com.jgalgo.graph.IndexGraph
-
Removes an edge swap listener.
- removeEdgesWeights(Object) - Method in interface com.jgalgo.graph.Graph
-
Remove a weight type associated with the edges of the graph.
- removeHint(GraphFactory.Hint) - Method in interface com.jgalgo.graph.GraphFactory
-
Remove a hint from this factory.
- removeHint(GraphFactory.Hint) - Method in interface com.jgalgo.graph.IndexGraphFactory
-
Remove a hint from this factory.
- removeInEdgesOf(int) - Method in interface com.jgalgo.graph.Graph
-
Remove all edges whose target is
target
. - removeInEdgesOf(int) - Method in interface com.jgalgo.graph.IndexGraph
-
Remove all edges whose target is
target
. - removeOutEdgesOf(int) - Method in interface com.jgalgo.graph.Graph
-
Remove all edges whose source is
source
. - removeOutEdgesOf(int) - Method in interface com.jgalgo.graph.IndexGraph
-
Remove all edges whose source is
source
. - removeVertex(int) - Method in interface com.jgalgo.graph.Graph
-
Remove a vertex and all its edges from the graph.
- removeVertex(int) - Method in interface com.jgalgo.graph.IndexGraph
-
Remove a vertex and all its edges from the graph.
- removeVertexSwapListener(IndexSwapListener) - Method in interface com.jgalgo.graph.IndexGraph
-
Removes a vertex swap listener.
- removeVerticesWeights(Object) - Method in interface com.jgalgo.graph.Graph
-
Remove a weight type associated with the vertices of the graph.
- resetFlow() - Method in class com.jgalgo.bench.impls.MaximumFlowBench.BarabasiAlbert
- resetFlow() - Method in class com.jgalgo.bench.impls.MaximumFlowBench.Gnp
- resetFlow() - Method in class com.jgalgo.bench.impls.MaximumFlowBench.RecursiveMatrix
- resetFlow() - Method in class com.jgalgo.bench.impls.MaximumFlowBench
- resetFlow() - Method in class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow.BarabasiAlbert
- resetFlow() - Method in class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow.Gnp
- resetFlow() - Method in class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow.RecursiveMatrix
- resetFlow() - Method in class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow
- resetFlow() - Method in class com.jgalgo.bench.impls.MinCostFlowBench.Supply.BarabasiAlbert
- resetFlow() - Method in class com.jgalgo.bench.impls.MinCostFlowBench.Supply.Gnp
- resetFlow() - Method in class com.jgalgo.bench.impls.MinCostFlowBench.Supply.RecursiveMatrix
- resetFlow() - Method in class com.jgalgo.bench.impls.MinCostFlowBench.Supply
- reverseEdge(int) - Method in interface com.jgalgo.graph.Graph
-
Reverse an edge by switching its source and target.
- reverseView() - Method in interface com.jgalgo.graph.Graph
-
Get a reversed view of this graph.
- reverseView() - Method in interface com.jgalgo.graph.IndexGraph
- RMQStaticBench - Class in com.jgalgo.bench.impls
- RMQStaticBench() - Constructor for class com.jgalgo.bench.impls.RMQStaticBench
- RMQStaticBench.PreProcess - Class in com.jgalgo.bench.impls
- RMQStaticBench.PreProcessPlusMinusOne - Class in com.jgalgo.bench.impls
- RMQStaticBench.Query - Class in com.jgalgo.bench.impls
- RMQStaticBench.Query.CartesianTrees - Class in com.jgalgo.bench.impls
- RMQStaticBench.Query.LookupTable - Class in com.jgalgo.bench.impls
- RMQStaticBench.Query.PlusMinusOne - Class in com.jgalgo.bench.impls
- RMQStaticBench.Query.PowerOf2Table - Class in com.jgalgo.bench.impls
S
- selfEdges() - Method in interface com.jgalgo.graph.GraphCapabilities
-
Checks whether self edges are supported.
- set(int, boolean) - Method in interface com.jgalgo.graph.Weights.Bool
-
Set the weight associated with the given id.
- set(int, byte) - Method in interface com.jgalgo.graph.Weights.Byte
-
Set the weight associated with the given id.
- set(int, char) - Method in interface com.jgalgo.graph.Weights.Char
-
Set the weight associated with the given id.
- set(int, double) - Method in interface com.jgalgo.graph.Weights.Double
-
Set the weight associated with the given id.
- set(int, float) - Method in interface com.jgalgo.graph.Weights.Float
-
Set the weight associated with the given id.
- set(int, int) - Method in interface com.jgalgo.graph.Weights.Int
-
Set the weight associated with the given id.
- set(int, long) - Method in interface com.jgalgo.graph.Weights.Long
-
Set the weight associated with the given id.
- set(int, short) - Method in interface com.jgalgo.graph.Weights.Short
-
Set the weight associated with the given id.
- set(int, Boolean) - Method in interface com.jgalgo.graph.Weights.Bool
-
Deprecated.
- set(int, Byte) - Method in interface com.jgalgo.graph.Weights.Byte
-
Deprecated.
- set(int, Character) - Method in interface com.jgalgo.graph.Weights.Char
-
Deprecated.
- set(int, Double) - Method in interface com.jgalgo.graph.Weights.Double
-
Deprecated.
- set(int, Float) - Method in interface com.jgalgo.graph.Weights.Float
-
Deprecated.
- set(int, Integer) - Method in interface com.jgalgo.graph.Weights.Int
-
Deprecated.
- set(int, Long) - Method in interface com.jgalgo.graph.Weights.Long
-
Deprecated.
- set(int, Short) - Method in interface com.jgalgo.graph.Weights.Short
-
Deprecated.
- set(int, W) - Method in interface com.jgalgo.graph.Weights
-
Set the weight associated with the given id.
- setBipartite(boolean) - Method in interface com.jgalgo.MatchingAlgorithm.Builder
-
Set whether the matching algorithms built by this builder should only support bipartite graphs.
- setCapacity(int, double) - Method in interface com.jgalgo.FlowNetwork.Int
-
Deprecated.
- setCapacity(int, double) - Method in interface com.jgalgo.FlowNetwork
-
Set the capacity of an edge.
- setCapacity(int, int) - Method in interface com.jgalgo.FlowNetwork.Int
-
Set the integer capacity of an edge.
- setCardinality(boolean) - Method in interface com.jgalgo.MatchingAlgorithm.Builder
-
Set whether the matching algorithms built by this builder should support only maximum cardinality matching.
- setCardinality(boolean) - Method in interface com.jgalgo.ShortestPathAllPairs.Builder
-
Enable/disable the support for cardinality shortest paths only.
- setCardinality(boolean) - Method in interface com.jgalgo.ShortestPathSingleSource.Builder
-
Enable/disable the support for cardinality shortest paths only.
- setDag(boolean) - Method in interface com.jgalgo.ShortestPathSingleSource.Builder
-
Enable/disable the support for directed acyclic graphs (DAG) only.
- setDirected(boolean) - Method in interface com.jgalgo.graph.GraphFactory
-
Determine if graphs built by this factory should be directed or not.
- setDirected(boolean) - Method in interface com.jgalgo.graph.IndexGraphFactory
-
Determine if graphs built by this factory should be directed or not.
- setFlow(int, double) - Method in interface com.jgalgo.FlowNetwork.Int
-
Deprecated.
- setFlow(int, double) - Method in interface com.jgalgo.FlowNetwork
-
Set the amount of flow units going along an edge.
- setFlow(int, int) - Method in interface com.jgalgo.FlowNetwork.Int
-
Set the integer amount of flow units going along an edge.
- setIntWeights(boolean) - Method in interface com.jgalgo.ShortestPathSingleSource.Builder
-
Enable/disable integer weights.
- setMaxDistance(double) - Method in interface com.jgalgo.ShortestPathSingleSource.Builder
-
Set the maximum distance that should be supported.
- setNegativeWeights(boolean) - Method in interface com.jgalgo.ShortestPathSingleSource.Builder
-
Enable/disable the support for negative numbers.
- setNodeData(Object) - Method in interface com.jgalgo.LowestCommonAncestorDynamic.Node
-
Set the user data of this node.
- setParallelByDefault(boolean) - Static method in class com.jgalgo.JGAlgoConfig
-
Enable/disable default parallel computations in all algorithms.
- setup() - Method in class com.jgalgo.bench.impls.APSPBench
- setup() - Method in class com.jgalgo.bench.impls.ColoringBench
- setup() - Method in class com.jgalgo.bench.impls.CyclesFinderBench
- setup() - Method in class com.jgalgo.bench.impls.HeapBench
- setup() - Method in class com.jgalgo.bench.impls.HeapReferenceableBench
- setup() - Method in class com.jgalgo.bench.impls.LCADynamicBench
- setup() - Method in class com.jgalgo.bench.impls.MatchingBench.MaximumCardinality
- setup() - Method in class com.jgalgo.bench.impls.MatchingBench.MaximumCardinalityBipartite
- setup() - Method in class com.jgalgo.bench.impls.MatchingBench.MaximumWeighted
- setup() - Method in class com.jgalgo.bench.impls.MatchingBench.MaximumWeightedBipartite
- setup() - Method in class com.jgalgo.bench.impls.MatchingBench.MinimumPerfect
- setup() - Method in class com.jgalgo.bench.impls.MatchingBench.MinimumPerfectBipartite
- setup() - Method in class com.jgalgo.bench.impls.MaximalCliquesBench.BarabasiAlbert
- setup() - Method in class com.jgalgo.bench.impls.MaximalCliquesBench.Gnp
- setup() - Method in class com.jgalgo.bench.impls.MaximalCliquesBench.RecursiveMatrix
- setup() - Method in class com.jgalgo.bench.impls.MaximumFlowBench.BarabasiAlbert
- setup() - Method in class com.jgalgo.bench.impls.MaximumFlowBench.Gnp
- setup() - Method in class com.jgalgo.bench.impls.MaximumFlowBench.RecursiveMatrix
- setup() - Method in class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow.BarabasiAlbert
- setup() - Method in class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow.Gnp
- setup() - Method in class com.jgalgo.bench.impls.MinCostFlowBench.MaxFlow.RecursiveMatrix
- setup() - Method in class com.jgalgo.bench.impls.MinCostFlowBench.Supply.BarabasiAlbert
- setup() - Method in class com.jgalgo.bench.impls.MinCostFlowBench.Supply.Gnp
- setup() - Method in class com.jgalgo.bench.impls.MinCostFlowBench.Supply.RecursiveMatrix
- setup() - Method in class com.jgalgo.bench.impls.MinimumMeanCycleBench
- setup() - Method in class com.jgalgo.bench.impls.MSTBench
- setup() - Method in class com.jgalgo.bench.impls.RMQStaticBench.PreProcess
- setup() - Method in class com.jgalgo.bench.impls.RMQStaticBench.PreProcessPlusMinusOne
- setup() - Method in class com.jgalgo.bench.impls.SSSPNegativeWeightsBench.BarabasiAlbert
- setup() - Method in class com.jgalgo.bench.impls.SSSPNegativeWeightsBench.Gnp
- setup() - Method in class com.jgalgo.bench.impls.SSSPNegativeWeightsBench.RecursiveMatrix
- setup() - Method in class com.jgalgo.bench.impls.SSSPPositiveWeightsBench.BarabasiAlbert
- setup() - Method in class com.jgalgo.bench.impls.SSSPPositiveWeightsBench.Gnp
- setup() - Method in class com.jgalgo.bench.impls.SSSPPositiveWeightsBench.RecursiveMatrix
- setup() - Method in class com.jgalgo.bench.impls.TreePathMaximaBench
- setup() - Method in class com.jgalgo.bench.impls.UnionFindBench
- setupCreateArray() - Method in class com.jgalgo.bench.impls.RMQStaticBench.Query.CartesianTrees
- setupCreateArray() - Method in class com.jgalgo.bench.impls.RMQStaticBench.Query.LookupTable
- setupCreateArray() - Method in class com.jgalgo.bench.impls.RMQStaticBench.Query.PlusMinusOne
- setupCreateArray() - Method in class com.jgalgo.bench.impls.RMQStaticBench.Query.PowerOf2Table
- setupQueryIndices() - Method in class com.jgalgo.bench.impls.RMQStaticBench.Query.CartesianTrees
- setupQueryIndices() - Method in class com.jgalgo.bench.impls.RMQStaticBench.Query.LookupTable
- setupQueryIndices() - Method in class com.jgalgo.bench.impls.RMQStaticBench.Query.PlusMinusOne
- setupQueryIndices() - Method in class com.jgalgo.bench.impls.RMQStaticBench.Query.PowerOf2Table
- ShortestPathAllPairs - Interface in com.jgalgo
-
An algorithm that compute all pairs shortest path (APSP) in a graph.
- ShortestPathAllPairs.Builder - Interface in com.jgalgo
-
A builder for
ShortestPathAllPairs
objects. - ShortestPathAllPairs.Result - Interface in com.jgalgo
-
A result object for an
ShortestPathAllPairs
algorithm. - shortestPathExample() - Static method in class com.jgalgo.example.ShortestPathExample
- ShortestPathExample - Class in com.jgalgo.example
- ShortestPathExample() - Constructor for class com.jgalgo.example.ShortestPathExample
- ShortestPathSingleSource - Interface in com.jgalgo
-
Single Source Shortest Path algorithm.
- ShortestPathSingleSource.Builder - Interface in com.jgalgo
-
A builder for
ShortestPathSingleSource
objects. - ShortestPathSingleSource.Result - Interface in com.jgalgo
-
A result object for the
ShortestPathSingleSource
problem. - ShortestPathWithHeuristic - Interface in com.jgalgo
-
Shortest path algorithm that uses a distance heuristic function.
- ShortestPathWithHeuristic.Builder - Interface in com.jgalgo
-
A builder for
ShortestPathWithHeuristic
objects. - size() - Method in interface com.jgalgo.LowestCommonAncestorDynamic
-
Get the number of nodes in the tree.
- size() - Method in interface com.jgalgo.TreePathMaxima.Queries
-
Get the number of queries in this container.
- size() - Method in interface com.jgalgo.TreePathMaxima.Result
-
Get the number queries results this result object hold.
- source() - Method in interface com.jgalgo.graph.EdgeIter
-
Get the source vertex of the last returned edge.
- source() - Method in interface com.jgalgo.Path
-
Get the source vertex of the path.
- SplayTree(Blackhole) - Method in class com.jgalgo.bench.impls.HeapBench
- SplayTree(Blackhole) - Method in class com.jgalgo.bench.impls.HeapReferenceableBench
- SSSPNegativeWeightsBench - Class in com.jgalgo.bench.impls
- SSSPNegativeWeightsBench() - Constructor for class com.jgalgo.bench.impls.SSSPNegativeWeightsBench
- SSSPNegativeWeightsBench.BarabasiAlbert - Class in com.jgalgo.bench.impls
- SSSPNegativeWeightsBench.Gnp - Class in com.jgalgo.bench.impls
- SSSPNegativeWeightsBench.RecursiveMatrix - Class in com.jgalgo.bench.impls
- SSSPPositiveWeightsBench - Class in com.jgalgo.bench.impls
- SSSPPositiveWeightsBench() - Constructor for class com.jgalgo.bench.impls.SSSPPositiveWeightsBench
- SSSPPositiveWeightsBench.BarabasiAlbert - Class in com.jgalgo.bench.impls
- SSSPPositiveWeightsBench.Gnp - Class in com.jgalgo.bench.impls
- SSSPPositiveWeightsBench.RecursiveMatrix - Class in com.jgalgo.bench.impls
- staticLCAExample() - Static method in class com.jgalgo.example.LowestCommonAncestorExample
- Supply() - Constructor for class com.jgalgo.bench.impls.MinCostFlowBench.Supply
- swap(int, int) - Method in interface com.jgalgo.graph.IndexSwapListener
-
A callback that is called when
idx1
andidx2
are swapped.
T
- target() - Method in interface com.jgalgo.graph.EdgeIter
-
Get the target vertex of the last returned edge.
- target() - Method in interface com.jgalgo.Path
-
Get the target vertex of the path.
- Tarjan(Blackhole) - Method in class com.jgalgo.bench.impls.CyclesFinderBench
- TopologicalOrderAlgo - Interface in com.jgalgo
-
Algorithm that calculate a topological order of graph vertices.
- TopologicalOrderAlgo.Builder - Interface in com.jgalgo
-
A builder for
TopologicalOrderAlgo
objects. - TopologicalOrderAlgo.Result - Interface in com.jgalgo
-
A result object of a
TopologicalOrderAlgo
algorithm. - toVerticesList() - Method in interface com.jgalgo.Path
-
Get the vertices forming this path.
- TPMHagerup(Blackhole) - Method in class com.jgalgo.bench.impls.TreePathMaximaBench
- TPMHagerupWithBitsLookupTable(Blackhole) - Method in class com.jgalgo.bench.impls.TreePathMaximaBench
- TreePathMaxima - Interface in com.jgalgo
-
Tree Path Maxima (TPM) algorithm.
- TreePathMaxima.Builder - Interface in com.jgalgo
-
A builder for
TreePathMaxima
objects. - TreePathMaxima.Queries - Interface in com.jgalgo
-
Queries container for
TreePathMaxima
computations. - TreePathMaxima.Result - Interface in com.jgalgo
-
A result object for
TreePathMaxima
algorithm. - TreePathMaximaBench - Class in com.jgalgo.bench.impls
- TreePathMaximaBench() - Constructor for class com.jgalgo.bench.impls.TreePathMaximaBench
- Trees - Class in com.jgalgo
-
Static methods class for tree graphs.
- TSPMetric - Interface in com.jgalgo
-
Metric Traveling Salesman Problem (TSP) algorithm.
- TSPMetricMatchingAppx - Class in com.jgalgo
-
TSP \(3/2\)-approximation using maximum matching.
- TSPMetricMatchingAppx() - Constructor for class com.jgalgo.TSPMetricMatchingAppx
-
Create a new TSP \(3/2\)-approximation algorithm.
- TSPMetricMSTAppx - Class in com.jgalgo
-
TSP \(2\)-approximation using MST.
- TSPMetricMSTAppx() - Constructor for class com.jgalgo.TSPMetricMSTAppx
-
Create a new TSP \(2\)-approximation algorithm.
U
- UnionFindArrayMSTKruskal(Blackhole) - Method in class com.jgalgo.bench.impls.UnionFindBench
- UnionFindBench - Class in com.jgalgo.bench.impls
- UnionFindBench() - Constructor for class com.jgalgo.bench.impls.UnionFindBench
- UnionFindPtrMSTKruskal(Blackhole) - Method in class com.jgalgo.bench.impls.UnionFindBench
- unmatchedVertices() - Method in interface com.jgalgo.Matching
-
Get all the vertices that are not matched by the matching.
V
- valueOf(String) - Static method in enum com.jgalgo.CoreAlgo.DegreeType
-
Returns the enum constant of this type with the specified name.
- valueOf(String) - Static method in enum com.jgalgo.graph.GraphFactory.Hint
-
Returns the enum constant of this type with the specified name.
- values() - Static method in enum com.jgalgo.CoreAlgo.DegreeType
-
Returns an array containing the constants of this enum type, in the order they are declared.
- values() - Static method in enum com.jgalgo.graph.GraphFactory.Hint
-
Returns an array containing the constants of this enum type, in the order they are declared.
- verifyMST(Graph, WeightFunction, IntCollection, TreePathMaxima) - Static method in interface com.jgalgo.TreePathMaxima
-
Verify that the given edges actually form an MST of a graph.
- vertexCoreNum(int) - Method in interface com.jgalgo.CoreAlgo.Result
-
The core number of the given vertex.
- VertexCover - Interface in com.jgalgo
-
Minimum weighted vertex cover algorithm.
- VertexCover.Builder - Interface in com.jgalgo
-
A builder for
VertexCover
algorithms. - VertexCover.Result - Interface in com.jgalgo
-
A result object of
VertexCover
computation. - vertices() - Method in interface com.jgalgo.Cut
-
Get the collection of all the vertices in the cut.
- vertices() - Method in interface com.jgalgo.graph.Graph
-
Get the set of all vertices of the graph.
- vertices() - Method in interface com.jgalgo.graph.GraphBuilder
-
Get the set of vertices that were added to the graph.
- vertices() - Method in interface com.jgalgo.graph.IndexGraph
-
Get the set of all vertices of the graph.
- vertices() - Method in interface com.jgalgo.graph.IndexGraphBuilder
-
Get the set of vertices that were added to the graph.
- vertices() - Method in interface com.jgalgo.VertexCover.Result
-
Get the vertices which are included in the cover.
- verticesIterator() - Method in interface com.jgalgo.TopologicalOrderAlgo.Result
-
Get an iterator that iterate over the vertices of the graph in the order computed by the
TopologicalOrderAlgo
. - verticesReIndexing() - Method in interface com.jgalgo.graph.IndexGraphBuilder.ReIndexedGraph
-
Get the re-indexing map of the vertices.
W
- weight(int) - Method in interface com.jgalgo.graph.WeightFunction.Int
-
Deprecated.
- weight(int) - Method in interface com.jgalgo.graph.WeightFunction
-
Get the weight of an element.
- weight(int) - Method in interface com.jgalgo.graph.Weights.Double
-
Get the weight of an element.
- weight(int) - Method in interface com.jgalgo.graph.Weights.Float
-
Get the weight of an element.
- weight(int) - Method in interface com.jgalgo.graph.Weights.Long
-
Get the weight of an element.
- weight(WeightFunction) - Method in interface com.jgalgo.Cut
-
Get the weight of the cut with respect to the given weight function.
- weight(WeightFunction) - Method in interface com.jgalgo.Matching
-
Get the weight of the matching with respect to some weight function.
- weight(WeightFunction) - Method in interface com.jgalgo.MinimumSpanningTree.Result
-
Get the MST weight with respect to a weight function
- weight(WeightFunction) - Method in interface com.jgalgo.Path
-
Get the weight of the path with respect to some weight function.
- weight(WeightFunction) - Method in interface com.jgalgo.VertexCover.Result
-
Get the weight of the cover with respect to a vertex weight function.
- WeightFunction - Interface in com.jgalgo.graph
-
Weight function that maps graph edges (or vertices) to weights.
- WeightFunction.Int - Interface in com.jgalgo.graph
-
Weight function that maps graph edges (or vertices) to integer weights.
- WeightFunctions - Class in com.jgalgo.graph
-
Static methods class for weight functions.
- weightInt(int) - Method in interface com.jgalgo.graph.WeightFunction.Int
-
Get the integer weight of an element.
- weightInt(int) - Method in interface com.jgalgo.graph.Weights.Byte
-
Get the integer weight of an element.
- weightInt(int) - Method in interface com.jgalgo.graph.Weights.Int
-
Get the integer weight of an element.
- weightInt(int) - Method in interface com.jgalgo.graph.Weights.Short
-
Get the integer weight of an element.
- Weights<W> - Interface in com.jgalgo.graph
-
Weights of graph vertices or edges.
- Weights.Bool - Interface in com.jgalgo.graph
-
Specific weights of primitive type
boolean
. - Weights.Byte - Interface in com.jgalgo.graph
-
Specific weights of primitive type
byte
. - Weights.Char - Interface in com.jgalgo.graph
-
Specific weights of primitive type
char
. - Weights.Double - Interface in com.jgalgo.graph
-
Specific weights of primitive type
double
. - Weights.Float - Interface in com.jgalgo.graph
-
Specific weights of primitive type
float
. - Weights.Int - Interface in com.jgalgo.graph
-
Specific weights of primitive type
int
. - Weights.Long - Interface in com.jgalgo.graph
-
Specific weights of primitive type
long
. - Weights.Short - Interface in com.jgalgo.graph
-
Specific weights of primitive type
short
.
Y
- Yao(Blackhole) - Method in class com.jgalgo.bench.impls.MSTBench
All Classes All Packages