Index (JGAlgo - Parent 0.5.1-SNAPSHOT API)

A B C D E F G H I J K L M N O P R S T U V W
All Classes All Packages

A

AbstractGraph<V,E> - Class in com.jgalgo.graph: Abstract implementation of Graph.
AbstractGraph() - Constructor for class com.jgalgo.graph.AbstractGraph: Create a new abstract graph.
addEdge(int, int) - Method in interface com.jgalgo.graph.IndexGraph: Add a new edge to the graph, using the edge builder.
addEdge(int, int) - Method in interface com.jgalgo.graph.IndexGraphBuilder: Add a new edge to the built graph, using the edge builder.
addEdge(int, int) - Method in interface com.jgalgo.graph.IntGraph: Add a new edge to the graph, using the edge builder.
addEdge(int, int) - Method in interface com.jgalgo.graph.IntGraphBuilder: Add a new edge to the built graph, using the edge builder.
addEdge(int, int, int) - Method in interface com.jgalgo.graph.IndexGraph: Deprecated.
use IndexGraph.addEdge(int, int) instead
addEdge(int, int, int) - Method in interface com.jgalgo.graph.IndexGraphBuilder: Deprecated.
use IndexGraphBuilder.addEdge(int, int) instead
addEdge(int, int, int) - Method in interface com.jgalgo.graph.IntGraph: Add a new edge to the graph.
addEdge(int, int, int) - Method in interface com.jgalgo.graph.IntGraphBuilder: Add a new edge to the built graph.
addEdge(EndpointPair<V>, E) - Method in class com.jgalgo.adapt.guava.GuavaMutableNetworkAdapter
addEdge(Integer, Integer) - Method in interface com.jgalgo.graph.IntGraph: Deprecated.
Please use IntGraph.addEdge(int, int) instead to avoid un/boxing.
addEdge(Integer, Integer) - Method in interface com.jgalgo.graph.IntGraphBuilder: Deprecated.
Please use IntGraphBuilder.addEdge(int, int) instead to avoid un/boxing.
addEdge(Integer, Integer, Integer) - Method in interface com.jgalgo.graph.IntGraph: Deprecated.
Please use IntGraph.addEdge(int, int, int) instead to avoid un/boxing.
addEdge(Integer, Integer, Integer) - Method in interface com.jgalgo.graph.IntGraphBuilder: Deprecated.
Please use IntGraphBuilder.addEdge(int, int, int) instead to avoid un/boxing.
addEdge(V, V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
addEdge(V, V) - Method in interface com.jgalgo.graph.Graph: Add a new edge to the graph, using the edge builder.
addEdge(V, V) - Method in interface com.jgalgo.graph.GraphBuilder: Add a new edge to the built graph, using the edge builder.
addEdge(V, V, E) - Method in class com.jgalgo.adapt.guava.GuavaMutableNetworkAdapter
addEdge(V, V, E) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
addEdge(V, V, E) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
addEdge(V, V, E) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
addEdge(V, V, E) - Method in interface com.jgalgo.graph.Graph: Add a new edge to the graph.
addEdge(V, V, E) - Method in interface com.jgalgo.graph.GraphBuilder: Add a new edge to the built graph.
addEdgeRemoveListener(IndexRemoveListener) - Method in interface com.jgalgo.graph.IndexGraph: Adds a listener that will be called each time a edge swap is performed.
addEdges(EdgeSet<? extends Integer, ? extends Integer>) - Method in interface com.jgalgo.graph.IndexGraph: Add multiple edges to the graph.
addEdges(EdgeSet<? extends Integer, ? extends Integer>) - Method in interface com.jgalgo.graph.IndexGraphBuilder: Add multiple edges to the built graph.
addEdges(EdgeSet<? extends Integer, ? extends Integer>) - Method in interface com.jgalgo.graph.IntGraph: Add multiple edges to the graph.
addEdges(EdgeSet<? extends Integer, ? extends Integer>) - Method in interface com.jgalgo.graph.IntGraphBuilder: Add multiple edges to the built graph.
addEdges(EdgeSet<? extends V, ? extends E>) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
addEdges(EdgeSet<? extends V, ? extends E>) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
addEdges(EdgeSet<? extends V, ? extends E>) - Method in interface com.jgalgo.graph.Graph: Add multiple edges to the graph.
addEdges(EdgeSet<? extends V, ? extends E>) - Method in interface com.jgalgo.graph.GraphBuilder: Add multiple edges to the built graph.
addEdgesReassignIds(IEdgeSet) - Method in interface com.jgalgo.graph.IndexGraph: Add multiple edges to the graph and re-assign ids for them.
addEdgesReassignIds(IEdgeSet) - Method in interface com.jgalgo.graph.IndexGraphBuilder: Add multiple edges to the built graph and re-assign ids for them.
addEdgesWeights(String, Class<? super T>) - Method in interface com.jgalgo.graph.Graph: Add a new weights container associated with the edges of this graph.
addEdgesWeights(String, Class<? super T>) - Method in interface com.jgalgo.graph.GraphBuilder: Add a new weights container associated with the edges of the built graph.
addEdgesWeights(String, Class<? super T>) - Method in interface com.jgalgo.graph.IndexGraph: Add a new weights container associated with the edges of this graph.
addEdgesWeights(String, Class<? super T>, T) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
addEdgesWeights(String, Class<? super T>, T) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
addEdgesWeights(String, Class<? super T>, T) - Method in interface com.jgalgo.graph.Graph: Add a new weights container associated with the edges of this graph with default value.
addEdgesWeights(String, Class<? super T>, T) - Method in interface com.jgalgo.graph.GraphBuilder: Add a new weights container associated with the edges of the built graph with default value.
addEdgesWeights(String, Class<? super T>, T) - Method in interface com.jgalgo.graph.IndexGraph: Add a new weights container associated with the edges of this 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
addHint(GraphFactory.Hint) - Method in interface com.jgalgo.graph.IntGraphFactory
addLeaf(LowestCommonAncestorDynamic.Vertex) - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorDynamic: Add a new leaf vertex to the tree.
addLeaf(LowestCommonAncestorDynamic.Vertex) - Method in class com.jgalgo.alg.tree.LowestCommonAncestorDynamicGabowInts
addLeaf(LowestCommonAncestorDynamic.Vertex) - Method in class com.jgalgo.alg.tree.LowestCommonAncestorDynamicGabowLongs
addLeaf(LowestCommonAncestorDynamic.Vertex) - Method in class com.jgalgo.alg.tree.LowestCommonAncestorDynamicGabowSimple
addNode(V) - Method in class com.jgalgo.adapt.guava.GuavaMutableGraphAdapter
addNode(V) - Method in class com.jgalgo.adapt.guava.GuavaMutableNetworkAdapter
addNode(V) - Method in class com.jgalgo.adapt.guava.GuavaMutableValueGraphAdapter
addQuery(int, int) - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorOffline.IQueries: Add a query for the lowest common ancestor of u and v.
addQuery(int, int) - Method in interface com.jgalgo.alg.tree.TreePathMaxima.IQueries: Add a query for the heaviest edge in a tree between two vertices.
addQuery(Integer, Integer) - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorOffline.IQueries: Deprecated.
Please use LowestCommonAncestorOffline.IQueries.addQuery(int, int) instead to avoid un/boxing.
addQuery(Integer, Integer) - Method in interface com.jgalgo.alg.tree.TreePathMaxima.IQueries: Deprecated.
Please use TreePathMaxima.IQueries.addQuery(int, int) instead to avoid un/boxing.
addQuery(V, V) - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorOffline.Queries: Add a query for the lowest common ancestor of u and v.
addQuery(V, V) - Method in interface com.jgalgo.alg.tree.TreePathMaxima.Queries: Add a query for the heaviest edge in a tree between two vertices.
addVertex() - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
addVertex() - Method in interface com.jgalgo.graph.Graph: Add a new vertex to the graph, using the vertex builder.
addVertex() - Method in interface com.jgalgo.graph.GraphBuilder: Add a new vertex to the built graph, using the vertex builder.
addVertex() - Method in interface com.jgalgo.graph.IntGraph: Deprecated.
Please use IntGraph.addVertexInt() instead to avoid un/boxing.
addVertex() - Method in interface com.jgalgo.graph.IntGraphBuilder: Deprecated.
Please use IntGraphBuilder.addVertexInt() instead to avoid un/boxing.
addVertex(int) - Method in interface com.jgalgo.graph.IndexGraph: Deprecated.
use IndexGraph.addVertexInt() instead
addVertex(int) - Method in interface com.jgalgo.graph.IndexGraphBuilder: Deprecated.
use IndexGraphBuilder.addVertexInt() instead
addVertex(int) - Method in interface com.jgalgo.graph.IntGraph: Add a new vertex to the graph.
addVertex(int) - Method in interface com.jgalgo.graph.IntGraphBuilder: Add a new vertex to the built graph.
addVertex(Integer) - Method in interface com.jgalgo.graph.IntGraph: Deprecated.
Please use IntGraph.addVertex(int) instead to avoid un/boxing.
addVertex(Integer) - Method in interface com.jgalgo.graph.IntGraphBuilder: Deprecated.
Please use IntGraphBuilder.addVertex(int) instead to avoid un/boxing.
addVertex(V) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
addVertex(V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
addVertex(V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
addVertex(V) - Method in interface com.jgalgo.graph.Graph: Add a new vertex to the graph.
addVertex(V) - Method in interface com.jgalgo.graph.GraphBuilder: Add a new vertex to the built graph.
addVertexInt() - Method in interface com.jgalgo.graph.IndexGraph: Add a new vertex to the graph, using the vertex builder.
addVertexInt() - Method in interface com.jgalgo.graph.IndexGraphBuilder: Add a new vertex to the built graph, using the vertex builder.
addVertexInt() - Method in interface com.jgalgo.graph.IntGraph: Add a new vertex to the graph, using the vertex builder.
addVertexInt() - Method in interface com.jgalgo.graph.IntGraphBuilder: Add a new vertex to the built graph, using the vertex builder.
addVertexRemoveListener(IndexRemoveListener) - Method in interface com.jgalgo.graph.IndexGraph: Adds a listener that will be called each time a vertex remove or swap is performed.
addVertices(Collection<? extends Integer>) - Method in interface com.jgalgo.graph.IndexGraph: Add multiple vertices to the graph.
addVertices(Collection<? extends Integer>) - Method in interface com.jgalgo.graph.IndexGraphBuilder: Add multiple vertices to the built graph.
addVertices(Collection<? extends Integer>) - Method in interface com.jgalgo.graph.IntGraph: Add multiple vertices to the graph.
addVertices(Collection<? extends Integer>) - Method in interface com.jgalgo.graph.IntGraphBuilder: Add multiple vertices to the built graph.
addVertices(Collection<? extends V>) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
addVertices(Collection<? extends V>) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
addVertices(Collection<? extends V>) - Method in interface com.jgalgo.graph.Graph: Add multiple vertices to the graph.
addVertices(Collection<? extends V>) - Method in interface com.jgalgo.graph.GraphBuilder: Add multiple vertices to the built graph.
addVerticesWeights(String, Class<? super T>) - Method in interface com.jgalgo.graph.Graph: Add a new weights container associated with the vertices of this graph.
addVerticesWeights(String, Class<? super T>) - Method in interface com.jgalgo.graph.GraphBuilder: Add a new weights container associated with the vertices of the built graph.
addVerticesWeights(String, Class<? super T>) - Method in interface com.jgalgo.graph.IndexGraph: Add a new weights container associated with the vertices of this graph.
addVerticesWeights(String, Class<? super T>, T) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
addVerticesWeights(String, Class<? super T>, T) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
addVerticesWeights(String, Class<? super T>, T) - Method in interface com.jgalgo.graph.Graph: Add a new weights container associated with the vertices of this graph with default value.
addVerticesWeights(String, Class<? super T>, T) - Method in interface com.jgalgo.graph.GraphBuilder: Add a new weights container associated with the vertices of built graph with default value.
addVerticesWeights(String, Class<? super T>, T) - Method in interface com.jgalgo.graph.IndexGraph: Add a new weights container associated with the vertices of this graph with default value.
adjacentEdges(E) - Method in class com.jgalgo.adapt.guava.GuavaNetworkAdapter
adjacentNodes(V) - Method in class com.jgalgo.adapt.guava.GuavaGraphAdapter
adjacentNodes(V) - Method in class com.jgalgo.adapt.guava.GuavaNetworkAdapter
adjacentNodes(V) - Method in class com.jgalgo.adapt.guava.GuavaValueGraphAdapter
AlgorithmBuilderBase - Interface in com.jgalgo.alg.common: A base interface for all algorithm builders.
All - com.jgalgo.alg.common.EdgeDirection: The 'All' direction include all the edges with the vertex as the source or the target.
allMinimumCuts(Graph<V, E>, WeightFunction<E>, V, V) - Method in interface com.jgalgo.alg.connect.MinimumEdgeCutAllSt: Compute all the minimum edge-cuts in a graph between two terminal vertices.
allMinimumCuts(Graph<V, E>, WeightFunction<V>) - Method in interface com.jgalgo.alg.connect.MinimumVertexCutAllGlobal: Find all the minimum vertex-cuts in a graph.
allMinimumCuts(Graph<V, E>, WeightFunction<V>, V, V) - Method in interface com.jgalgo.alg.connect.MinimumVertexCutAllSt: Compute all the minimum vertex-cuts in a graph between two terminal vertices.
allOf(Graph<V, E>) - Static method in interface com.jgalgo.graph.EdgeSet: Create an edge set object of all the edges in a graph.
allOf(IntGraph) - Static method in interface com.jgalgo.graph.IEdgeSet: Create an edge set object of all the edges in a graph.
allowParallelEdges() - Method in interface com.jgalgo.graph.GraphFactory: Change the config of this factory so that the built graphs will support parallel edges.
allowParallelEdges() - Method in interface com.jgalgo.graph.IndexGraphFactory
allowParallelEdges() - Method in interface com.jgalgo.graph.IntGraphFactory
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
allowParallelEdges(boolean) - Method in interface com.jgalgo.graph.IntGraphFactory
allowSelfEdges() - Method in interface com.jgalgo.graph.GraphFactory: Change the config of this factory so that the built graphs will support self edges.
allowSelfEdges() - Method in interface com.jgalgo.graph.IndexGraphFactory
allowSelfEdges() - Method in interface com.jgalgo.graph.IntGraphFactory
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
allowSelfEdges(boolean) - Method in interface com.jgalgo.graph.IntGraphFactory
allowsParallelEdges() - Method in class com.jgalgo.adapt.guava.GuavaNetworkAdapter
allowsSelfLoops() - Method in class com.jgalgo.adapt.guava.GuavaGraphAdapter
allowsSelfLoops() - Method in class com.jgalgo.adapt.guava.GuavaNetworkAdapter
allowsSelfLoops() - Method in class com.jgalgo.adapt.guava.GuavaValueGraphAdapter
allSimplePaths(Graph<V, E>, V, V) - Method in interface com.jgalgo.alg.shortestpath.SimplePathsEnumerator: Find all the simple paths between a source and a target vertices in the given graph.
asGraph() - Method in class com.jgalgo.adapt.guava.GuavaValueGraphAdapter
asIntGraphWeightFunc(WeightFunction<Integer>) - Static method in class com.jgalgo.graph.WeightFunctions: Treat a given weight function as a weight function on a graph with integer vertices.

B

backtrackEdge(int) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.IResult: Get the last edge on the shortest path from the source to the given target.
backtrackEdge(Integer) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.IResult: Deprecated.
Please use ShortestPathSingleSource.IResult.backtrackEdge(int) instead to avoid un/boxing.
backtrackEdge(V) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.Result: Get the last edge on the shortest path from the source to the given target.
BarabasiAlbertGraphGenerator<V,E> - Class in com.jgalgo.gen: Generates a Barabási–Albert graph.
BarabasiAlbertGraphGenerator() - Constructor for class com.jgalgo.gen.BarabasiAlbertGraphGenerator: Create a new Barabasi-Albert graph generator that will use the default graph factory.
BarabasiAlbertGraphGenerator(GraphFactory<V, E>) - Constructor for class com.jgalgo.gen.BarabasiAlbertGraphGenerator: Create a new Barabasi-Albert graph generator that will use the given graph factory.
BfsDfsExample - Class in com.jgalgo.example: This example demonstrates how to use the BFS and DFS algorithms.
bfsExample() - Static method in class com.jgalgo.example.BfsDfsExample: This example demonstrates how to use the BFS algorithm.
BfsIter<V,E> - Interface in com.jgalgo.alg.traversal: Bread first search (BFS) iterator.
BfsIter.Int - Interface in com.jgalgo.alg.traversal: A BFS iterator for IntGraph.
bfsLayers(Graph<V, E>, V) - Static method in interface com.jgalgo.alg.traversal.BfsIter: Compute all the layers of the vertices in a graph.
bfsTree(Graph<V, E>, V) - Static method in interface com.jgalgo.alg.traversal.BfsIter: Create a tree from all the vertices and edges traversed by a bread first search.
bfsTree(Graph<V, E>, V, boolean) - Static method in interface com.jgalgo.alg.traversal.BfsIter: Create a tree from all the vertices and edges traversed by a bread first search, optionally directed or undirected.
BiConnectedComponentsAlgo - Interface in com.jgalgo.alg.connect: An algorithm that compute the bi-connected components of a graph.
BiConnectedComponentsAlgo.IResult - Interface in com.jgalgo.alg.connect: A result object of a BiConnectedComponentsAlgo computation for IntGraph.
BiConnectedComponentsAlgo.Result<V,E> - Interface in com.jgalgo.alg.connect: A result object of a BiConnectedComponentsAlgo computation.
BiConnectedComponentsAlgoAbstract - Class in com.jgalgo.alg.connect: Abstract class for bi-connected components algorithms.
BiConnectedComponentsAlgoAbstract() - Constructor for class com.jgalgo.alg.connect.BiConnectedComponentsAlgoAbstract: Default constructor.
BiConnectedComponentsAlgoHopcroftTarjan - Class in com.jgalgo.alg.connect: Hopcroft-Tarjan algorithm for bi-connected components.
BiConnectedComponentsAlgoHopcroftTarjan() - Constructor for class com.jgalgo.alg.connect.BiConnectedComponentsAlgoHopcroftTarjan: Create a new instance of the algorithm.
bipartite(boolean) - Method in interface com.jgalgo.alg.match.MatchingAlgo.Builder: Set whether the matching algorithms built by this builder should only support bipartite graphs.
BipartiteGraphs - Class in com.jgalgo.alg.bipartite: Static class with functions for bipartite graphs.
blockEdges(int) - Method in interface com.jgalgo.alg.common.IVertexPartition
blockEdges(int) - Method in interface com.jgalgo.alg.common.VertexPartition: Get all the edges that are contained in a block.
blocksGraph() - Method in interface com.jgalgo.alg.common.IVertexPartition
blocksGraph() - Method in interface com.jgalgo.alg.common.VertexPartition: Create a new graph representing the edges between the blocks.
blocksGraph(boolean, boolean) - Method in interface com.jgalgo.alg.common.IVertexPartition
blocksGraph(boolean, boolean) - Method in interface com.jgalgo.alg.common.VertexPartition: Create a new graph representing the edges between the blocks.
blockSite(int) - Method in interface com.jgalgo.alg.shortestpath.VoronoiAlgo.IResult: Deprecated.
Please use VoronoiAlgo.IResult.blockSiteInt(int) instead to avoid un/boxing.
blockSite(int) - Method in interface com.jgalgo.alg.shortestpath.VoronoiAlgo.Result: Get the site vertex of a block.
blockSiteInt(int) - Method in interface com.jgalgo.alg.shortestpath.VoronoiAlgo.IResult: Get the site vertex of a block.
blockSubGraph(int) - Method in interface com.jgalgo.alg.common.IVertexPartition
blockSubGraph(int) - Method in interface com.jgalgo.alg.common.VertexPartition: Create a new graph that contains only the vertices and edges that are contained in a block.
blockSubGraph(int, boolean, boolean) - Method in interface com.jgalgo.alg.common.IVertexPartition
blockSubGraph(int, boolean, boolean) - Method in interface com.jgalgo.alg.common.VertexPartition: Create a new graph that contains only the vertices and edges that are contained in a block with option to copy weights.
blockVertices(int) - Method in interface com.jgalgo.alg.common.IVertexPartition
blockVertices(int) - Method in interface com.jgalgo.alg.common.VertexPartition: Get all the vertices that are part of a block.
build() - Method in interface com.jgalgo.alg.flow.MinimumCostFlow.Builder: Create a new algorithm object for minimum cost flow computation.
build() - Method in interface com.jgalgo.alg.match.MatchingAlgo.Builder: Create a new matching algorithm object.
build() - Method in interface com.jgalgo.alg.shortestpath.ShortestPathAllPairs.Builder: Create a new algorithm object for all pairs shortest paths computation.
build() - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.Builder: Create a new algorithm object for single source shortest path 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() - Method in interface com.jgalgo.graph.IntGraphBuilder
build(IntSet) - Method in interface com.jgalgo.graph.IdBuilderInt: Builds a unique identifier for a vertex or an edge.
build(Set<Integer>) - Method in interface com.jgalgo.graph.IdBuilderInt: Deprecated.
use IdBuilderInt.build(IntSet) instead to avoid unnecessary un/boxing
build(Set<K>) - Method in interface com.jgalgo.graph.IdBuilder: Builds a unique identifier for a vertex or an edge.
builder() - Static method in interface com.jgalgo.alg.flow.MinimumCostFlow: Create a new minimum cost flow algorithm builder.
builder() - Static method in interface com.jgalgo.alg.match.MatchingAlgo: Create a new matching algorithm builder.
builder() - Static method in interface com.jgalgo.alg.shortestpath.ShortestPathAllPairs: Create a new all pairs shortest paths algorithm builder.
builder() - Static method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource: Create a new single source shortest path algorithm builder.
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
buildMutable() - Method in interface com.jgalgo.graph.IntGraphBuilder

C

cardinality(boolean) - Method in interface com.jgalgo.alg.match.MatchingAlgo.Builder: Set whether the matching algorithms built by this builder should support only maximum cardinality matching.
cardinality(boolean) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathAllPairs.Builder: Enable/disable the support for cardinality shortest paths only.
cardinality(boolean) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.Builder: Enable/disable the support for cardinality shortest paths only.
cardinalityWeightFunction() - Static method in interface com.jgalgo.graph.WeightFunction: Get the cardinality weight function.
CardinalityWeightFunction - Static variable in interface com.jgalgo.graph.IWeightFunction: A weight function that assign a weight of 1 to any element.
CardinalityWeightFunction - Static variable in interface com.jgalgo.graph.WeightFunction: A weight function that assign a weight of 1 to any element.
center() - Method in interface com.jgalgo.alg.distancemeasures.DistanceMeasures: Get the center of the graph.
center() - Method in interface com.jgalgo.alg.distancemeasures.IDistanceMeasures
ChinesePostman - Interface in com.jgalgo.alg.cycle: An algorithm for the chinese postman problem.
ChinesePostmanAbstract - Class in com.jgalgo.alg.cycle: Abstract class for computing a shortest edge visitor circle in a graph.
ChinesePostmanAbstract() - Constructor for class com.jgalgo.alg.cycle.ChinesePostmanAbstract: Default constructor.
ChinesePostmanImpl - Class in com.jgalgo.alg.cycle: An algorithm for the chinese postman problem using minimum weighted perfect matching and Eulerian tour.
ChinesePostmanImpl() - Constructor for class com.jgalgo.alg.cycle.ChinesePostmanImpl: Create a new instance of the Chinese postman algorithm.
clear() - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
clear() - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
clear() - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorDynamic: Clear the data structure by removing all vertices in the tree.
clear() - Method in class com.jgalgo.alg.tree.LowestCommonAncestorDynamicGabowInts
clear() - Method in class com.jgalgo.alg.tree.LowestCommonAncestorDynamicGabowLongs
clear() - Method in class com.jgalgo.alg.tree.LowestCommonAncestorDynamicGabowSimple
clear() - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorOffline.Queries: Clear the container from all existing queries.
clear() - Method in interface com.jgalgo.alg.tree.TreePathMaxima.Queries: Clear the container from all existing queries.
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.IndexGraph: Clear the graph completely by removing all vertices and edges.
clearEdges() - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
clearEdges() - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
clearEdges() - Method in interface com.jgalgo.graph.Graph: Remove all the edges from the graph.
clearEdges() - Method in interface com.jgalgo.graph.IndexGraph: Remove all the edges from the graph.
ClosuresEnumerator - Interface in com.jgalgo.alg.closure: An algorithm that enumerate all the closure subsets in a directed graph.
ClosuresEnumeratorAbstract - Class in com.jgalgo.alg.closure: Abstract class for enumerating over all the closure subsets in a directed graph.
ClosuresEnumeratorAbstract() - Constructor for class com.jgalgo.alg.closure.ClosuresEnumeratorAbstract: Default constructor.
ClosuresEnumeratorSchrageBaker - Class in com.jgalgo.alg.closure: Schrage-Baker algorithm for enumerating all the closure subsets in a directed graph.
ClosuresEnumeratorSchrageBaker() - Constructor for class com.jgalgo.alg.closure.ClosuresEnumeratorSchrageBaker: Constructs a new instance of the algorithm.
closuresIter(Graph<V, E>) - Method in interface com.jgalgo.alg.closure.ClosuresEnumerator: Iterate over all closures in the given graph.
closuresIter(Graph<V, E>) - Method in class com.jgalgo.alg.closure.ClosuresEnumeratorAbstract
ColoringAlgo - Interface in com.jgalgo.alg.color: An algorithm that assign a color to each vertex in a graph such that the endpoints of each edge have different colors.
ColoringAlgoAbstract - Class in com.jgalgo.alg.color: Abstract class for coloring algorithms.
ColoringAlgoAbstract() - Constructor for class com.jgalgo.alg.color.ColoringAlgoAbstract: Default constructor.
ColoringDSatur - Class in com.jgalgo.alg.color: The D-Satur coloring algorithm.
ColoringDSatur() - Constructor for class com.jgalgo.alg.color.ColoringDSatur: Create a new coloring algorithm object.
coloringExample() - Static method in class com.jgalgo.example.ColoringExample: This example demonstrates how to use the coloring algorithm.
ColoringExample - Class in com.jgalgo.example: This example demonstrates how to use the coloring algorithm.
ColoringGreedy - Class in com.jgalgo.alg.color: A greedy coloring algorithm with random vertices order.
ColoringGreedy() - Constructor for class com.jgalgo.alg.color.ColoringGreedy: Create a new coloring algorithm object.
ColoringRecursiveLargestFirst - Class in com.jgalgo.alg.color: The Recursive Largest First coloring algorithm.
ColoringRecursiveLargestFirst() - Constructor for class com.jgalgo.alg.color.ColoringRecursiveLargestFirst: Create a new coloring algorithm object.
com.jgalgo - package com.jgalgo: Parent package for all modules of the JGAlgo library.
com.jgalgo.adapt.guava - package com.jgalgo.adapt.guava: Adapters from Guava to JGalgo, and from JGalgo to Guava.
com.jgalgo.adapt.jgrapht - package com.jgalgo.adapt.jgrapht: Adapters from JGraphT to JGalgo, and from JGalgo to JGraphT.
com.jgalgo.alg.bipartite - package com.jgalgo.alg.bipartite: Algorithms for solving bipartite graph problems.
com.jgalgo.alg.clique - package com.jgalgo.alg.clique: Algorithms for solving cliques and independent sets problems.
com.jgalgo.alg.closure - package com.jgalgo.alg.closure: Algorithms for findings closures in graphs.
com.jgalgo.alg.color - package com.jgalgo.alg.color: Algorithms for solving graph coloring problems.
com.jgalgo.alg.common - package com.jgalgo.alg.common: Package for common classes and interfaces used by the algorithms in the JGAlgo library.
com.jgalgo.alg.connect - package com.jgalgo.alg.connect: Algorithms for solving connectivity problems, such as strongly/weakly connected components, minimum edge/vertex cuts, ect.
com.jgalgo.alg.cores - package com.jgalgo.alg.cores: Algorithms for computing the cores of graphs.
com.jgalgo.alg.cover - package com.jgalgo.alg.cover: Algorithms for solving set cover problems, such as minimum vertex/edge cover, dominating set, etc.
com.jgalgo.alg.cycle - package com.jgalgo.alg.cycle: Algorithms solving cycles related problems, such as iterating over cycles in a graph, findings a cycle with the minimum mean edge weight, etc.
com.jgalgo.alg.dag - package com.jgalgo.alg.dag: Algorithms specifically designed for directed acyclic graphs (DAGs).
com.jgalgo.alg.distancemeasures - package com.jgalgo.alg.distancemeasures: Algorithms for computing the distance measures properties in graphs, such as the the diameter, the radius, the eccentricity, the center, ect.
com.jgalgo.alg.euler - package com.jgalgo.alg.euler: Algorithms for finding Eulerian paths and cycles in graphs.
com.jgalgo.alg.flow - package com.jgalgo.alg.flow: Algorithms for solving flow problems in graphs, such as maximum flow, min cost flow, and circulation problems.
com.jgalgo.alg.hamilton - package com.jgalgo.alg.hamilton: Algorithms for solving Hamiltonian path problems.
com.jgalgo.alg.isomorphism - package com.jgalgo.alg.isomorphism: Algorithms for determining isomorphism between graphs.
com.jgalgo.alg.match - package com.jgalgo.alg.match: Algorithms for computing matchings in graphs, such as maximum/minimum weight matchings, maximum cardinality matchings, perfect matchings, ect.
com.jgalgo.alg.shortestpath - package com.jgalgo.alg.shortestpath: Algorithms for finding paths in graphs, such as shortest paths, iterating over all simple paths between two vertices, computing the Voronoi cells given a set of sites, ect.
com.jgalgo.alg.span - package com.jgalgo.alg.span: Algorithms for finding the minimum spanning trees and Steiner trees of graphs.
com.jgalgo.alg.traversal - package com.jgalgo.alg.traversal: Algorithms for traversing graphs, such as depth-first search and breadth-first search.
com.jgalgo.alg.tree - package com.jgalgo.alg.tree: Algorithms specifically for tree graphs, such as LCA or TPM.
com.jgalgo.example - package com.jgalgo.example: Simple examples using the basics of com.jgalgo.graph and algorithms.
com.jgalgo.gen - package com.jgalgo.gen: Graph generators used to generate (possibly random) graphs with different distributions and structures.
com.jgalgo.graph - package com.jgalgo.graph: Graphs object are the fundamental building blocks of the JGAlgo library.
com.jgalgo.io - package com.jgalgo.io: The I/O classes provide varies ways to read/write graphs from/to files.
commonVertexWeights(String) - Method in class com.jgalgo.gen.LineGraphGenerator: Set the weights key that will store the common vertex between two edges.
compare(int, int) - Method in interface com.jgalgo.graph.IWeightFunction: Compare two elements by their weights.
compare(int, int) - Method in interface com.jgalgo.graph.IWeightFunctionInt
compare(Integer, Integer) - Method in interface com.jgalgo.graph.IWeightFunction: Deprecated.
Please use IWeightFunction.compare(int, int) instead to avoid un/boxing.
compare(Integer, Integer) - Method in interface com.jgalgo.graph.IWeightFunctionInt: Deprecated.
Please use IWeightFunctionInt.compare(int, int) instead to avoid un/boxing.
compare(Integer, Integer) - Method in interface com.jgalgo.graph.IWeightsByte: Deprecated.
compare(Integer, Integer) - Method in interface com.jgalgo.graph.IWeightsDouble: Deprecated.
compare(Integer, Integer) - Method in interface com.jgalgo.graph.IWeightsFloat: Deprecated.
compare(Integer, Integer) - Method in interface com.jgalgo.graph.IWeightsInt: Deprecated.
compare(Integer, Integer) - Method in interface com.jgalgo.graph.IWeightsLong: Deprecated.
compare(Integer, Integer) - Method in interface com.jgalgo.graph.IWeightsShort: Deprecated.
compare(K, K) - Method in interface com.jgalgo.graph.WeightFunction: Compare two elements by their weights.
compare(K, K) - Method in interface com.jgalgo.graph.WeightFunctionInt
ComplementGraphGenerator<V,E> - Class in com.jgalgo.gen: Generates the complement graph of a given graph.
ComplementGraphGenerator() - Constructor for class com.jgalgo.gen.ComplementGraphGenerator: Create a new complement graph generator that will use the default graph factory.
ComplementGraphGenerator(GraphFactory<V, E>) - Constructor for class com.jgalgo.gen.ComplementGraphGenerator: Create a new complement graph generator that will use the given graph factory.
CompleteBipartiteGraphGenerator<V,E> - Class in com.jgalgo.gen: Generates a complete bipartite graph.
CompleteBipartiteGraphGenerator() - Constructor for class com.jgalgo.gen.CompleteBipartiteGraphGenerator: Create a new complete bipartite graph generator that will use the default graph factory.
CompleteBipartiteGraphGenerator(GraphFactory<V, E>) - Constructor for class com.jgalgo.gen.CompleteBipartiteGraphGenerator: Create a new complete bipartite graph generator that will use the given graph factory.
CompleteGraphGenerator<V,E> - Class in com.jgalgo.gen: Generates a complete graph.
CompleteGraphGenerator() - Constructor for class com.jgalgo.gen.CompleteGraphGenerator: Create a new complete graph generator that will use the default graph factory.
CompleteGraphGenerator(GraphFactory<V, E>) - Constructor for class com.jgalgo.gen.CompleteGraphGenerator: Create a new complete graph generator that will use the given graph factory.
computeAllShortestPaths(Graph<V, E>, WeightFunction<E>) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathAllPairs: Compute the shortest path between each pair of vertices in a graph.
computeAllShortestPaths(Graph<V, E>, WeightFunction<E>) - Method in class com.jgalgo.alg.shortestpath.ShortestPathAllPairsAbstract
computeColoring(Graph<V, E>) - Method in interface com.jgalgo.alg.color.ColoringAlgo: Assign a color to each vertex of the given graph, while minimizing the number of different colors.
computeColoring(Graph<V, E>) - Method in class com.jgalgo.alg.color.ColoringAlgoAbstract
computeCores(Graph<V, E>) - Method in interface com.jgalgo.alg.cores.CoresAlgo: Compute the cores of the graph with respect to both in and out degree of the vertices.
computeCores(Graph<V, E>, EdgeDirection) - Method in interface com.jgalgo.alg.cores.CoresAlgo: Compute the cores of the graph with respect the given degree type.
computeCores(Graph<V, E>, EdgeDirection) - Method in class com.jgalgo.alg.cores.CoresAlgoAbstract
computeEulerianTour(Graph<V, E>) - Method in interface com.jgalgo.alg.euler.EulerianTourAlgo: Compute an Eulerian tour in the graph that visit all edges exactly once.
computeEulerianTourIfExist(Graph<V, E>) - Method in interface com.jgalgo.alg.euler.EulerianTourAlgo: Compute an Eulerian tour in the graph that visit all edges exactly once if one exists.
computeHeaviestEdgeInTreePaths(Graph<V, E>, WeightFunction<E>, TreePathMaxima.Queries<V, E>) - Method in interface com.jgalgo.alg.tree.TreePathMaxima: Compute the heaviest edge in multiple tree paths.
computeHeaviestEdgeInTreePaths(Graph<V, E>, WeightFunction<E>, TreePathMaxima.Queries<V, E>) - Method in class com.jgalgo.alg.tree.TreePathMaximaAbstract
computeKEdgeConnectedComponents(Graph<V, E>, int) - Method in interface com.jgalgo.alg.connect.KEdgeConnectedComponentsAlgo: Compute the k-edge connected components of a graph.
computeKEdgeConnectedComponents(Graph<V, E>, int) - Method in class com.jgalgo.alg.connect.KEdgeConnectedComponentsAlgoAbstract
computeKShortestPaths(Graph<V, E>, WeightFunction<E>, V, V, int) - Method in interface com.jgalgo.alg.shortestpath.KShortestPathsSt: Compute the K shortest paths from a source vertex to a target vertex.
computeKShortestPaths(Graph<V, E>, WeightFunction<E>, V, V, int) - Method in class com.jgalgo.alg.shortestpath.KShortestPathsStAbstract
computeMaximumFlow(Graph<V, E>, WeightFunction<E>, Collection<V>, Collection<V>) - Method in interface com.jgalgo.alg.flow.MaximumFlow: Calculate the maximum flow in a network between a set of sources and a set of sinks.
computeMaximumFlow(Graph<V, E>, WeightFunction<E>, Collection<V>, Collection<V>) - Method in class com.jgalgo.alg.flow.MaximumFlowAbstract
computeMaximumFlow(Graph<V, E>, WeightFunction<E>, V, V) - Method in interface com.jgalgo.alg.flow.MaximumFlow: Calculate the maximum flow in a network between a source and a sink.
computeMaximumFlow(Graph<V, E>, WeightFunction<E>, V, V) - Method in class com.jgalgo.alg.flow.MaximumFlowAbstract
computeMaximumMatching(Graph<V, E>, WeightFunction<E>) - Method in interface com.jgalgo.alg.match.MatchingAlgo: Compute the maximum weighted matching of a weighted undirected graph.
computeMaximumMatching(Graph<V, E>, WeightFunction<E>) - Method in class com.jgalgo.alg.match.MatchingAlgoAbstract
computeMaximumPerfectMatching(Graph<V, E>, WeightFunction<E>) - Method in interface com.jgalgo.alg.match.MatchingAlgo: Compute the maximum perfect matching of a weighted undirected graph.
computeMaximumPerfectMatching(Graph<V, E>, WeightFunction<E>) - Method in class com.jgalgo.alg.match.MatchingAlgoAbstract
computeMinCostFlow(Graph<V, E>, WeightFunction<E>, WeightFunction<E>, WeightFunction<E>, WeightFunction<V>) - Method in interface com.jgalgo.alg.flow.MinimumCostFlow: Compute the min-cost (not maximum!)
computeMinCostFlow(Graph<V, E>, WeightFunction<E>, WeightFunction<E>, WeightFunction<E>, WeightFunction<V>) - Method in class com.jgalgo.alg.flow.MinimumCostFlowAbstract
computeMinCostFlow(Graph<V, E>, WeightFunction<E>, WeightFunction<E>, WeightFunction<V>) - Method in interface com.jgalgo.alg.flow.MinimumCostFlow: Compute the min-cost (not maximum!)
computeMinCostFlow(Graph<V, E>, WeightFunction<E>, WeightFunction<E>, WeightFunction<V>) - Method in class com.jgalgo.alg.flow.MinimumCostFlowAbstract
computeMinCostMaxFlow(Graph<V, E>, WeightFunction<E>, WeightFunction<E>, WeightFunction<E>, Collection<V>, Collection<V>) - Method in interface com.jgalgo.alg.flow.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<V, E>, WeightFunction<E>, WeightFunction<E>, WeightFunction<E>, Collection<V>, Collection<V>) - Method in class com.jgalgo.alg.flow.MinimumCostFlowAbstract
computeMinCostMaxFlow(Graph<V, E>, WeightFunction<E>, WeightFunction<E>, WeightFunction<E>, V, V) - Method in interface com.jgalgo.alg.flow.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<V, E>, WeightFunction<E>, WeightFunction<E>, WeightFunction<E>, V, V) - Method in class com.jgalgo.alg.flow.MinimumCostFlowAbstract
computeMinCostMaxFlow(Graph<V, E>, WeightFunction<E>, WeightFunction<E>, Collection<V>, Collection<V>) - Method in interface com.jgalgo.alg.flow.MinimumCostFlow: Compute the min-cost max-flow in a network between a set of sources and a set of sinks.
computeMinCostMaxFlow(Graph<V, E>, WeightFunction<E>, WeightFunction<E>, Collection<V>, Collection<V>) - Method in class com.jgalgo.alg.flow.MinimumCostFlowAbstract
computeMinCostMaxFlow(Graph<V, E>, WeightFunction<E>, WeightFunction<E>, V, V) - Method in interface com.jgalgo.alg.flow.MinimumCostFlow: Compute the min-cost max-flow in a network between a source and a sink.
computeMinCostMaxFlow(Graph<V, E>, WeightFunction<E>, WeightFunction<E>, V, V) - Method in class com.jgalgo.alg.flow.MinimumCostFlowAbstract
computeMinimumCut(Graph<V, E>, WeightFunction<E>) - Method in interface com.jgalgo.alg.connect.MinimumEdgeCutGlobal: Compute the global minimum edge-cut in a graph.
computeMinimumCut(Graph<V, E>, WeightFunction<E>) - Method in class com.jgalgo.alg.connect.MinimumEdgeCutGlobalAbstract
computeMinimumCut(Graph<V, E>, WeightFunction<E>, Collection<V>, Collection<V>) - Method in interface com.jgalgo.alg.connect.MinimumEdgeCutSt: Compute the minimum edge-cut in a graph between two sets of vertices.
computeMinimumCut(Graph<V, E>, WeightFunction<E>, Collection<V>, Collection<V>) - Method in class com.jgalgo.alg.connect.MinimumEdgeCutStAbstract
computeMinimumCut(Graph<V, E>, WeightFunction<E>, V, V) - Method in interface com.jgalgo.alg.connect.MinimumEdgeCutSt: Compute the minimum edge-cut in a graph between two terminal vertices.
computeMinimumCut(Graph<V, E>, WeightFunction<E>, V, V) - Method in class com.jgalgo.alg.connect.MinimumEdgeCutStAbstract
computeMinimumCut(Graph<V, E>, WeightFunction<V>) - Method in interface com.jgalgo.alg.connect.MinimumVertexCutGlobal: Compute the global minimum vertex-cut in a graph.
computeMinimumCut(Graph<V, E>, WeightFunction<V>) - Method in class com.jgalgo.alg.connect.MinimumVertexCutGlobalAbstract
computeMinimumCut(Graph<V, E>, WeightFunction<V>, V, V) - Method in interface com.jgalgo.alg.connect.MinimumVertexCutSt: Compute the minimum vertex-cut in a graph between two terminal vertices.
computeMinimumCut(Graph<V, E>, WeightFunction<V>, V, V) - Method in class com.jgalgo.alg.connect.MinimumVertexCutStAbstract
computeMinimumCut(IndexGraph, IWeightFunction, int, int) - Method in class com.jgalgo.alg.flow.MaximumFlowPushRelabel
computeMinimumDirectedSpanningTree(Graph<V, E>, WeightFunction<E>, V) - Method in interface com.jgalgo.alg.span.MinimumDirectedSpanningTree: Compute a minimum directed spanning tree (MDST) in a directed graph, rooted at the given vertex.
computeMinimumDirectedSpanningTree(Graph<V, E>, WeightFunction<E>, V) - Method in class com.jgalgo.alg.span.MinimumDirectedSpanningTreeAbstract
computeMinimumDominationSet(Graph<V, E>, WeightFunction<V>) - Method in interface com.jgalgo.alg.cover.DominatingSetAlgo: Compute a minimum dominating set of the graph with respect to the in-degree + out-degree of the vertices.
computeMinimumDominationSet(Graph<V, E>, WeightFunction<V>, EdgeDirection) - Method in interface com.jgalgo.alg.cover.DominatingSetAlgo: Compute a minimum dominating set of the graph with respect to the given edges direction.
computeMinimumDominationSet(Graph<V, E>, WeightFunction<V>, EdgeDirection) - Method in class com.jgalgo.alg.cover.DominatingSetAlgoAbstract
computeMinimumEdgeCover(Graph<V, E>, WeightFunction<E>) - Method in interface com.jgalgo.alg.cover.EdgeCover: Compute a minimum edge cover of a graph with respect to an edge weight function.
computeMinimumEdgeCover(Graph<V, E>, WeightFunction<E>) - Method in class com.jgalgo.alg.cover.EdgeCoverAbstract
computeMinimumMatching(Graph<V, E>, WeightFunction<E>) - Method in interface com.jgalgo.alg.match.MatchingAlgo: Compute the minimum weighted matching of a weighted undirected graph.
computeMinimumMatching(Graph<V, E>, WeightFunction<E>) - Method in class com.jgalgo.alg.match.MatchingAlgoAbstract
computeMinimumMeanCycle(Graph<V, E>, WeightFunction<E>) - Method in interface com.jgalgo.alg.cycle.MinimumMeanCycle: Compute the minimum mean cycle in a graph.
computeMinimumMeanCycle(Graph<V, E>, WeightFunction<E>) - Method in class com.jgalgo.alg.cycle.MinimumMeanCycleAbstract
computeMinimumPerfectMatching(Graph<V, E>, WeightFunction<E>) - Method in interface com.jgalgo.alg.match.MatchingAlgo: Compute the minimum perfect matching of a weighted undirected graph.
computeMinimumPerfectMatching(Graph<V, E>, WeightFunction<E>) - Method in class com.jgalgo.alg.match.MatchingAlgoAbstract
computeMinimumSpanningTree(Graph<V, E>, WeightFunction<E>) - Method in interface com.jgalgo.alg.span.MinimumSpanningTree: Compute the minimum spanning tree (MST) of a given graph.
computeMinimumSpanningTree(Graph<V, E>, WeightFunction<E>) - Method in class com.jgalgo.alg.span.MinimumSpanningTreeAbstract
computeMinimumVertexCover(Graph<V, E>, WeightFunction<V>) - Method in interface com.jgalgo.alg.cover.VertexCover: Compute a minimum vertex cover of a graph with respect to a vertex weight function.
computeMinimumVertexCover(Graph<V, E>, WeightFunction<V>) - Method in class com.jgalgo.alg.cover.VertexCoverAbstract
computeShortestEdgeVisitorCircle(Graph<V, E>, WeightFunction<E>) - Method in interface com.jgalgo.alg.cycle.ChinesePostman: Compute the shortest circuit that visits all edges in the graph at least once.
computeShortestEdgeVisitorCircleIfExist(Graph<V, E>, WeightFunction<E>) - Method in interface com.jgalgo.alg.cycle.ChinesePostman: Compute the shortest circuit that visits all edges in the graph at least once, if it exist.
computeShortestEdgeVisitorCircleIfExist(Graph<V, E>, WeightFunction<E>) - Method in class com.jgalgo.alg.cycle.ChinesePostmanAbstract
computeShortestPath(Graph<V, E>, WeightFunction<E>, V, V) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSt: Compute the shortest path from a source vertex to a target vertex.
computeShortestPath(Graph<V, E>, WeightFunction<E>, V, V, ToDoubleFunction<V>) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathHeuristicSt: Compute the shortest path between two vertices in a graph.
computeShortestPath(Graph<V, E>, WeightFunction<E>, V, V, ToDoubleFunction<V>) - Method in class com.jgalgo.alg.shortestpath.ShortestPathHeuristicStAbstract
computeShortestPath(IntGraph, IWeightFunction, int, int, IntToDoubleFunction) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathHeuristicSt: Compute the shortest path between two vertices in an int graph.
computeShortestPath(IntGraph, IWeightFunction, int, int, IntToDoubleFunction) - Method in class com.jgalgo.alg.shortestpath.ShortestPathHeuristicStAbstract
computeShortestPathAndWeight(Graph<V, E>, WeightFunction<E>, V, V) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSt: Compute the shortest path from a source vertex to a target vertex, and its weight.
computeShortestPathAndWeight(Graph<V, E>, WeightFunction<E>, V, V) - Method in class com.jgalgo.alg.shortestpath.ShortestPathStAbstract
computeShortestPaths(Graph<V, E>, WeightFunction<E>, V) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource: Compute the shortest paths from a source to any other vertex in a graph.
computeShortestPaths(Graph<V, E>, WeightFunction<E>, V) - Method in class com.jgalgo.alg.shortestpath.ShortestPathSingleSourceAbstract
computeShortestTour(Graph<V, E>, WeightFunction<E>) - Method in interface com.jgalgo.alg.shortestpath.Tsp: Compute the shortest tour that visit all vertices.
computeShortestTour(Graph<V, E>, WeightFunction<E>) - Method in class com.jgalgo.alg.shortestpath.TspAbstract
computeSteinerTree(Graph<V, E>, WeightFunction<E>, Collection<V>) - Method in interface com.jgalgo.alg.span.SteinerTreeAlgo: Compute the minimum Steiner tree of a given graph.
computeSteinerTree(Graph<V, E>, WeightFunction<E>, Collection<V>) - Method in class com.jgalgo.alg.span.SteinerTreeAlgoAbstract
computeSteinerTree(IndexGraph, IWeightFunction, IntCollection) - Method in class com.jgalgo.alg.span.SteinerTreeMehlhorn
computeSubsetShortestPaths(Graph<V, E>, Collection<V>, WeightFunction<E>) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathAllPairs: Compute the shortest path between each pair of vertices in a given subset of the vertices of the graph.
computeSubsetShortestPaths(Graph<V, E>, Collection<V>, WeightFunction<E>) - Method in class com.jgalgo.alg.shortestpath.ShortestPathAllPairsAbstract
computeTopologicalSorting(Graph<V, E>) - Method in interface com.jgalgo.alg.dag.TopologicalOrderAlgo: Compute the topological order of the vertices in a DAG graph.
computeTopologicalSortingIfExist(Graph<V, E>) - Method in interface com.jgalgo.alg.dag.TopologicalOrderAlgo: Compute the topological order of the vertices, if the graph is DAG.
computeTopologicalSortingIfExist(Graph<V, E>) - Method in class com.jgalgo.alg.dag.TopologicalOrderAlgoAbstract
computeVoronoiCells(Graph<V, E>, Collection<V>, WeightFunction<E>) - Method in interface com.jgalgo.alg.shortestpath.VoronoiAlgo: Compute the Voronoi cells of a graph with respect to a set of sites and an edge weight function.
computeVoronoiCells(Graph<V, E>, Collection<V>, WeightFunction<E>) - Method in class com.jgalgo.alg.shortestpath.VoronoiAlgoAbstract
containsEdge(int) - Method in interface com.jgalgo.alg.match.IMatching: Check whether an edge is part of the matching.
containsEdge(int, int) - Method in interface com.jgalgo.graph.IntGraph: Check whether the graph contains an edge with the given source and target.
containsEdge(E) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
containsEdge(E) - Method in interface com.jgalgo.alg.match.Matching: Check whether an edge is part of the matching.
containsEdge(Integer) - Method in interface com.jgalgo.alg.match.IMatching: Deprecated.
Please use IMatching.containsEdge(int) instead to avoid un/boxing.
containsEdge(Integer, Integer) - Method in interface com.jgalgo.graph.IntGraph: Deprecated.
containsEdge(V, V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
containsEdge(V, V) - Method in interface com.jgalgo.graph.Graph: Check whether the graph contains an edge with the given source and target.
containsParallelEdges(Graph<V, E>) - Static method in class com.jgalgo.graph.Graphs: Check whether a graph contain parallel edges.
containsVertex(V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
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() - Method in interface com.jgalgo.graph.IntGraph
copy(boolean, 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, boolean) - Method in interface com.jgalgo.graph.IndexGraph
copy(boolean, boolean) - Method in interface com.jgalgo.graph.IntGraph
copyWeights(boolean, boolean) - Method in class com.jgalgo.gen.UnionGraphGenerator: Determine if the vertices/edges weights will be copied from the input graphs to the generated graph(s).
coreCrust(int) - Method in interface com.jgalgo.alg.cores.CoresAlgo.IResult
coreCrust(int) - Method in interface com.jgalgo.alg.cores.CoresAlgo.Result: The vertices in the crust of the given core.
CoresAlgo - Interface in com.jgalgo.alg.cores: Cores computing algorithm.
CoresAlgo.IResult - Interface in com.jgalgo.alg.cores: The result of the cores computation for IntGraph.
CoresAlgo.Result<V,E> - Interface in com.jgalgo.alg.cores: The result of the cores computation.
CoresAlgoAbstract - Class in com.jgalgo.alg.cores: Abstract class for computing the cores of a graph.
CoresAlgoAbstract() - Constructor for class com.jgalgo.alg.cores.CoresAlgoAbstract: Default constructor.
CoresAlgoImpl - Class in com.jgalgo.alg.cores: Linear cores computing algorithm.
CoresAlgoImpl() - Constructor for class com.jgalgo.alg.cores.CoresAlgoImpl: Create a new cores computing algorithm object.
coreShell(int) - Method in interface com.jgalgo.alg.cores.CoresAlgo.IResult
coreShell(int) - Method in interface com.jgalgo.alg.cores.CoresAlgo.Result: The vertices in the shell of the given core.
coreVertices(int) - Method in interface com.jgalgo.alg.cores.CoresAlgo.IResult
coreVertices(int) - Method in interface com.jgalgo.alg.cores.CoresAlgo.Result: The vertices of the given core.
createExternalEdgesWeights(Graph<?, E>, Class<? super T>) - Static method in interface com.jgalgo.graph.Weights: Create an external edge weights container.
createExternalEdgesWeights(Graph<?, E>, Class<? super T>, T) - Static method in interface com.jgalgo.graph.Weights: Create an external edge weights container with default values.
createExternalEdgesWeights(IntGraph, Class<? super T>) - Static method in interface com.jgalgo.graph.IWeights: Create an external edge weights container.
createExternalEdgesWeights(IntGraph, Class<? super T>, T) - Static method in interface com.jgalgo.graph.IWeights: Create an external edge weights container with default values.
createExternalVerticesWeights(Graph<V, ?>, Class<? super T>) - Static method in interface com.jgalgo.graph.Weights: Create an external vertex weights container.
createExternalVerticesWeights(Graph<V, ?>, Class<? super T>, T) - Static method in interface com.jgalgo.graph.Weights: Create an external vertex weights container with default values.
createExternalVerticesWeights(IntGraph, Class<? super T>) - Static method in interface com.jgalgo.graph.IWeights: Create an external vertex weights container.
createExternalVerticesWeights(IntGraph, Class<? super T>, T) - Static method in interface com.jgalgo.graph.IWeights: Create an external vertex weights container with default values.
crossEdges() - Method in interface com.jgalgo.alg.common.IVertexBiPartition
crossEdges() - Method in interface com.jgalgo.alg.common.VertexBiPartition: Get the edges that cross between the left and right blocks.
crossEdges(int, int) - Method in interface com.jgalgo.alg.common.IVertexPartition
crossEdges(int, int) - Method in interface com.jgalgo.alg.common.VertexPartition: Get all the edges that cross between two different blocks.
cycle() - Method in exception com.jgalgo.alg.shortestpath.NegativeCycleException: Get the negative cycle that was found in the graph.
cycle(Graph<V, E>) - Method in exception com.jgalgo.alg.shortestpath.NegativeCycleException: Get the negative cycle that was found in the graph in type generic safe way.
CyclesEnumerator - Interface in com.jgalgo.alg.cycle: An algorithm that enumerate all cycles in a graph.
CyclesEnumeratorAbstract - Class in com.jgalgo.alg.cycle: Abstract class for enumerating all simple cycles in a graph.
CyclesEnumeratorAbstract() - Constructor for class com.jgalgo.alg.cycle.CyclesEnumeratorAbstract: Default constructor.
CyclesEnumeratorJohnson - Class in com.jgalgo.alg.cycle: Johnson's algorithm for finding all cycles in a directed graph.
CyclesEnumeratorJohnson() - Constructor for class com.jgalgo.alg.cycle.CyclesEnumeratorJohnson: Create a new cycles finder algorithm object.
CyclesEnumeratorTarjan - Class in com.jgalgo.alg.cycle: Tarjan's algorithm for enumeration all cycles in a directed graph.
CyclesEnumeratorTarjan() - Constructor for class com.jgalgo.alg.cycle.CyclesEnumeratorTarjan: Create a new cycles enumeration algorithm object.
cyclesIter(Graph<V, E>) - Method in interface com.jgalgo.alg.cycle.CyclesEnumerator: Iterate over all cycles in the given graph.
cyclesIter(Graph<V, E>) - Method in class com.jgalgo.alg.cycle.CyclesEnumeratorAbstract

D

dag(boolean) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.Builder: Enable/disable the support for directed acyclic graphs (DAG) only.
defaultBuilder() - Static method in interface com.jgalgo.graph.IdBuilderInt: Get an default builder for int identifiers.
defaultBuilder(Class<K>) - Static method in interface com.jgalgo.graph.IdBuilder: Get an default builder for identifiers of the given type.
defaultFactory() - Static method in interface com.jgalgo.graph.IdBuilderInt: Get an default factory for int identifiers.
defaultFactory(Class<K>) - Static method in interface com.jgalgo.graph.IdBuilder: Get an default factory for identifiers of the given type.
defaultWeight() - Method in interface com.jgalgo.graph.WeightsBool: Get the default weight of this weights container.
defaultWeight() - Method in interface com.jgalgo.graph.WeightsByte: Get the default weight of this weights container.
defaultWeight() - Method in interface com.jgalgo.graph.WeightsChar: Get the default weight of this weights container.
defaultWeight() - Method in interface com.jgalgo.graph.WeightsDouble: Get the default weight of this weights container.
defaultWeight() - Method in interface com.jgalgo.graph.WeightsFloat: Get the default weight of this weights container.
defaultWeight() - Method in interface com.jgalgo.graph.WeightsInt: Get the default weight of this weights container.
defaultWeight() - Method in interface com.jgalgo.graph.WeightsLong: Get the default weight of this weights container.
defaultWeight() - Method in interface com.jgalgo.graph.WeightsObj: Get the default weight of this weights container.
defaultWeight() - Method in interface com.jgalgo.graph.WeightsShort: Get the default weight of this weights container.
defaultWeightAsObj() - Method in interface com.jgalgo.graph.Weights: Get the default weight of this weights container.
defaultWeightAsObj() - Method in interface com.jgalgo.graph.WeightsBool: Deprecated.
Please use WeightsBool.defaultWeight() instead to avoid un/boxing.
defaultWeightAsObj() - Method in interface com.jgalgo.graph.WeightsByte: Deprecated.
Please use WeightsByte.defaultWeight() instead to avoid un/boxing.
defaultWeightAsObj() - Method in interface com.jgalgo.graph.WeightsChar: Deprecated.
Please use WeightsChar.defaultWeight() instead to avoid un/boxing.
defaultWeightAsObj() - Method in interface com.jgalgo.graph.WeightsDouble: Deprecated.
Please use WeightsDouble.defaultWeight() instead to avoid un/boxing.
defaultWeightAsObj() - Method in interface com.jgalgo.graph.WeightsFloat: Deprecated.
Please use WeightsFloat.defaultWeight() instead to avoid un/boxing.
defaultWeightAsObj() - Method in interface com.jgalgo.graph.WeightsInt: Deprecated.
Please use WeightsInt.defaultWeight() instead to avoid un/boxing.
defaultWeightAsObj() - Method in interface com.jgalgo.graph.WeightsLong: Deprecated.
Please use WeightsLong.defaultWeight() instead to avoid un/boxing.
defaultWeightAsObj() - Method in interface com.jgalgo.graph.WeightsObj: Deprecated.
Please use WeightsObj.defaultWeight() instead to avoid un/boxing.
defaultWeightAsObj() - Method in interface com.jgalgo.graph.WeightsShort: Deprecated.
Please use WeightsShort.defaultWeight() instead to avoid un/boxing.
degree(V) - Method in class com.jgalgo.adapt.guava.GuavaGraphAdapter
degree(V) - Method in class com.jgalgo.adapt.guava.GuavaValueGraphAdapter
degreeOf(V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
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: This example demonstrates how to use the DFS algorithm.
DfsIter<V,E> - Interface in com.jgalgo.alg.traversal: Depth first search (DFS) iterators static class.
DfsIter.Int - Interface in com.jgalgo.alg.traversal: A DFS iterator for IntGraph.
dfsTree(Graph<V, E>, V) - Static method in interface com.jgalgo.alg.traversal.DfsIter: Create a tree from all the vertices and edges traversed by a depth first search.
dfsTree(Graph<V, E>, V, boolean) - Static method in interface com.jgalgo.alg.traversal.DfsIter: Create a tree from all the vertices and edges traversed by a depth first search, optionally directed or undirected.
diameter() - Method in interface com.jgalgo.alg.distancemeasures.DistanceMeasures: Get the diameter of the graph.
DifferenceGraphGenerator<V,E> - Class in com.jgalgo.gen: Generate a graph that contains the edges that exist in one graph but not in the other.
DifferenceGraphGenerator() - Constructor for class com.jgalgo.gen.DifferenceGraphGenerator: Create a new difference graph generator that will use the default graph factory.
DifferenceGraphGenerator(GraphFactory<V, E>) - Constructor for class com.jgalgo.gen.DifferenceGraphGenerator: Create a new difference graph generator that will use the given graph factory.
Digraph6GraphReader - Class in com.jgalgo.io: Read a graph in 'digraph6' format.
Digraph6GraphReader() - Constructor for class com.jgalgo.io.Digraph6GraphReader: Create a new reader.
Digraph6GraphWriter - Class in com.jgalgo.io: Write a graph in 'digraph6' format.
Digraph6GraphWriter() - Constructor for class com.jgalgo.io.Digraph6GraphWriter: Create a new writer.
DimacsGraphReader - Class in com.jgalgo.io: Read a graph in 'DIMACS' format.
DimacsGraphReader() - Constructor for class com.jgalgo.io.DimacsGraphReader: Create a new reader.
DimacsGraphWriter - Class in com.jgalgo.io: Write a graph in 'DIMACS' format.
DimacsGraphWriter() - Constructor for class com.jgalgo.io.DimacsGraphWriter: Create a new writer.
directed() - Static method in interface com.jgalgo.graph.GraphBuilder: Create a new builder that builds directed graphs.
directed() - Static method in interface com.jgalgo.graph.GraphFactory: Create a directed graph factory.
directed() - Static method in interface com.jgalgo.graph.IndexGraphBuilder: Create a new builder that builds directed graphs.
directed() - Static method in interface com.jgalgo.graph.IndexGraphFactory: Create a directed index graph factory.
directed() - Static method in interface com.jgalgo.graph.IntGraphBuilder: Create a new builder that builds directed int graphs.
directed() - Static method in interface com.jgalgo.graph.IntGraphFactory: Create a directed int graph factory.
directed(boolean) - Method in class com.jgalgo.gen.BarabasiAlbertGraphGenerator: Determine if the generated graph(s) is directed or undirected.
directed(boolean) - Method in class com.jgalgo.gen.CompleteGraphGenerator: Determine if the generated graph(s) is directed or undirected.
directed(boolean) - Method in class com.jgalgo.gen.EmptyGraphGenerator: Determine if the generated graph(s) is directed or undirected.
directed(boolean) - Method in class com.jgalgo.gen.GnmGraphGenerator: Determine if the generated graph(s) is directed or undirected.
directed(boolean) - Method in class com.jgalgo.gen.GnpGraphGenerator: Determine if the generated graph(s) is directed or undirected.
directed(boolean) - Method in class com.jgalgo.gen.RecursiveMatrixGraphGenerator: Determine if the generated graph(s) is directed or undirected.
directedAll() - Method in class com.jgalgo.gen.CompleteBipartiteGraphGenerator: Sets the generated graph(s) to be directed with edges in both directions.
directedAll() - Method in class com.jgalgo.gen.GnmBipartiteGraphGenerator: Sets the generated graph(s) to be directed with edges in both directions.
directedAll() - Method in class com.jgalgo.gen.GnpBipartiteGraphGenerator: Sets the generated graph(s) to be directed with edges in both directions.
directedLeftToRight() - Method in class com.jgalgo.gen.CompleteBipartiteGraphGenerator: Sets the generated graph(s) to be directed with edges from left to right.
directedLeftToRight() - Method in class com.jgalgo.gen.GnmBipartiteGraphGenerator: Sets the generated graph(s) to be directed with edges from left to right.
directedLeftToRight() - Method in class com.jgalgo.gen.GnpBipartiteGraphGenerator: Sets the generated graph(s) to be directed with edges from left to right.
directedRightToLeft() - Method in class com.jgalgo.gen.CompleteBipartiteGraphGenerator: Sets the generated graph(s) to be directed with edges from right to left.
directedRightToLeft() - Method in class com.jgalgo.gen.GnmBipartiteGraphGenerator: Sets the generated graph(s) to be directed with edges from right to left.
directedRightToLeft() - Method in class com.jgalgo.gen.GnpBipartiteGraphGenerator: Sets the generated graph(s) to be directed with edges from right to left.
distance(int) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.IResult: Get the distance to a target vertex.
distance(int) - Method in interface com.jgalgo.alg.shortestpath.VoronoiAlgo.IResult: Get the distance of a vertex from its site.
distance(int, int) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathAllPairs.IResult: Get the distance of the shortest path between two vertices.
distance(Integer) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.IResult: Deprecated.
Please use ShortestPathSingleSource.IResult.distance(int) instead to avoid un/boxing.
distance(Integer) - Method in interface com.jgalgo.alg.shortestpath.VoronoiAlgo.IResult: Deprecated.
Please use VoronoiAlgo.IResult.distance(int) instead to avoid un/boxing.
distance(Integer, Integer) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathAllPairs.IResult: Deprecated.
Please use ShortestPathAllPairs.IResult.distance(int, int) instead to avoid un/boxing.
distance(V) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.Result: Get the distance to a target vertex.
distance(V) - Method in interface com.jgalgo.alg.shortestpath.VoronoiAlgo.Result: Get the distance of a vertex from its site.
distance(V, V) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathAllPairs.Result: Get the distance of the shortest path between two vertices.
DistanceMeasures<V,E> - Interface in com.jgalgo.alg.distancemeasures: A set of graph distance measures.
DominatingSetAlgo - Interface in com.jgalgo.alg.cover: An algorithm for computing a minimum dominating set.
DominatingSetAlgoAbstract - Class in com.jgalgo.alg.cover: Abstract class for computing a minimum dominating set.
DominatingSetAlgoAbstract() - Constructor for class com.jgalgo.alg.cover.DominatingSetAlgoAbstract: Default constructor.
DominatingSetAlgoGreedy - Class in com.jgalgo.alg.cover: A greedy algorithm for computing a minimum dominating set.
DominatingSetAlgoGreedy() - Constructor for class com.jgalgo.alg.cover.DominatingSetAlgoGreedy: Create a new greedy dominating set algorithm object.
dynamicLcaExample() - Static method in class com.jgalgo.example.LowestCommonAncestorExample: This example demonstrates how to use the dynamic lowest common ancestor algorithm.

E

eccentricity(int) - Method in interface com.jgalgo.alg.distancemeasures.IDistanceMeasures: Get the eccentricity of a vertex.
eccentricity(Integer) - Method in interface com.jgalgo.alg.distancemeasures.IDistanceMeasures: Deprecated.
Please use IDistanceMeasures.eccentricity(int) instead to avoid un/boxing.
eccentricity(V) - Method in interface com.jgalgo.alg.distancemeasures.DistanceMeasures: Get the eccentricity of a vertex.
edgeBuilder() - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
edgeBuilder() - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
edgeBuilder() - Method in interface com.jgalgo.graph.Graph: Get the edge builder of this graph.
edgeBuilder() - Method in interface com.jgalgo.graph.GraphBuilder: Get the edge builder of this builder.
edgeBuilder() - Method in interface com.jgalgo.graph.IndexGraph: Get the edge builder of this graph.
edgeBuilder() - Method in interface com.jgalgo.graph.IndexGraphBuilder: Get the edge builder of this builder.
edgeBuilder() - Method in interface com.jgalgo.graph.IntGraph
edgeBuilder() - Method in interface com.jgalgo.graph.IntGraphBuilder
edgeConnectingOrNull(V, V) - Method in class com.jgalgo.adapt.guava.GuavaNetworkAdapter
EdgeCover - Interface in com.jgalgo.alg.cover: Minimum edge vertex cover algorithm.
EdgeCoverAbstract - Class in com.jgalgo.alg.cover: Abstract class for computing a minimum edge cover.
EdgeCoverAbstract() - Constructor for class com.jgalgo.alg.cover.EdgeCoverAbstract: Default constructor.
EdgeCoverCardinality - Class in com.jgalgo.alg.cover: A simply algorithm for computing a minimum edge cover using a maximum matching algorithm.
EdgeCoverCardinality() - Constructor for class com.jgalgo.alg.cover.EdgeCoverCardinality: Create a new edge cover algorithm object for unweighted graphs.
EdgeCoverWeighted - Class in com.jgalgo.alg.cover: A simply algorithm for computing a minimum weighted edge cover using a minimum weighted perfect matching algorithm.
EdgeCoverWeighted() - Constructor for class com.jgalgo.alg.cover.EdgeCoverWeighted: Create a new weighted edge cover algorithm object.
edgeDifferenceByEndpoints() - Method in class com.jgalgo.gen.DifferenceGraphGenerator: Set the difference of edges to be by their endpoints.
edgeDifferenceByEndpoints() - Method in class com.jgalgo.gen.SymmetricDifferenceGraphGenerator: Set the difference of edges to be by their endpoints.
edgeDifferenceById() - Method in class com.jgalgo.gen.DifferenceGraphGenerator: Set the difference of edges to be by their id.
edgeDifferenceById() - Method in class com.jgalgo.gen.SymmetricDifferenceGraphGenerator: Set the difference of edges to be by their id.
EdgeDirection - Enum in com.jgalgo.alg.common: The direction type of an edge with respect to a vertex.
edgeEndpoint(int, int) - Method in interface com.jgalgo.graph.IntGraph: Get the other end-point of an edge.
edgeEndpoint(E, V) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
edgeEndpoint(E, V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
edgeEndpoint(E, V) - Method in interface com.jgalgo.graph.Graph: Get the other end-point of an edge.
edgeEndpoint(Integer, Integer) - Method in interface com.jgalgo.graph.IntGraph: Deprecated.
Please use IntGraph.edgeEndpoint(int, int) instead to avoid un/boxing.
edgeIntersectByEndpoints() - Method in class com.jgalgo.gen.IntersectionGraphGenerator: Set the intersection of edges to be by the edges endpoints.
edgeIntersectById() - Method in class com.jgalgo.gen.IntersectionGraphGenerator: Set the intersection of edges to by the edges identifiers.
edgeIter() - Method in interface com.jgalgo.alg.common.IPath
edgeIter() - Method in interface com.jgalgo.alg.common.Path: Get an EdgeIter that iterate over the edges of the path.
EdgeIter<V,E> - Interface in com.jgalgo.graph: Iterator used to iterate over graph edges.
edgeIterationExample() - Static method in class com.jgalgo.example.EdgeIterationExample: This example demonstrates how to iterate over the edges of a graph.
EdgeIterationExample - Class in com.jgalgo.example: This example demonstrates how to iterate over the edges of a graph.
edgeOrder() - Method in class com.jgalgo.adapt.guava.GuavaNetworkAdapter
edgePath() - Method in interface com.jgalgo.alg.traversal.DfsIter: Get the path from the source to the last vertex returned by DfsIter.next().
edgePath() - Method in interface com.jgalgo.alg.traversal.DfsIter.Int
edgeProbabilities(double, double, double, double) - Method in class com.jgalgo.gen.RecursiveMatrixGraphGenerator: Set the edge probabilities of the generated graph(s).
edgeProbability(double) - Method in class com.jgalgo.gen.GnpBipartiteGraphGenerator: Set the probability each edge will exists in the generated graph(s).
edgeProbability(double) - Method in class com.jgalgo.gen.GnpGraphGenerator: Set the probability each edge will exists in the generated graph(s).
edges() - Method in class com.jgalgo.adapt.guava.GuavaGraphAdapter
edges() - Method in class com.jgalgo.adapt.guava.GuavaNetworkAdapter
edges() - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
edges() - Method in class com.jgalgo.adapt.guava.GuavaValueGraphAdapter
edges() - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
edges() - Method in interface com.jgalgo.alg.common.IPath
edges() - Method in interface com.jgalgo.alg.common.Path: Get the edges forming this path.
edges() - Method in interface com.jgalgo.alg.match.IMatching
edges() - Method in interface com.jgalgo.alg.match.Matching: The collection of edges forming this matching.
edges() - Method in interface com.jgalgo.alg.span.MinimumSpanningTree.IResult
edges() - Method in interface com.jgalgo.alg.span.MinimumSpanningTree.Result: Get all the edges that form the spanning tree.
edges() - Method in interface com.jgalgo.alg.span.SteinerTreeAlgo.IResult
edges() - Method in interface com.jgalgo.alg.span.SteinerTreeAlgo.Result: Get all the edges that form the Steiner tree.
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.IntGraph
edges() - Method in interface com.jgalgo.graph.IntGraphBuilder
edges(int) - Method in class com.jgalgo.gen.GnmBipartiteGraphGenerator: Set the number of edges what will be generated for each graph.
edges(int) - Method in class com.jgalgo.gen.GnmGraphGenerator: Set the number of edges what will be generated for each graph.
edges(int) - Method in class com.jgalgo.gen.RecursiveMatrixGraphGenerator: Set the number of edges what will be generated for each graph.
edges(int, IdBuilder<E>) - Method in class com.jgalgo.gen.GnmBipartiteGraphGenerator: Set the number of edges what will be generated for each graph, and the edge builder that will be used to generate them.
edges(int, IdBuilder<E>) - Method in class com.jgalgo.gen.GnmGraphGenerator: Set the number of edges what will be generated for each graph, and the edge builder that will be used to generate them.
edges(int, IdBuilder<E>) - Method in class com.jgalgo.gen.RecursiveMatrixGraphGenerator: Set the number of edges what will be generated for each graph, and the edge builder that will be used to generate them.
edges(IdBuilder<E>) - Method in class com.jgalgo.gen.BarabasiAlbertGraphGenerator: Set the edge builder that will be used to generate edges.
edges(IdBuilder<E>) - Method in class com.jgalgo.gen.ComplementGraphGenerator: Set the edge builder that will be used to generate edges.
edges(IdBuilder<E>) - Method in class com.jgalgo.gen.CompleteBipartiteGraphGenerator: Set the edge builder that will be used to generate edges.
edges(IdBuilder<E>) - Method in class com.jgalgo.gen.CompleteGraphGenerator: Set the edge builder that will be used to generate edges.
edges(IdBuilder<E>) - Method in class com.jgalgo.gen.GnpBipartiteGraphGenerator: Set the edge builder that will be used to generate edges.
edges(IdBuilder<E>) - Method in class com.jgalgo.gen.GnpGraphGenerator: Set the edge builder that will be used to generate edges.
edges(IdBuilder<E>) - Method in class com.jgalgo.gen.LineGraphGenerator: Set the edge builder that will be used to generate edges.
edges(IdBuilder<E>) - Method in class com.jgalgo.gen.UniformTreeGenerator: Set the edge builder that will be used to generate edges.
edgesConnecting(V, V) - Method in class com.jgalgo.adapt.guava.GuavaNetworkAdapter
edgeSet() - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
EdgeSet<V,E> - Interface in com.jgalgo.graph: Set of graph edges.
edgesOf(V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
edgeSource(int) - Method in interface com.jgalgo.graph.IntGraph: Get the source vertex of an edge.
edgeSource(E) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
edgeSource(E) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
edgeSource(E) - Method in interface com.jgalgo.graph.Graph: Get the source vertex of an edge.
edgeSource(Integer) - Method in interface com.jgalgo.graph.IntGraph: Deprecated.
Please use IntGraph.edgeSource(int) instead to avoid un/boxing.
edgesPerStep(int) - Method in class com.jgalgo.gen.BarabasiAlbertGraphGenerator: Set the number of edges added each step when generated graph(s).
edgesReIndexing - Variable in class com.jgalgo.graph.IndexGraphBuilder.ReIndexedGraph: The re-indexing map of the edges.
edgesWeights(String) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
edgesWeights(String) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
edgesWeights(String) - Method in interface com.jgalgo.graph.Graph: Get the edges weights of some key.
edgesWeights(String) - Method in interface com.jgalgo.graph.GraphBuilder: Get the edges weights of some key.
edgesWeights(String) - Method in interface com.jgalgo.graph.IntGraph: Get the edges weights of some key.
edgesWeights(String) - Method in interface com.jgalgo.graph.IntGraphBuilder: Get the edges weights of some key.
edgesWeightsKeys() - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
edgesWeightsKeys() - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
edgesWeightsKeys() - Method in interface com.jgalgo.graph.Graph: Get the keys of all the associated edges weights.
edgesWeightsKeys() - Method in interface com.jgalgo.graph.GraphBuilder: Get the keys of all the associated edges weights.
edgesWeightsKeys(Set<String>) - Method in class com.jgalgo.gen.UnionGraphGenerator: Set the edges weights keys to be copied from the input graphs to the generated graph(s).
edgeTarget(int) - Method in interface com.jgalgo.graph.IntGraph: Get the target vertex of an edge.
edgeTarget(E) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
edgeTarget(E) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
edgeTarget(E) - Method in interface com.jgalgo.graph.Graph: Get the target vertex of an edge.
edgeTarget(Integer) - Method in interface com.jgalgo.graph.IntGraph: Deprecated.
Please use IntGraph.edgeTarget(int) instead to avoid un/boxing.
edgeUnionByEndpoints() - Method in class com.jgalgo.gen.UnionGraphGenerator: Set the union of edges to be by the edges endpoints.
edgeUnionById() - Method in class com.jgalgo.gen.UnionGraphGenerator: Set the union of edges to be by the edges identifiers.
edgeValueOrDefault(EndpointPair<V>, ValueT) - Method in class com.jgalgo.adapt.guava.GuavaValueGraphAdapter
edgeValueOrDefault(V, V, ValueT) - Method in class com.jgalgo.adapt.guava.GuavaValueGraphAdapter
emptyGraph(Collection<? extends V>) - Static method in class com.jgalgo.gen.EmptyGraphGenerator: Generate a new empty undirected graph.
EmptyGraphGenerator<V,E> - Class in com.jgalgo.gen: Generate a graph with no edges.
EmptyGraphGenerator() - Constructor for class com.jgalgo.gen.EmptyGraphGenerator: Create a new empty generator that will use the default graph factory.
EmptyGraphGenerator(GraphFactory<V, E>) - Constructor for class com.jgalgo.gen.EmptyGraphGenerator: Create a new empty generator that will use the given graph factory.
ensureEdgeCapacity(int) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
ensureEdgeCapacity(int) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
ensureEdgeCapacity(int) - Method in interface com.jgalgo.graph.Graph: Hint the implementation to allocate space for at least edgeCapacity edges.
ensureEdgeCapacity(int) - Method in interface com.jgalgo.graph.GraphBuilder: Hint the implementation to allocate space for at least edgeCapacity edges.
ensureVertexCapacity(int) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
ensureVertexCapacity(int) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
ensureVertexCapacity(int) - Method in interface com.jgalgo.graph.Graph: Hint the implementation to allocate space for at least vertexCapacity vertices.
ensureVertexCapacity(int) - Method in interface com.jgalgo.graph.GraphBuilder: Hint the implementation to allocate space for at least vertexCapacity vertices.
equals(Object) - Method in interface com.jgalgo.alg.common.Path: Check whether this path equals another object.
equals(Object) - Method in class com.jgalgo.graph.AbstractGraph
EulerianTourAlgo - Interface in com.jgalgo.alg.euler: Eulerian tour calculation algorithm.
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.IndexGraphFactory
expectedEdgesNum(int) - Method in interface com.jgalgo.graph.IntGraphFactory
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.IndexGraphFactory
expectedVerticesNum(int) - Method in interface com.jgalgo.graph.IntGraphFactory

F

FastEdgeLookup - com.jgalgo.graph.GraphFactory.Hint: The graph should support fast edge lookup via Graph.getEdge(Object, Object) and Graph.getEdges(Object, Object).
FastEdgeRemoval - com.jgalgo.graph.GraphFactory.Hint: The graph should support fast edge removal via Graph.removeEdge(Object).
findBiConnectedComponents(Graph<V, E>) - Method in interface com.jgalgo.alg.connect.BiConnectedComponentsAlgo: Compute all maximal bi-connected components of a graph.
findBiConnectedComponents(Graph<V, E>) - Method in class com.jgalgo.alg.connect.BiConnectedComponentsAlgoAbstract
findKVertexConnectedComponents(Graph<V, E>, int) - Method in interface com.jgalgo.alg.connect.KVertexConnectedComponentsAlgo: Find all k-vertex connected components in a graph.
findKVertexConnectedComponents(Graph<V, E>, int) - Method in class com.jgalgo.alg.connect.KVertexConnectedComponentsAlgoAbstract
findLca(int, int) - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorStatic.IDataStructure: Find the lowest common ancestor of two vertices in the tree.
findLca(Integer, Integer) - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorStatic.IDataStructure: Deprecated.
Please use LowestCommonAncestorStatic.IDataStructure.findLca(int, int) instead to avoid un/boxing.
findLca(V, V) - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorStatic.DataStructure: Find the lowest common ancestor of two vertices in the tree.
findLowestCommonAncestor(LowestCommonAncestorDynamic.Vertex, LowestCommonAncestorDynamic.Vertex) - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorDynamic: Find the lowest common ancestor of two vertices in the tree.
findLowestCommonAncestor(LowestCommonAncestorDynamic.Vertex, LowestCommonAncestorDynamic.Vertex) - Method in class com.jgalgo.alg.tree.LowestCommonAncestorDynamicGabowInts
findLowestCommonAncestor(LowestCommonAncestorDynamic.Vertex, LowestCommonAncestorDynamic.Vertex) - Method in class com.jgalgo.alg.tree.LowestCommonAncestorDynamicGabowLongs
findLowestCommonAncestor(LowestCommonAncestorDynamic.Vertex, LowestCommonAncestorDynamic.Vertex) - Method in class com.jgalgo.alg.tree.LowestCommonAncestorDynamicGabowSimple
findLowestCommonAncestors(Graph<V, E>, V, LowestCommonAncestorOffline.Queries<V, E>) - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorOffline: Find the lowest common ancestors of the given queries.
findLowestCommonAncestors(Graph<V, E>, V, LowestCommonAncestorOffline.Queries<V, E>) - Method in class com.jgalgo.alg.tree.LowestCommonAncestorOfflineAbstract
findPartition(Graph<V, E>) - Static method in class com.jgalgo.alg.bipartite.BipartiteGraphs: Find a bipartite partition of the given graph (if one exists).
findPartition(Graph<V, E>, boolean) - Static method in class com.jgalgo.alg.bipartite.BipartiteGraphs: Find a bipartite partition of the given graph (if one exists), and optionally add the partition as vertex weights.
findPath(Graph<V, E>, V, V) - Static method in interface com.jgalgo.alg.common.Path: Find a valid path from \(u\) to \(v\).
findPath(IntGraph, int, int) - Static method in interface com.jgalgo.alg.common.IPath: Find a valid path from \(u\) to \(v\).
findStronglyConnectedComponents(Graph<V, E>) - Method in interface com.jgalgo.alg.connect.StronglyConnectedComponentsAlgo: Find all strongly connected components in a graph.
findStronglyConnectedComponents(Graph<V, E>) - Method in class com.jgalgo.alg.connect.StronglyConnectedComponentsAlgoAbstract
findWeaklyConnectedComponents(Graph<V, E>) - Method in interface com.jgalgo.alg.connect.WeaklyConnectedComponentsAlgo: Compute all weakly connected components in a graph.
findWeaklyConnectedComponents(Graph<V, E>) - Method in class com.jgalgo.alg.connect.WeaklyConnectedComponentsAlgoAbstract
Flow<V,E> - Interface in com.jgalgo.alg.flow: Flow on graph edges.
fromArray(IndexGraph, int[], int) - Static method in interface com.jgalgo.alg.common.IVertexPartition: Create a new vertex partition from an array of vertex-blockIndex mapping.
fromBitmap(IndexGraph, Bitmap) - Static method in interface com.jgalgo.alg.common.IVertexBiPartition: Create a new vertex bi-partition from a bitmap.
fromMap(Graph<V, E>, Object2IntMap<V>) - Static method in interface com.jgalgo.alg.common.VertexPartition: Create a new vertex partition from a vertex-blockIndex map.
fromMap(Graph<V, E>, Map<V, Boolean>) - Static method in interface com.jgalgo.alg.common.VertexBiPartition: Create a new vertex bi-partition from a vertex-side map.
fromMap(IntGraph, Int2IntMap) - Static method in interface com.jgalgo.alg.common.IVertexPartition: Create a new vertex partition from a vertex-blockIndex map.
fromMap(IntGraph, Map<Integer, Boolean>) - Static method in interface com.jgalgo.alg.common.IVertexBiPartition: Create a new vertex bi-partition from a vertex-side map.
fromMapping(Graph<V, E>, Predicate<V>) - Static method in interface com.jgalgo.alg.common.VertexBiPartition: Create a new vertex bi-partition from a vertex-side mapping function.
fromMapping(Graph<V, E>, ToIntFunction<V>) - Static method in interface com.jgalgo.alg.common.VertexPartition: Create a new vertex partition from a vertex-blockIndex mapping function.
fromMapping(IntGraph, IntPredicate) - Static method in interface com.jgalgo.alg.common.IVertexBiPartition: Create a new vertex bi-partition from a vertex-side mapping function.
fromMapping(IntGraph, IntUnaryOperator) - Static method in interface com.jgalgo.alg.common.IVertexPartition: Create a new vertex partition from a vertex-blockIndex mapping function.
fromWeights(Graph<V, E>, WeightsBool<V>) - Static method in interface com.jgalgo.alg.common.VertexBiPartition: Create a new vertex bi-partition from a vertex-side weights container.
fromWeights(IntGraph, IWeightsBool) - Static method in interface com.jgalgo.alg.common.IVertexBiPartition: Create a new vertex bi-partition from a vertex-side weights container.

G

generate() - Method in interface com.jgalgo.gen.GraphGenerator: Generates an immutable graph.
generateIntoBuilder() - Method in class com.jgalgo.gen.BarabasiAlbertGraphGenerator
generateIntoBuilder() - Method in class com.jgalgo.gen.ComplementGraphGenerator
generateIntoBuilder() - Method in class com.jgalgo.gen.CompleteBipartiteGraphGenerator
generateIntoBuilder() - Method in class com.jgalgo.gen.CompleteGraphGenerator
generateIntoBuilder() - Method in class com.jgalgo.gen.DifferenceGraphGenerator
generateIntoBuilder() - Method in class com.jgalgo.gen.EmptyGraphGenerator
generateIntoBuilder() - Method in class com.jgalgo.gen.GnmBipartiteGraphGenerator
generateIntoBuilder() - Method in class com.jgalgo.gen.GnmGraphGenerator
generateIntoBuilder() - Method in class com.jgalgo.gen.GnpBipartiteGraphGenerator
generateIntoBuilder() - Method in class com.jgalgo.gen.GnpGraphGenerator
generateIntoBuilder() - Method in interface com.jgalgo.gen.GraphGenerator: Generates a graph into a builder.
generateIntoBuilder() - Method in class com.jgalgo.gen.IntersectionGraphGenerator
generateIntoBuilder() - Method in class com.jgalgo.gen.LineGraphGenerator
generateIntoBuilder() - Method in class com.jgalgo.gen.RecursiveMatrixGraphGenerator
generateIntoBuilder() - Method in class com.jgalgo.gen.SymmetricDifferenceGraphGenerator
generateIntoBuilder() - Method in class com.jgalgo.gen.UniformTreeGenerator
generateIntoBuilder() - Method in class com.jgalgo.gen.UnionGraphGenerator
generateMutable() - Method in interface com.jgalgo.gen.GraphGenerator: Generates a mutable graph.
get(int) - Method in interface com.jgalgo.graph.IWeightsBool: Get the weight associated with the given element.
get(int) - Method in interface com.jgalgo.graph.IWeightsByte: Get the weight associated with the given element.
get(int) - Method in interface com.jgalgo.graph.IWeightsChar: Get the weight associated with the given element.
get(int) - Method in interface com.jgalgo.graph.IWeightsDouble: Get the weight associated with the given element.
get(int) - Method in interface com.jgalgo.graph.IWeightsFloat: Get the weight associated with the given element.
get(int) - Method in interface com.jgalgo.graph.IWeightsInt: Get the weight associated with the given element.
get(int) - Method in interface com.jgalgo.graph.IWeightsLong: Get the weight associated with the given element.
get(int) - Method in interface com.jgalgo.graph.IWeightsObj: Get the weight associated with the given element.
get(int) - Method in interface com.jgalgo.graph.IWeightsShort: Get the weight associated with the given element.
get(Integer) - Method in interface com.jgalgo.graph.IWeightsBool: Deprecated.
Please use IWeightsBool.get(int) instead to avoid un/boxing.
get(Integer) - Method in interface com.jgalgo.graph.IWeightsByte: Deprecated.
Please use IWeightsByte.get(int) instead to avoid un/boxing.
get(Integer) - Method in interface com.jgalgo.graph.IWeightsChar: Deprecated.
Please use IWeightsChar.get(int) instead to avoid un/boxing.
get(Integer) - Method in interface com.jgalgo.graph.IWeightsDouble: Deprecated.
Please use IWeightsDouble.get(int) instead to avoid un/boxing.
get(Integer) - Method in interface com.jgalgo.graph.IWeightsFloat: Deprecated.
Please use IWeightsFloat.get(int) instead to avoid un/boxing.
get(Integer) - Method in interface com.jgalgo.graph.IWeightsInt: Deprecated.
Please use IWeightsInt.get(int) instead to avoid un/boxing.
get(Integer) - Method in interface com.jgalgo.graph.IWeightsLong: Deprecated.
Please use IWeightsLong.get(int) instead to avoid un/boxing.
get(Integer) - Method in interface com.jgalgo.graph.IWeightsObj: Deprecated.
Please use IWeightsObj.get(int) instead to avoid un/boxing.
get(Integer) - Method in interface com.jgalgo.graph.IWeightsShort: Deprecated.
Please use IWeightsShort.get(int) instead to avoid un/boxing.
get(K) - Method in interface com.jgalgo.graph.WeightsBool: Get the weight associated with the given element.
get(K) - Method in interface com.jgalgo.graph.WeightsByte: Get the weight associated with the given element.
get(K) - Method in interface com.jgalgo.graph.WeightsChar: Get the weight associated with the given element.
get(K) - Method in interface com.jgalgo.graph.WeightsDouble: Get the weight associated with the given element.
get(K) - Method in interface com.jgalgo.graph.WeightsFloat: Get the weight associated with the given element.
get(K) - Method in interface com.jgalgo.graph.WeightsInt: Get the weight associated with the given element.
get(K) - Method in interface com.jgalgo.graph.WeightsLong: Get the weight associated with the given element.
get(K) - Method in interface com.jgalgo.graph.WeightsObj: Get the weight associated with the given element.
get(K) - Method in interface com.jgalgo.graph.WeightsShort: Get the weight associated with the given element.
getAllEdges(V, V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
getAsObj(int) - Method in interface com.jgalgo.graph.IWeights: Get the weight associated with the given id.
getAsObj(int) - Method in interface com.jgalgo.graph.IWeightsBool: Deprecated.
Please use IWeightsBool.get(int) instead to avoid un/boxing.
getAsObj(int) - Method in interface com.jgalgo.graph.IWeightsByte: Deprecated.
Please use IWeightsByte.get(int) instead to avoid un/boxing.
getAsObj(int) - Method in interface com.jgalgo.graph.IWeightsChar: Deprecated.
Please use IWeightsChar.get(int) instead to avoid un/boxing.
getAsObj(int) - Method in interface com.jgalgo.graph.IWeightsDouble: Deprecated.
Please use IWeightsDouble.get(int) instead to avoid un/boxing.
getAsObj(int) - Method in interface com.jgalgo.graph.IWeightsFloat: Deprecated.
Please use IWeightsFloat.get(int) instead to avoid un/boxing.
getAsObj(int) - Method in interface com.jgalgo.graph.IWeightsInt: Deprecated.
Please use IWeightsInt.get(int) instead to avoid un/boxing.
getAsObj(int) - Method in interface com.jgalgo.graph.IWeightsLong: Deprecated.
Please use IWeightsLong.get(int) instead to avoid un/boxing.
getAsObj(int) - Method in interface com.jgalgo.graph.IWeightsObj: Deprecated.
Please use IWeightsObj.get(int) instead to avoid un/boxing.
getAsObj(int) - Method in interface com.jgalgo.graph.IWeightsShort: Deprecated.
Please use IWeightsShort.get(int) instead to avoid un/boxing.
getAsObj(Integer) - Method in interface com.jgalgo.graph.IWeights: Deprecated.
Please use IWeights.getAsObj(int) instead to avoid un/boxing.
getAsObj(Integer) - Method in interface com.jgalgo.graph.IWeightsBool: Deprecated.
Please use IWeightsBool.get(int) instead to avoid un/boxing.
getAsObj(Integer) - Method in interface com.jgalgo.graph.IWeightsByte: Deprecated.
Please use IWeightsByte.get(int) instead to avoid un/boxing.
getAsObj(Integer) - Method in interface com.jgalgo.graph.IWeightsChar: Deprecated.
Please use IWeightsChar.get(int) instead to avoid un/boxing.
getAsObj(Integer) - Method in interface com.jgalgo.graph.IWeightsDouble: Deprecated.
Please use IWeightsDouble.get(int) instead to avoid un/boxing.
getAsObj(Integer) - Method in interface com.jgalgo.graph.IWeightsFloat: Deprecated.
Please use IWeightsFloat.get(int) instead to avoid un/boxing.
getAsObj(Integer) - Method in interface com.jgalgo.graph.IWeightsInt: Deprecated.
Please use IWeightsInt.get(int) instead to avoid un/boxing.
getAsObj(Integer) - Method in interface com.jgalgo.graph.IWeightsLong: Deprecated.
Please use IWeightsLong.get(int) instead to avoid un/boxing.
getAsObj(Integer) - Method in interface com.jgalgo.graph.IWeightsObj: Deprecated.
Please use IWeightsObj.get(int) instead to avoid un/boxing.
getAsObj(Integer) - Method in interface com.jgalgo.graph.IWeightsShort: Deprecated.
Please use IWeightsShort.get(int) instead to avoid un/boxing.
getAsObj(K) - Method in interface com.jgalgo.graph.Weights: Get the weight associated with the given element.
getAsObj(K) - Method in interface com.jgalgo.graph.WeightsBool: Deprecated.
Please use WeightsBool.get(Object) instead to avoid un/boxing.
getAsObj(K) - Method in interface com.jgalgo.graph.WeightsByte: Deprecated.
Please use WeightsByte.get(Object) instead to avoid un/boxing.
getAsObj(K) - Method in interface com.jgalgo.graph.WeightsChar: Deprecated.
Please use WeightsChar.get(Object) instead to avoid un/boxing.
getAsObj(K) - Method in interface com.jgalgo.graph.WeightsDouble: Deprecated.
Please use WeightsDouble.get(Object) instead to avoid un/boxing.
getAsObj(K) - Method in interface com.jgalgo.graph.WeightsFloat: Deprecated.
Please use WeightsFloat.get(Object) instead to avoid un/boxing.
getAsObj(K) - Method in interface com.jgalgo.graph.WeightsInt: Deprecated.
Please use WeightsInt.get(Object) instead to avoid un/boxing.
getAsObj(K) - Method in interface com.jgalgo.graph.WeightsLong: Deprecated.
Please use WeightsLong.get(Object) instead to avoid un/boxing.
getAsObj(K) - Method in interface com.jgalgo.graph.WeightsObj: Deprecated.
Please use WeightsObj.get(Object) instead to avoid un/boxing.
getAsObj(K) - Method in interface com.jgalgo.graph.WeightsShort: Deprecated.
Please use WeightsShort.get(Object) instead to avoid un/boxing.
getBiCcEdges(int) - Method in interface com.jgalgo.alg.connect.BiConnectedComponentsAlgo.IResult
getBiCcEdges(int) - Method in interface com.jgalgo.alg.connect.BiConnectedComponentsAlgo.Result: Get the edges contained in a single bi-connected component.
getBiCcVertices(int) - Method in interface com.jgalgo.alg.connect.BiConnectedComponentsAlgo.IResult
getBiCcVertices(int) - Method in interface com.jgalgo.alg.connect.BiConnectedComponentsAlgo.Result: Get the vertices contained in a single bi-connected component.
getBlockGraph() - Method in interface com.jgalgo.alg.connect.BiConnectedComponentsAlgo.Result: Get the graph of the bi-connected components.
getCutVertices() - Method in interface com.jgalgo.alg.connect.BiConnectedComponentsAlgo.IResult
getCutVertices() - Method in interface com.jgalgo.alg.connect.BiConnectedComponentsAlgo.Result: Get all the cut vertices in the graph.
getData() - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorDynamic.Vertex: Get the user data of this vertex.
getEdge(int, int) - Method in interface com.jgalgo.graph.IntGraph: Get the edge whose source is source and target is target.
getEdge(Integer, Integer) - Method in interface com.jgalgo.graph.IntGraph: Deprecated.
Please use IntGraph.getEdge(int, int) instead to avoid un/boxing.
getEdge(V, V) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
getEdge(V, V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
getEdge(V, V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
getEdge(V, V) - Method in interface com.jgalgo.graph.Graph: Get the edge whose source is source and target is target.
getEdges(int, int) - Method in interface com.jgalgo.graph.IntGraph: Get the edges whose source is source and target is target.
getEdges(Integer, Integer) - Method in interface com.jgalgo.graph.IntGraph: Deprecated.
Please use IntGraph.getEdges(int, int) instead to avoid un/boxing.
getEdges(V, V) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
getEdges(V, V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
getEdges(V, V) - Method in interface com.jgalgo.graph.Graph: Get the edges whose source is source and target is target.
getEdgeSource(E) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
getEdgeSupplier() - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
getEdgeTarget(E) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
getEdgeWeight(E) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
getExistingPartition(Graph<V, E>) - Static method in class com.jgalgo.alg.bipartite.BipartiteGraphs: Get the existing bipartite partition of the given graph from the vertices weights.
getExistingPartition(IntGraph) - Static method in class com.jgalgo.alg.bipartite.BipartiteGraphs: Get the existing bipartite partition of the given IntGraph from the vertices weights.
getFlow(int) - Method in interface com.jgalgo.alg.flow.IFlow: Get the amount of flow units going along an edge.
getFlow(E) - Method in interface com.jgalgo.alg.flow.Flow: Get the amount of flow units going along an edge.
getFlow(Integer) - Method in interface com.jgalgo.alg.flow.IFlow: Deprecated.
Please use IFlow.getFlow(int) instead to avoid un/boxing.
getHeaviestEdge(int) - Method in interface com.jgalgo.alg.tree.TreePathMaxima.IResult: Deprecated.
Please use TreePathMaxima.IResult.getHeaviestEdgeInt(int) instead to avoid un/boxing.
getHeaviestEdge(int) - Method in interface com.jgalgo.alg.tree.TreePathMaxima.Result: Get the heaviest edge found for a single query.
getHeaviestEdgeInt(int) - Method in interface com.jgalgo.alg.tree.TreePathMaxima.IResult: Get the heaviest edge found for a single query.
getLca(int) - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorOffline.IResult: Deprecated.
Please use LowestCommonAncestorOffline.IResult.getLcaInt(int) instead to avoid un/boxing.
getLca(int) - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorOffline.Result: Get the lowest common ancestor of the given query.
getLcaInt(int) - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorOffline.IResult: Get the lowest common ancestor of the given query.
getMatchedEdge(int) - Method in interface com.jgalgo.alg.match.IMatching: Get the only matched edge adjacent to a given vertex.
getMatchedEdge(Integer) - Method in interface com.jgalgo.alg.match.IMatching: Deprecated.
Please use IMatching.getMatchedEdge(int) instead to avoid un/boxing.
getMatchedEdge(V) - Method in interface com.jgalgo.alg.match.Matching: Get the only matched edge adjacent to a given vertex.
getNumberOfBiCcs() - Method in interface com.jgalgo.alg.connect.BiConnectedComponentsAlgo.Result: Get the number of bi-connected components computed in the graph.
getParent() - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorDynamic.Vertex: Get the parent vertex of this vertex.
getPath(int) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.IResult: Get shortest path to a target vertex.
getPath(int) - Method in interface com.jgalgo.alg.shortestpath.VoronoiAlgo.IResult: Get the shortest path of a vertex from its site.
getPath(int, int) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathAllPairs.IResult: Get the shortest path between vertices.
getPath(Integer) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.IResult: Deprecated.
Please use ShortestPathSingleSource.IResult.getPath(int) instead to avoid un/boxing.
getPath(Integer) - Method in interface com.jgalgo.alg.shortestpath.VoronoiAlgo.IResult: Deprecated.
Please use VoronoiAlgo.IResult.getPath(int) instead to avoid un/boxing.
getPath(Integer, Integer) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathAllPairs.IResult: Deprecated.
Please use ShortestPathAllPairs.IResult.getPath(int, int) instead to avoid un/boxing.
getPath(V) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.Result: Get shortest path to a target vertex.
getPath(V) - Method in interface com.jgalgo.alg.shortestpath.VoronoiAlgo.Result: Get the shortest path of a vertex from its site.
getPath(V, V) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathAllPairs.Result: Get the shortest path between vertices.
getQuerySource(int) - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorOffline.IQueries: Deprecated.
Please use LowestCommonAncestorOffline.IQueries.getQuerySourceInt(int) instead to avoid un/boxing.
getQuerySource(int) - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorOffline.Queries: Get a query source by index.
getQuerySource(int) - Method in interface com.jgalgo.alg.tree.TreePathMaxima.IQueries: Deprecated.
Please use TreePathMaxima.IQueries.getQuerySourceInt(int) instead to avoid un/boxing.
getQuerySource(int) - Method in interface com.jgalgo.alg.tree.TreePathMaxima.Queries: Get a query source by index.
getQuerySourceInt(int) - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorOffline.IQueries: Get a query source by index.
getQuerySourceInt(int) - Method in interface com.jgalgo.alg.tree.TreePathMaxima.IQueries: Get a query source by index.
getQueryTarget(int) - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorOffline.IQueries: Deprecated.
Please use LowestCommonAncestorOffline.IQueries.getQueryTargetInt(int) instead to avoid un/boxing.
getQueryTarget(int) - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorOffline.Queries: Get a query target by index.
getQueryTarget(int) - Method in interface com.jgalgo.alg.tree.TreePathMaxima.IQueries: Deprecated.
Please use TreePathMaxima.IQueries.getQueryTargetInt(int) instead to avoid un/boxing.
getQueryTarget(int) - Method in interface com.jgalgo.alg.tree.TreePathMaxima.Queries: Get a query target by index.
getQueryTargetInt(int) - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorOffline.IQueries: Get a query target by index.
getQueryTargetInt(int) - Method in interface com.jgalgo.alg.tree.TreePathMaxima.IQueries: Get a query target by index.
getSupply(int) - Method in interface com.jgalgo.alg.flow.IFlow: Get the sum of flow units going out of a vertex, minus the sum of flow units going into a vertex.
getSupply(Integer) - Method in interface com.jgalgo.alg.flow.IFlow: Deprecated.
Please use IFlow.getSupply(int) instead to avoid un/boxing.
getSupply(V) - Method in interface com.jgalgo.alg.flow.Flow: Get the sum of flow units going out of a vertex, minus the sum of flow units going into a vertex.
getSupplySubset(Collection<V>) - Method in interface com.jgalgo.alg.flow.Flow: Get the sum of flow units going out of a set of vertices, minus the sum of flow units going into the set.
getTotalCost(WeightFunction<E>) - Method in interface com.jgalgo.alg.flow.Flow: Get the total cost of the flow.
getType() - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
getVertexBiCcs(int) - Method in interface com.jgalgo.alg.connect.BiConnectedComponentsAlgo.IResult: Get the bi-connected components a vertex is contained in.
getVertexBiCcs(Integer) - Method in interface com.jgalgo.alg.connect.BiConnectedComponentsAlgo.IResult: Deprecated.
Please use BiConnectedComponentsAlgo.IResult.getVertexBiCcs(int) instead to avoid un/boxing.
getVertexBiCcs(V) - Method in interface com.jgalgo.alg.connect.BiConnectedComponentsAlgo.Result: Get the bi-connected components a vertex is contained in.
getVertexSupplier() - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
GexfGraphReader<V,E> - Class in com.jgalgo.io: Read a graph in 'GEXF' format.
GexfGraphReader() - Constructor for class com.jgalgo.io.GexfGraphReader: Create a new reader.
GexfGraphReader(Class<V>, Class<E>) - Constructor for class com.jgalgo.io.GexfGraphReader: Create a new reader with default parsers and builders for the given vertex and edge types.
GexfGraphWriter<V,E> - Class in com.jgalgo.io: Write a graph in 'GEXF' format.
GexfGraphWriter() - Constructor for class com.jgalgo.io.GexfGraphWriter: Create a new writer.
GmlGraphReader<V,E> - Class in com.jgalgo.io: Read a graph in 'GML' format.
GmlGraphReader() - Constructor for class com.jgalgo.io.GmlGraphReader: Create a new reader.
GmlGraphReader(Class<V>, Class<E>) - Constructor for class com.jgalgo.io.GmlGraphReader: Create a new reader and provide the types of vertices and edges.
GmlGraphWriter<V,E> - Class in com.jgalgo.io: Write a graph in 'GML' format.
GmlGraphWriter() - Constructor for class com.jgalgo.io.GmlGraphWriter: Create a new writer.
GnmBipartiteGraphGenerator<V,E> - Class in com.jgalgo.gen: Generates a uniformly random bipartite graph among all graphs with \(n\) vertices and \(m\) edges.
GnmBipartiteGraphGenerator() - Constructor for class com.jgalgo.gen.GnmBipartiteGraphGenerator: Create a new \(G(n_1,n_2,m)\) generator that will use the default graph factory.
GnmBipartiteGraphGenerator(GraphFactory<V, E>) - Constructor for class com.jgalgo.gen.GnmBipartiteGraphGenerator: Create a new \(G(n_1,n_2,m)\) generator that will use the given graph factory.
GnmGraphGenerator<V,E> - Class in com.jgalgo.gen: Generates a uniformly random graph among all graphs with \(n\) vertices and \(m\) edges.
GnmGraphGenerator() - Constructor for class com.jgalgo.gen.GnmGraphGenerator: Create a new \(G(n,m)\) generator that will use the default graph factory.
GnmGraphGenerator(GraphFactory<V, E>) - Constructor for class com.jgalgo.gen.GnmGraphGenerator: Create a new \(G(n,m)\) generator that will use the given graph factory.
GnpBipartiteGraphGenerator<V,E> - Class in com.jgalgo.gen: Generates a random bipartite graph using the \(G(n_1,n_2,p)\) model in which every edge exists with probability \(p\).
GnpBipartiteGraphGenerator() - Constructor for class com.jgalgo.gen.GnpBipartiteGraphGenerator: Create a new \(G(n_1,n_2,p)\) graph generator that will use the default graph factory.
GnpBipartiteGraphGenerator(GraphFactory<V, E>) - Constructor for class com.jgalgo.gen.GnpBipartiteGraphGenerator: Create a new \(G(n_1,n_2,p)\) graph generator that will use the given graph factory.
GnpGraphGenerator<V,E> - Class in com.jgalgo.gen: Generates a random graph using the \(G(n,p)\) model in which every edge exists with probability \(p\).
GnpGraphGenerator() - Constructor for class com.jgalgo.gen.GnpGraphGenerator: Create a new \(G(n,p)\) graph generator that will use the default graph factory.
GnpGraphGenerator(GraphFactory<V, E>) - Constructor for class com.jgalgo.gen.GnpGraphGenerator: Create a new \(G(n,p)\) graph generator that will use the given graph factory.
graph - Variable in class com.jgalgo.graph.IndexGraphBuilder.ReIndexedGraph: The newly created re-indexed graph.
graph() - Method in interface com.jgalgo.alg.common.IPath
graph() - Method in interface com.jgalgo.alg.common.IVertexPartition
graph() - Method in interface com.jgalgo.alg.common.Path: Get the graph this path is defined on.
graph() - Method in interface com.jgalgo.alg.common.VertexPartition: Get the graph that the partition is defined on.
graph() - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.IResult
graph() - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.Result: Get the graph on which the shortest paths were computed on.
graph(Graph<?, V>) - Method in class com.jgalgo.gen.LineGraphGenerator: Set the input graph whose line graph this generator should generate.
graph(Graph<V, ?>) - Method in class com.jgalgo.gen.ComplementGraphGenerator: Set the input graph whose complement graph will be generated.
Graph<V,E> - Interface in com.jgalgo.graph: A discrete graph with vertices and edges.
Graph6GraphReader - Class in com.jgalgo.io: Read a graph in 'graph6' format.
Graph6GraphReader() - Constructor for class com.jgalgo.io.Graph6GraphReader: Create a new reader.
Graph6GraphWriter - Class in com.jgalgo.io: Write a graph in 'graph6' format.
Graph6GraphWriter() - Constructor for class com.jgalgo.io.Graph6GraphWriter: Create a new writer.
GraphBuilder<V,E> - Interface in com.jgalgo.graph: A builder for graphs.
graphFactory() - Method in class com.jgalgo.gen.BarabasiAlbertGraphGenerator: Get the graph factory that will be used to create the generated graph(s).
graphFactory() - Method in class com.jgalgo.gen.ComplementGraphGenerator: Get the graph factory that will be used to create the generated graph(s).
graphFactory() - Method in class com.jgalgo.gen.CompleteBipartiteGraphGenerator: Get the graph factory that will be used to create the generated graph(s).
graphFactory() - Method in class com.jgalgo.gen.CompleteGraphGenerator: Get the graph factory that will be used to create the generated graph(s).
graphFactory() - Method in class com.jgalgo.gen.DifferenceGraphGenerator: Get the graph factory that will be used to create the generated graph(s).
graphFactory() - Method in class com.jgalgo.gen.EmptyGraphGenerator: Get the graph factory that will be used to create the generated graph(s).
graphFactory() - Method in class com.jgalgo.gen.GnmBipartiteGraphGenerator: Get the graph factory that will be used to create the generated graph(s).
graphFactory() - Method in class com.jgalgo.gen.GnmGraphGenerator: Get the graph factory that will be used to create the generated graph(s).
graphFactory() - Method in class com.jgalgo.gen.GnpBipartiteGraphGenerator: Get the graph factory that will be used to create the generated graph(s).
graphFactory() - Method in class com.jgalgo.gen.GnpGraphGenerator: Get the graph factory that will be used to create the generated graph(s).
graphFactory() - Method in class com.jgalgo.gen.IntersectionGraphGenerator: Get the graph factory that will be used to create the generated graph(s).
graphFactory() - Method in class com.jgalgo.gen.LineGraphGenerator: Get the graph factory that will be used to create the generated graph(s).
graphFactory() - Method in class com.jgalgo.gen.RecursiveMatrixGraphGenerator: Get the graph factory that will be used to create the generated graph(s).
graphFactory() - Method in class com.jgalgo.gen.SymmetricDifferenceGraphGenerator: Get the graph factory that will be used to create the generated graph(s).
graphFactory() - Method in class com.jgalgo.gen.UniformTreeGenerator: Get the graph factory that will be used to create the generated graph(s).
graphFactory() - Method in class com.jgalgo.gen.UnionGraphGenerator: Get the graph factory that will be used to create the generated graph(s).
GraphFactory<V,E> - Interface in com.jgalgo.graph: A factory for Graph objects.
GraphFactory.Hint - Enum in com.jgalgo.graph: Hints for a graph factory.
GraphGenerator<V,E> - Interface in com.jgalgo.gen: A generator of graphs.
GraphMlGraphReader<V,E> - Class in com.jgalgo.io: Read a graph in 'GraphML' format.
GraphMlGraphReader() - Constructor for class com.jgalgo.io.GraphMlGraphReader: Create a new reader.
GraphMlGraphReader(Class<V>, Class<E>) - Constructor for class com.jgalgo.io.GraphMlGraphReader: Create a new reader with default parsers and builders for the given vertex and edge types.
GraphMlGraphWriter<V,E> - Class in com.jgalgo.io: Write a graph in 'GraphML' format.
GraphMlGraphWriter() - Constructor for class com.jgalgo.io.GraphMlGraphWriter: Create a new writer.
GraphReader<V,E> - Interface in com.jgalgo.io: A reader that reads Graphs from files/IO-reader.
graphs(Graph<V, E>...) - Method in class com.jgalgo.gen.IntersectionGraphGenerator: Set the input graphs whose intersection graph will be generated.
graphs(Graph<V, E>...) - Method in class com.jgalgo.gen.UnionGraphGenerator: Set the input graphs whose union graph will be generated (variable arguments version).
graphs(Graph<V, E>, Graph<V, E>) - Method in class com.jgalgo.gen.DifferenceGraphGenerator: Set the input graphs whose difference graph will be generated.
graphs(Graph<V, E>, Graph<V, E>) - Method in class com.jgalgo.gen.SymmetricDifferenceGraphGenerator: Set the input graphs whose symmetric difference graph will be generated.
graphs(Collection<? extends Graph<V, E>>) - Method in class com.jgalgo.gen.IntersectionGraphGenerator: Set the input graphs whose intersection graph will be generated.
graphs(Collection<? extends Graph<V, E>>) - Method in class com.jgalgo.gen.UnionGraphGenerator: Set the input graphs whose union graph will be generated.
Graphs - Class in com.jgalgo.graph: Static methods class for graphs.
GraphWriter<V,E> - Interface in com.jgalgo.io: A writer that writes Graphs to files/IO-writer.
GuavaGraphAdapter<V,E> - Class in com.jgalgo.adapt.guava: An adapter from a JGAlgo graph to a Guava graph.
GuavaGraphAdapter(Graph<V, E>) - Constructor for class com.jgalgo.adapt.guava.GuavaGraphAdapter: Constructs a new adapter from the given JGAlgo graph.
GuavaMutableGraphAdapter<V,E> - Class in com.jgalgo.adapt.guava: An adapter from a JGAlgo graph to a mutable GUava graph.
GuavaMutableGraphAdapter(Graph<V, E>) - Constructor for class com.jgalgo.adapt.guava.GuavaMutableGraphAdapter: Constructs a new mutable adapter from the given JGAlgo graph.
GuavaMutableNetworkAdapter<V,E> - Class in com.jgalgo.adapt.guava: An adapter from a JGAlgo graph to a Guava network.
GuavaMutableNetworkAdapter(Graph<V, E>) - Constructor for class com.jgalgo.adapt.guava.GuavaMutableNetworkAdapter: Constructs a new mutable adapter from the given JGAlgo graph.
GuavaMutableValueGraphAdapter<V,E,ValueT> - Class in com.jgalgo.adapt.guava: An adapter from a JGAlgo graph to a mutable Guava value graph.
GuavaMutableValueGraphAdapter(Graph<V, E>, String) - Constructor for class com.jgalgo.adapt.guava.GuavaMutableValueGraphAdapter: Constructs a new adapter from the given JGAlgo graph.
GuavaNetworkAdapter<V,E> - Class in com.jgalgo.adapt.guava: An adapter from a JGAlgo graph to a Guava network.
GuavaNetworkAdapter(Graph<V, E>) - Constructor for class com.jgalgo.adapt.guava.GuavaNetworkAdapter: Constructs a new adapter from the given JGAlgo graph.
GuavaNetworkWrapper<V,E> - Class in com.jgalgo.adapt.guava: An adapter from Guava Network to JGAlgo Graph.
GuavaNetworkWrapper(Network<V, E>) - Constructor for class com.jgalgo.adapt.guava.GuavaNetworkWrapper: Constructs a new adapter from the given Guava network.
GuavaNetworkWrapper(Network<V, E>, boolean) - Constructor for class com.jgalgo.adapt.guava.GuavaNetworkWrapper: Constructs a new adapter from the given Guava network.
GuavaValueGraphAdapter<V,E,ValueT> - Class in com.jgalgo.adapt.guava: An adapter from a JGAlgo graph to a Guava value graph.
GuavaValueGraphAdapter(Graph<V, E>, String) - Constructor for class com.jgalgo.adapt.guava.GuavaValueGraphAdapter: Constructs a new adapter from the given JGAlgo graph.

H

hamiltonianCycle(Graph<V, E>) - Method in interface com.jgalgo.alg.hamilton.HamiltonianPathAlgo: Find a Hamiltonian cycle in the given graph.
hamiltonianCyclesIter(Graph<V, E>) - Method in interface com.jgalgo.alg.hamilton.HamiltonianPathAlgo: Iterate over all Hamiltonian cycles in the given graph.
hamiltonianCyclesIter(Graph<V, E>) - Method in class com.jgalgo.alg.hamilton.HamiltonianPathAlgoAbstract
hamiltonianPath(Graph<V, E>) - Method in interface com.jgalgo.alg.hamilton.HamiltonianPathAlgo: Find a Hamiltonian path in the given graph.
hamiltonianPath(Graph<V, E>, V, V) - Method in interface com.jgalgo.alg.hamilton.HamiltonianPathAlgo: Find a Hamiltonian path in the given graph that start and end at two given vertices.
HamiltonianPathAlgo - Interface in com.jgalgo.alg.hamilton: Hamiltonian path/cycle algorithm.
HamiltonianPathAlgoAbstract - Class in com.jgalgo.alg.hamilton: Abstract class for computing Hamiltonian cycles/paths in graphs.
HamiltonianPathAlgoAbstract() - Constructor for class com.jgalgo.alg.hamilton.HamiltonianPathAlgoAbstract: Default constructor.
HamiltonianPathAlgoAbstractBasedCycle - Class in com.jgalgo.alg.hamilton: Abstract class for computing Hamiltonian cycles/paths in graphs, based on Hamiltonian cycle algo.
HamiltonianPathAlgoAbstractBasedCycle() - Constructor for class com.jgalgo.alg.hamilton.HamiltonianPathAlgoAbstractBasedCycle: Default constructor.
HamiltonianPathRubin - Class in com.jgalgo.alg.hamilton: Frank Rubin's algorithm for finding Hamiltonian paths in directed and undirected graphs.
HamiltonianPathRubin() - Constructor for class com.jgalgo.alg.hamilton.HamiltonianPathRubin: Create a new Hamiltonian path algorithm.
hamiltonianPathsIter(Graph<V, E>) - Method in interface com.jgalgo.alg.hamilton.HamiltonianPathAlgo: Iterate over all Hamiltonian paths in the given graph.
hamiltonianPathsIter(Graph<V, E>) - Method in class com.jgalgo.alg.hamilton.HamiltonianPathAlgoAbstract
hamiltonianPathsIter(Graph<V, E>, V, V) - Method in interface com.jgalgo.alg.hamilton.HamiltonianPathAlgo: Iterate over all Hamiltonian paths in the given graph that start and end at two given vertices.
hamiltonianPathsIter(Graph<V, E>, V, V) - Method in class com.jgalgo.alg.hamilton.HamiltonianPathAlgoAbstract
hasEdgeConnecting(EndpointPair<V>) - Method in class com.jgalgo.adapt.guava.GuavaGraphAdapter
hasEdgeConnecting(EndpointPair<V>) - Method in class com.jgalgo.adapt.guava.GuavaNetworkAdapter
hasEdgeConnecting(EndpointPair<V>) - Method in class com.jgalgo.adapt.guava.GuavaValueGraphAdapter
hasEdgeConnecting(V, V) - Method in class com.jgalgo.adapt.guava.GuavaGraphAdapter
hasEdgeConnecting(V, V) - Method in class com.jgalgo.adapt.guava.GuavaNetworkAdapter
hasEdgeConnecting(V, V) - Method in class com.jgalgo.adapt.guava.GuavaValueGraphAdapter
hashCode() - Method in class com.jgalgo.graph.AbstractGraph
hasNext() - Method in interface com.jgalgo.alg.traversal.BfsIter: Check whether there is more vertices to iterate over.
hasNext() - Method in interface com.jgalgo.alg.traversal.DfsIter: Check whether there is more vertices to iterate over.
hasNext() - Method in interface com.jgalgo.alg.traversal.RandomWalkIter: Check whether there is a vertex the iterator can advance to from the current vertex.

I

IdBuilder<K> - Interface in com.jgalgo.graph: Builder for unique identifiers of vertices or edges in a graph.
IdBuilderInt - Interface in com.jgalgo.graph: Builder for unique identifiers of vertices or edges in an IntGraph.
identityEdgesMap(IntSet) - Static method in interface com.jgalgo.graph.IndexIntIdMap: Create an identity mapping between the elements IDs and indices.
identityVerticesMap(IntSet) - Static method in interface com.jgalgo.graph.IndexIntIdMap: Create an identity mapping between the elements IDs and indices.
IDistanceMeasures - Interface in com.jgalgo.alg.distancemeasures: A set of graph distance measures for IntGraph.
idToIndex(int) - Method in interface com.jgalgo.graph.IndexIntIdMap: Get the index of an element by its ID.
idToIndex(Integer) - Method in interface com.jgalgo.graph.IndexIntIdMap: Deprecated.
Please use IndexIntIdMap.idToIndex(int) instead to avoid un/boxing.
idToIndex(K) - Method in interface com.jgalgo.graph.IndexIdMap: Get the index of an element by its identifier.
idToIndexCollection(Collection<K>, IndexIdMap<K>) - Static method in class com.jgalgo.graph.IndexIdMaps: Create an indices collection from a collection of IDs.
idToIndexIfExist(int) - Method in interface com.jgalgo.graph.IndexIntIdMap: Get the index of an element by its identifier if it exists, or -1 if it doesn't.
idToIndexIfExist(Integer) - Method in interface com.jgalgo.graph.IndexIntIdMap: Deprecated.
Please use IndexIntIdMap.idToIndexIfExist(int) instead to avoid un/boxing.
idToIndexIfExist(K) - Method in interface com.jgalgo.graph.IndexIdMap: Get the index of an element by its identifier if it exists, or -1 if it doesn't.
idToIndexIterator(Iterator<K>, IndexIdMap<K>) - Static method in class com.jgalgo.graph.IndexIdMaps: Create an indices iterator from an iterator of IDs.
idToIndexList(List<K>, IndexIdMap<K>) - Static method in class com.jgalgo.graph.IndexIdMaps: Create an indices list from a list of IDs.
idToIndexSet(Set<K>, IndexIdMap<K>) - Static method in class com.jgalgo.graph.IndexIdMaps: Create an indices set from a set of IDs.
idToIndexWeightFunc(WeightFunction<K>, IndexIdMap<K>) - 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(WeightFunctionInt<K>, IndexIdMap<K>) - Static method in class com.jgalgo.graph.IndexIdMaps: Create an integer weight function that accept elements indices, given a weight function that accept elements IDs.
idToIndexWeights(Weights<K, T>, IndexIdMap<K>) - 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.
IEdgeIter - Interface in com.jgalgo.graph: Iterator used to iterate over int graph edges.
IEdgeSet - Interface in com.jgalgo.graph: Set of int graph edges.
IFlow - Interface in com.jgalgo.alg.flow: Flow on IntGraph edges.
IMatching - Interface in com.jgalgo.alg.match: A matching in a IntGraph.
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() - Method in interface com.jgalgo.graph.IntGraph
immutableCopy(boolean, 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, boolean) - Method in interface com.jgalgo.graph.IndexGraph
immutableCopy(boolean, boolean) - Method in interface com.jgalgo.graph.IntGraph
immutableView() - Method in interface com.jgalgo.graph.Graph: Get an immutable view of this graph.
immutableView() - Method in interface com.jgalgo.graph.IndexGraph
immutableView() - Method in interface com.jgalgo.graph.IntGraph
In - com.jgalgo.alg.common.EdgeDirection: The 'In' direction include all the edges with the vertex as the target, in case of a directed graph, or as the source or the target, in case of an undirected graph.
incidentEdgeOrder() - Method in class com.jgalgo.adapt.guava.GuavaGraphAdapter
incidentEdgeOrder() - Method in class com.jgalgo.adapt.guava.GuavaValueGraphAdapter
incidentEdges(V) - Method in class com.jgalgo.adapt.guava.GuavaGraphAdapter
incidentEdges(V) - Method in class com.jgalgo.adapt.guava.GuavaNetworkAdapter
incidentEdges(V) - Method in class com.jgalgo.adapt.guava.GuavaValueGraphAdapter
incidentNodes(E) - Method in class com.jgalgo.adapt.guava.GuavaNetworkAdapter
incomingEdgesOf(V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
inDegree(V) - Method in class com.jgalgo.adapt.guava.GuavaGraphAdapter
inDegree(V) - Method in class com.jgalgo.adapt.guava.GuavaValueGraphAdapter
inDegreeOf(V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
indexGraph() - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
indexGraph() - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
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 - Class in com.jgalgo.graph: A result object of re-indexing and building a graph operation.
IndexGraphBuilder.ReIndexingMap - Class in com.jgalgo.graph: A map of indices in range \([0, n)\) to indices in range \([0, n)\).
indexGraphEdgesMap() - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
indexGraphEdgesMap() - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
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
indexGraphEdgesMap() - Method in interface com.jgalgo.graph.IntGraph
IndexGraphFactory - Interface in com.jgalgo.graph: A factory for Index graphs.
indexGraphVerticesMap() - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
indexGraphVerticesMap() - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
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
indexGraphVerticesMap() - Method in interface com.jgalgo.graph.IntGraph
IndexIdMap<K> - Interface in com.jgalgo.graph: A mapping between Graph IDs to IndexGraph indices.
IndexIdMaps - Class in com.jgalgo.graph: Static methods class for index-id maps.
IndexIntIdMap - Interface in com.jgalgo.graph: A mapping between IntGraph IDs to IndexGraph indices.
IndexRemoveListener - Interface in com.jgalgo.graph: A listener that will be notified when an IndexGraph remove a vertex or an edge.
indexToId(int) - Method in interface com.jgalgo.graph.IndexIdMap: Get the identifier of an element by its index.
indexToId(int) - Method in interface com.jgalgo.graph.IndexIntIdMap: Deprecated.
Please use IndexIntIdMap.indexToIdInt(int) instead to avoid un/boxing.
indexToIdCollection(IntCollection, IndexIdMap<K>) - Static method in class com.jgalgo.graph.IndexIdMaps: Create an IDs collection from a collection of indices.
indexToIdCollection(IntCollection, IndexIntIdMap) - Static method in class com.jgalgo.graph.IndexIdMaps: Create an int IDs collection from a collection of indices.
indexToIdEdgeIter(Graph<V, E>, IEdgeIter) - Static method in class com.jgalgo.graph.IndexIdMaps: Create an IEdgeIter that return IDs of vertices and edges from an IEdgeIter that return indices of vertices and edges.
indexToIdEdgeIter(IntGraph, IEdgeIter) - Static method in class com.jgalgo.graph.IndexIdMaps: Create an IEdgeIter that return IDs of vertices and edges from an IEdgeIter that return indices of vertices and edges.
indexToIdEdgeSet(IEdgeSet, Graph<V, E>) - Static method in class com.jgalgo.graph.IndexIdMaps: Create an edge set of IDs from an edge set of indices.
indexToIdEdgeSet(IEdgeSet, IntGraph) - Static method in class com.jgalgo.graph.IndexIdMaps: Create an edge set of IDs from an edge set of indices in an IntGraph.
indexToIdIfExist(int) - Method in interface com.jgalgo.graph.IndexIdMap: Get the identifier of an element by its index if it exists, or null if it doesn't.
indexToIdIfExist(int) - Method in interface com.jgalgo.graph.IndexIntIdMap: Deprecated.
Please use IndexIntIdMap.indexToIdIfExistInt(int) instead to avoid un/boxing.
indexToIdIfExistInt(int) - Method in interface com.jgalgo.graph.IndexIntIdMap: Get the identifier of an element by its index if it exists, or -1 if it doesn't.
indexToIdInt(int) - Method in interface com.jgalgo.graph.IndexIntIdMap: Get the ID of an element by its index.
indexToIdIterator(IntIterator, IndexIdMap<K>) - Static method in class com.jgalgo.graph.IndexIdMaps: Create an IDs iterator from an iterator of indices.
indexToIdIterator(IntIterator, IndexIntIdMap) - Static method in class com.jgalgo.graph.IndexIdMaps: Create an IDs iterator from an iterator of indices.
indexToIdList(IntList, IndexIdMap<K>) - Static method in class com.jgalgo.graph.IndexIdMaps: Create an IDs list from a list of indices.
indexToIdList(IntList, IndexIntIdMap) - Static method in class com.jgalgo.graph.IndexIdMaps: Create an IDs list from a list of indices.
indexToIdSet(IntSet, IndexIdMap<K>) - Static method in class com.jgalgo.graph.IndexIdMaps: Create an IDs set from a set of indices.
indexToIdSet(IntSet, IndexIntIdMap) - Static method in class com.jgalgo.graph.IndexIdMaps: Create an IDs set from a set of indices.
inEdges(int) - Method in interface com.jgalgo.graph.IntGraph: Get the edges whose target is target.
inEdges(Integer) - Method in interface com.jgalgo.graph.IntGraph: Deprecated.
Please use IntGraph.inEdges(int) instead to avoid un/boxing.
inEdges(V) - Method in class com.jgalgo.adapt.guava.GuavaNetworkAdapter
inEdges(V) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
inEdges(V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
inEdges(V) - Method in interface com.jgalgo.graph.Graph: Get the edges whose target is target.
initialCliqueSize(int) - Method in class com.jgalgo.gen.BarabasiAlbertGraphGenerator: Set the initial clique size of the generated graph(s).
initTree() - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorDynamic: Initialize the tree the LCA will operate on and create a root vertex.
initTree() - Method in class com.jgalgo.alg.tree.LowestCommonAncestorDynamicGabowInts
initTree() - Method in class com.jgalgo.alg.tree.LowestCommonAncestorDynamicGabowLongs
initTree() - Method in class com.jgalgo.alg.tree.LowestCommonAncestorDynamicGabowSimple
integerCosts(boolean) - Method in interface com.jgalgo.alg.flow.MinimumCostFlow.Builder: Enable/disable integer costs.
integerNetwork(boolean) - Method in interface com.jgalgo.alg.flow.MinimumCostFlow.Builder: Enable/disable integer network (capacities, flows, vertices supplies and edges flow lower bound).
integerWeights(boolean) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.Builder: Enable/disable integer weights.
IntersectionGraphGenerator<V,E> - Class in com.jgalgo.gen: Generate the intersection graph of two or more given graphs.
IntersectionGraphGenerator() - Constructor for class com.jgalgo.gen.IntersectionGraphGenerator: Create a new intersection graph generator that will use the default graph factory.
IntersectionGraphGenerator(GraphFactory<V, E>) - Constructor for class com.jgalgo.gen.IntersectionGraphGenerator: Create a new intersection graph generator that will use the given graph factory.
IntGraph - Interface in com.jgalgo.graph: A discrete graph with int vertices and edges.
IntGraphBuilder - Interface in com.jgalgo.graph: A builder for int graphs.
IntGraphFactory - Interface in com.jgalgo.graph: A factory for IntGraph objects.
intIterator() - Method in interface com.jgalgo.graph.IEdgeSet: Return an edge iterator that iterate over the edges in this set.
inverse() - Method in interface com.jgalgo.alg.isomorphism.IsomorphismIMapping
inverse() - Method in interface com.jgalgo.alg.isomorphism.IsomorphismMapping: Get the inverse mapping.
inverse() - Method in class com.jgalgo.graph.IndexGraphBuilder.ReIndexingMap: Get the inverse map of this map.
IPath - Interface in com.jgalgo.alg.common: A path of edges in an int graph.
isAllowParallelEdges() - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
isAllowParallelEdges() - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
isAllowParallelEdges() - Method in interface com.jgalgo.graph.Graph: Checks whether parallel edges are supported.
isAllowSelfEdges() - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
isAllowSelfEdges() - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
isAllowSelfEdges() - Method in interface com.jgalgo.graph.Graph: Checks whether self edges are supported.
isBipartite(Graph<V, E>) - Static method in class com.jgalgo.alg.bipartite.BipartiteGraphs: Check whether the given graph is bipartite or not.
isCardinality(WeightFunction<?>) - Static method in interface com.jgalgo.graph.WeightFunction: Check if the given weight function is the cardinality weight function.
isClosure(Graph<V, E>, Collection<V>) - Static method in interface com.jgalgo.alg.closure.ClosuresEnumerator: Check whether the given set of vertices is a closure in the given graph.
isColoring(Graph<V, E>, ToIntFunction<V>) - Static method in interface com.jgalgo.alg.color.ColoringAlgo: Check whether a given mapping is a valid coloring of a graph.
isCover(Graph<V, E>, Collection<E>) - Static method in interface com.jgalgo.alg.cover.EdgeCover: Check whether a set of edges is a edge cover of a graph.
isCover(Graph<V, E>, Collection<V>) - Static method in interface com.jgalgo.alg.cover.VertexCover: Check whether a set of vertices is a vertex cover of a graph.
isCut(Graph<V, E>, Collection<V>) - Static method in interface com.jgalgo.alg.connect.MinimumVertexCutGlobal: Check whether the given vertices form a vertex cut in the graph.
isCutVertex(int) - Method in interface com.jgalgo.alg.connect.BiConnectedComponentsAlgo.IResult: Check whether a vertex is a cut-vertex.
isCutVertex(Integer) - Method in interface com.jgalgo.alg.connect.BiConnectedComponentsAlgo.IResult: Deprecated.
Please use BiConnectedComponentsAlgo.IResult.isCutVertex(int) instead to avoid un/boxing.
isCutVertex(V) - Method in interface com.jgalgo.alg.connect.BiConnectedComponentsAlgo.Result: Check whether a vertex is a cut-vertex.
isCycle() - Method in interface com.jgalgo.alg.common.IPath
isCycle() - Method in interface com.jgalgo.alg.common.Path: Check whether this path form a cycle.
isDirected() - Method in class com.jgalgo.adapt.guava.GuavaGraphAdapter
isDirected() - Method in class com.jgalgo.adapt.guava.GuavaNetworkAdapter
isDirected() - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
isDirected() - Method in class com.jgalgo.adapt.guava.GuavaValueGraphAdapter
isDirected() - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
isDirected() - Method in interface com.jgalgo.graph.Graph: Checks whether the graph is directed.
isDirected() - Method in interface com.jgalgo.graph.GraphBuilder: Check if the graph built by this builder is directed or undirected.
isDominatingSet(Graph<V, E>, Collection<V>, EdgeDirection) - Static method in interface com.jgalgo.alg.cover.DominatingSetAlgo: Check whether a given set of vertices is a dominating set of a graph.
isEulerian(Graph<V, E>) - Method in interface com.jgalgo.alg.euler.EulerianTourAlgo: Check whether a graph is Eulerian.
isEulerianTour(Graph<V, E>, List<E>) - Static method in interface com.jgalgo.alg.euler.EulerianTourAlgo: Check if the given tour is an Eulerian tour in the given graph.
isForest(Graph<V, E>) - Static method in class com.jgalgo.alg.tree.Trees: Check if a graph is a forest.
isHamiltonianPath(Graph<V, E>, List<E>) - Static method in interface com.jgalgo.alg.hamilton.HamiltonianPathAlgo: Check whether the given path is a Hamiltonian path (or cycle) in the given graph.
isInteger(WeightFunction<?>) - Static method in interface com.jgalgo.graph.WeightFunction: Check if the given weight function is an integer weight function.
isLeft(int) - Method in interface com.jgalgo.alg.common.IVertexBiPartition: Check whether a vertex is contained in the left block (block 0).
isLeft(Integer) - Method in interface com.jgalgo.alg.common.IVertexBiPartition: Deprecated.
Please use IVertexBiPartition.isLeft(int) instead to avoid un/boxing.
isLeft(V) - Method in interface com.jgalgo.alg.common.VertexBiPartition: Check whether a vertex is contained in the left block (block 0).
isMatching(Graph<V, E>, Collection<E>) - Static method in interface com.jgalgo.alg.match.Matching: Check whether the given collection of edges form a valid matching in the graph.
isomorphicMapping(Graph<V1, E1>, Graph<V2, E2>) - Method in interface com.jgalgo.alg.isomorphism.IsomorphismTester: Get an induced sub graph isomorphism mapping between two graphs if one exists.
isomorphicMapping(Graph<V1, E1>, Graph<V2, E2>, boolean) - Method in interface com.jgalgo.alg.isomorphism.IsomorphismTester: Get a sub graph isomorphism mapping between two graphs if one exists, optionally induced.
isomorphicMappingsIter(Graph<V1, E1>, Graph<V2, E2>) - Method in interface com.jgalgo.alg.isomorphism.IsomorphismTester: Get an iterator over all the induced sub graph isomorphism mappings between two graphs.
isomorphicMappingsIter(Graph<V1, E1>, Graph<V2, E2>, boolean) - Method in interface com.jgalgo.alg.isomorphism.IsomorphismTester: Get an iterator over all the sub graph isomorphism mappings between two graphs, optionally induced.
isomorphicMappingsIter(Graph<V1, E1>, Graph<V2, E2>, boolean, BiPredicate<? super V1, ? super V2>, BiPredicate<? super E1, ? super E2>) - Method in interface com.jgalgo.alg.isomorphism.IsomorphismTester: Get an iterator over all the sub graph isomorphism mappings between two graphs, optionally induced, with vertex and/or edge matchers.
isomorphicMappingsIter(Graph<V1, E1>, Graph<V2, E2>, boolean, BiPredicate<? super V1, ? super V2>, BiPredicate<? super E1, ? super E2>) - Method in class com.jgalgo.alg.isomorphism.IsomorphismTesterAbstract
IsomorphismIMapping - Interface in com.jgalgo.alg.isomorphism: A mapping between two graphs that preserves the structure of the graphs for IntGraph.
IsomorphismMapping<V1,E1,V2,E2> - Interface in com.jgalgo.alg.isomorphism: A mapping between two graphs that preserves the structure of the graphs.
IsomorphismTester - Interface in com.jgalgo.alg.isomorphism: Tester that check whether two graphs are isomorphic.
IsomorphismTesterAbstract - Class in com.jgalgo.alg.isomorphism: Abstract class for computing isomorphism mapping between two graphs.
IsomorphismTesterAbstract() - Constructor for class com.jgalgo.alg.isomorphism.IsomorphismTesterAbstract: Default constructor.
IsomorphismTesterVf2 - Class in com.jgalgo.alg.isomorphism: Vf2 algorithm for testing isomorphism of two graphs.
IsomorphismTesterVf2() - Constructor for class com.jgalgo.alg.isomorphism.IsomorphismTesterVf2: Create a new isomorphism algorithm.
isPartition(Graph<V, E>, Predicate<V>) - Static method in interface com.jgalgo.alg.common.VertexBiPartition: Check if a mapping is a valid bi-partition of the vertices of a graph.
isPartition(Graph<V, E>, ToIntFunction<V>) - Static method in interface com.jgalgo.alg.common.VertexPartition: Check if a mapping is a valid partition of the vertices of a graph.
isPartition(IntGraph, IntPredicate) - Static method in interface com.jgalgo.alg.common.IVertexBiPartition: Check if a mapping is a valid bi-partition of the vertices of a graph.
isPartition(IntGraph, IntUnaryOperator) - Static method in interface com.jgalgo.alg.common.IVertexPartition: Check if a mapping is a valid partition of the vertices of a graph.
isPath(Graph<V, E>, V, V, List<E>) - Static method in interface com.jgalgo.alg.common.Path: Check whether the given edge list is a valid path in the given graph.
isPath(IntGraph, int, int, IntList) - Static method in interface com.jgalgo.alg.common.IPath: Check whether the given edge list is a valid path in the given graph.
isPerfect() - Method in interface com.jgalgo.alg.match.Matching: Check whether this matching is perfect.
isRight(int) - Method in interface com.jgalgo.alg.common.IVertexBiPartition: Check whether a vertex is contained in the right block (block 1).
isRight(Integer) - Method in interface com.jgalgo.alg.common.IVertexBiPartition: Deprecated.
Please use IVertexBiPartition.isRight(int) instead to avoid un/boxing.
isRight(V) - Method in interface com.jgalgo.alg.common.VertexBiPartition: Check whether a vertex is contained in the right block (block 1).
isSimple() - Method in interface com.jgalgo.alg.common.Path: Check whether this path is simple.
isSpanningForest(Graph<V, E>, Collection<E>) - Static method in interface com.jgalgo.alg.span.MinimumSpanningTree: Check whether a given set of edges is a spanning forest of a given graph.
isSpanningTree(Graph<V, E>, Collection<E>) - Static method in interface com.jgalgo.alg.span.MinimumSpanningTree: Check whether a given set of edges is a spanning tree of a given graph.
isSteinerTree(Graph<V, E>, Collection<V>, Collection<E>) - Static method in interface com.jgalgo.alg.span.SteinerTreeAlgo: Check whether a given set of edges is a valid Steiner tree for a given graph and terminals.
isStronglyConnected(Graph<V, E>) - Method in interface com.jgalgo.alg.connect.StronglyConnectedComponentsAlgo: Check whether a graph is strongly connected.
isStronglyConnected(Graph<V, E>) - Method in class com.jgalgo.alg.connect.StronglyConnectedComponentsAlgoAbstract
isTree(Graph<V, E>) - Static method in class com.jgalgo.alg.tree.Trees: Check if an undirected graph is a tree.
isTree(Graph<V, E>, V) - Static method in class com.jgalgo.alg.tree.Trees: Check if a graph is a tree rooted as some vertex.
isVertexMatched(int) - Method in interface com.jgalgo.alg.match.IMatching: Check whether a vertex is matched by the matching.
isVertexMatched(Integer) - Method in interface com.jgalgo.alg.match.IMatching: Deprecated.
Please use IMatching.isVertexMatched(int) instead to avoid un/boxing.
isVertexMatched(V) - Method in interface com.jgalgo.alg.match.Matching: Check whether a vertex is matched by the matching.
isWeaklyConnected(Graph<V, E>) - Method in interface com.jgalgo.alg.connect.WeaklyConnectedComponentsAlgo: Check whether a graph is weakly connected.
isWeaklyConnected(Graph<V, E>) - Method in class com.jgalgo.alg.connect.WeaklyConnectedComponentsAlgoAbstract
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.graph.IEdgeSet: Return an edge iterator that iterate over the edges in this set.
IVertexBiPartition - Interface in com.jgalgo.alg.common: A partition of the vertices of an int graph into two blocks.
IVertexPartition - Interface in com.jgalgo.alg.common: A partition of the vertices of an int graph.
IWeightFunction - Interface in com.jgalgo.graph: Weight function that maps graph edges or vertices of IntGraph to weights.
IWeightFunctionInt - Interface in com.jgalgo.graph: Weight function that maps graph edges or vertices of IntGraph to integer weights.
IWeights<T> - Interface in com.jgalgo.graph: Weights of int graph vertices or edges.
IWeightsBool - Interface in com.jgalgo.graph: Specific weights of boolean for int graphs.
IWeightsByte - Interface in com.jgalgo.graph: Specific weights of byte for int graphs.
IWeightsChar - Interface in com.jgalgo.graph: Specific weights of char for int graphs.
IWeightsDouble - Interface in com.jgalgo.graph: Specific weights of double for int graphs.
IWeightsFloat - Interface in com.jgalgo.graph: Specific weights of float for int graphs.
IWeightsInt - Interface in com.jgalgo.graph: Specific weights of int for int graphs.
IWeightsLong - Interface in com.jgalgo.graph: Specific weights of long for int graphs.
IWeightsObj<T> - Interface in com.jgalgo.graph: Specific weights of Object for int graphs.
IWeightsShort - Interface in com.jgalgo.graph: Specific weights of short for int graphs.

J

JGAlgoConfig - Class in com.jgalgo: A global configuration class.
JGraphTAdapter<V,E> - Class in com.jgalgo.adapt.jgrapht: An adapter from JGAlgo graph to JGraphT graph.
JGraphTAdapter(Graph<V, E>) - Constructor for class com.jgalgo.adapt.jgrapht.JGraphTAdapter: Constructs a new unweighted adapter from the given JGAlgo graph.
JGraphTAdapter(Graph<V, E>, String) - Constructor for class com.jgalgo.adapt.jgrapht.JGraphTAdapter: Constructs a new adapter from the given JGAlgo graph, optionally weighted.
JGraphTWrapper<V,E> - Class in com.jgalgo.adapt.jgrapht: An adapter from JGraphT graph to JGAlgo graph.
JGraphTWrapper(Graph<V, E>) - Constructor for class com.jgalgo.adapt.jgrapht.JGraphTWrapper: Constructs a new adapter from the given JGraphT graph without weights.
JGraphTWrapper(Graph<V, E>, String) - Constructor for class com.jgalgo.adapt.jgrapht.JGraphTWrapper: Constructs a new adapter from the given JGraphT graph optionally with weights.

K

KEdgeConnectedComponentsAlgo - Interface in com.jgalgo.alg.connect: An algorithm that compute the k-edge connected components of a graph.
KEdgeConnectedComponentsAlgoAbstract - Class in com.jgalgo.alg.connect: Abstract class for k-edge connected components algorithms.
KEdgeConnectedComponentsAlgoAbstract() - Constructor for class com.jgalgo.alg.connect.KEdgeConnectedComponentsAlgoAbstract: Default constructor.
KEdgeConnectedComponentsWang - Class in com.jgalgo.alg.connect: Wang's algorithm for computing the k-edge connected components of a graph.
KEdgeConnectedComponentsWang() - Constructor for class com.jgalgo.alg.connect.KEdgeConnectedComponentsWang: Constructs a new instance of the algorithm.
keepEdgesIds(boolean) - Method in class com.jgalgo.io.Digraph6GraphWriter: Enable or disable keeping the edges ids.
keepEdgesIds(boolean) - Method in class com.jgalgo.io.Graph6GraphWriter: Enable or disable keeping the edges ids.
keepEdgesIds(boolean) - Method in class com.jgalgo.io.Sparse6GraphWriter: Enable or disable keeping the edges ids.
KShortestPathsSt - Interface in com.jgalgo.alg.shortestpath: An algorithm for computing the K shortest paths between two vertices in a graph.
KShortestPathsStAbstract - Class in com.jgalgo.alg.shortestpath: Abstract class for computing the k-shortest paths in graphs.
KShortestPathsStAbstract() - Constructor for class com.jgalgo.alg.shortestpath.KShortestPathsStAbstract: Default constructor.
KShortestPathsStBasedPathsTree - Class in com.jgalgo.alg.shortestpath: A base class for computing the k-shortest paths from a source vertex to a target vertex in a graph using the compressed paths tree data structure.
KShortestPathsStBasedPathsTree() - Constructor for class com.jgalgo.alg.shortestpath.KShortestPathsStBasedPathsTree: Default constructor.
KShortestPathsStHershbergerMaxelSuri - Class in com.jgalgo.alg.shortestpath: Hershberger, Maxel and Suri algorithm for K shortest simple paths in directed graphs.
KShortestPathsStHershbergerMaxelSuri() - Constructor for class com.jgalgo.alg.shortestpath.KShortestPathsStHershbergerMaxelSuri: Create a new instance of the algorithm.
KShortestPathsStKatohIbarakiMine - Class in com.jgalgo.alg.shortestpath: Katoh, Ibaraki and Mine algorithm for K shortest simple paths in undirected graphs.
KShortestPathsStKatohIbarakiMine() - Constructor for class com.jgalgo.alg.shortestpath.KShortestPathsStKatohIbarakiMine: Create a new instance of the algorithm.
KShortestPathsStYen - Class in com.jgalgo.alg.shortestpath: Yen's algorithm for computing the K shortest paths between two vertices in a graph.
KShortestPathsStYen() - Constructor for class com.jgalgo.alg.shortestpath.KShortestPathsStYen: Create a new instance of the algorithm.
KVertexConnectedComponentsAlgo - Interface in com.jgalgo.alg.connect: Finds the k-vertex connected components of a graph.
KVertexConnectedComponentsAlgoAbstract - Class in com.jgalgo.alg.connect: Abstract class for k-vertex connected components algorithms.
KVertexConnectedComponentsAlgoAbstract() - Constructor for class com.jgalgo.alg.connect.KVertexConnectedComponentsAlgoAbstract: Default constructor.
KVertexConnectedComponentsWhiteMoody - Class in com.jgalgo.alg.connect: White-Moody algorithm for finding k-vertex-connected components in an undirected graph.
KVertexConnectedComponentsWhiteMoody() - Constructor for class com.jgalgo.alg.connect.KVertexConnectedComponentsWhiteMoody: Create a new instance of the algorithm.

L

lastEdge() - Method in interface com.jgalgo.alg.traversal.BfsIter.Int: Deprecated.
Please use BfsIter.Int.lastEdgeInt() instead to avoid un/boxing.
lastEdge() - Method in interface com.jgalgo.alg.traversal.BfsIter: Get the edge that led to the last vertex returned by BfsIter.next().
lastEdge() - Method in interface com.jgalgo.alg.traversal.RandomWalkIter.Int: Deprecated.
Please use RandomWalkIter.Int.lastEdgeInt() instead to avoid un/boxing.
lastEdge() - Method in interface com.jgalgo.alg.traversal.RandomWalkIter: Get the edge that led to the last vertex returned by RandomWalkIter.next().
lastEdgeInt() - Method in interface com.jgalgo.alg.traversal.BfsIter.Int: Get the edge that led to the last vertex returned by BfsIter.Int.nextInt().
lastEdgeInt() - Method in interface com.jgalgo.alg.traversal.RandomWalkIter.Int: Get the edge that led to the last vertex returned by RandomWalkIter.Int.nextInt().
layer() - Method in interface com.jgalgo.alg.traversal.BfsIter: Get the layer of the last vertex returned by BfsIter.next().
LedaGraphReader - Class in com.jgalgo.io: Read a graph in 'LEDA' format.
LedaGraphReader() - Constructor for class com.jgalgo.io.LedaGraphReader: Create a new reader.
LedaGraphWriter - Class in com.jgalgo.io: Write a graph in 'LEDA' format.
LedaGraphWriter() - Constructor for class com.jgalgo.io.LedaGraphWriter: Create a new writer.
leftEdges() - Method in interface com.jgalgo.alg.common.IVertexBiPartition
leftEdges() - Method in interface com.jgalgo.alg.common.VertexBiPartition: Get the edges that are contained in the left block.
leftVertices() - Method in interface com.jgalgo.alg.common.IVertexBiPartition
leftVertices() - Method in interface com.jgalgo.alg.common.VertexBiPartition: Get the vertices in the 'left' block.
LineGraphGenerator<V,E> - Class in com.jgalgo.gen: Generates the line graph given an existing graph.
LineGraphGenerator() - Constructor for class com.jgalgo.gen.LineGraphGenerator: Create a new line graph generator that will use the default graph factory.
LineGraphGenerator(GraphFactory<V, E>) - Constructor for class com.jgalgo.gen.LineGraphGenerator: Create a new line graph generator that will use the given graph factory.
localEdgeWeightFunction(IndexGraph, IWeightFunction) - Static method in class com.jgalgo.graph.WeightFunctions: Get a 'local' version of a given weight function.
localEdgeWeightFunction(IndexGraph, IWeightFunctionInt) - Static method in class com.jgalgo.graph.WeightFunctions: Get a 'local' version of a given weight function.
LowestCommonAncestorDynamic - Interface in com.jgalgo.alg.tree: Dynamic algorithm for Lowest Common Ancestor (LCA) queries.
LowestCommonAncestorDynamic.Vertex - Interface in com.jgalgo.alg.tree: A tree vertex in an LowestCommonAncestorDynamic data structure.
LowestCommonAncestorDynamicGabowInts - Class in com.jgalgo.alg.tree: Gabow linear dynamic LCA data structure with 32bit word operations.
LowestCommonAncestorDynamicGabowInts() - Constructor for class com.jgalgo.alg.tree.LowestCommonAncestorDynamicGabowInts: Create a new dynamic LCA data structure that contains zero vertices.
LowestCommonAncestorDynamicGabowLongs - Class in com.jgalgo.alg.tree: Gabow linear dynamic LCA data structure with 64bit word operations.
LowestCommonAncestorDynamicGabowLongs() - Constructor for class com.jgalgo.alg.tree.LowestCommonAncestorDynamicGabowLongs: Create a new dynamic LCA data structure that contains zero vertices.
LowestCommonAncestorDynamicGabowSimple - Class in com.jgalgo.alg.tree: Gabow implementation for dynamic LCA data structure with \(O(\log^2 n)\) amortized time for addLeaf() operation.
LowestCommonAncestorDynamicGabowSimple() - Constructor for class com.jgalgo.alg.tree.LowestCommonAncestorDynamicGabowSimple: Create a new dynamic LCA data structure that contains zero vertices.
LowestCommonAncestorExample - Class in com.jgalgo.example: This example demonstrates how to use the lowest common ancestor algorithm.
LowestCommonAncestorOffline - Interface in com.jgalgo.alg.tree: An algorithm for computing the lowest common ancestor (LCA) of two vertices in a tree, offline.
LowestCommonAncestorOffline.IQueries - Interface in com.jgalgo.alg.tree: Queries container for LowestCommonAncestorOffline computations for IntGraph.
LowestCommonAncestorOffline.IResult - Interface in com.jgalgo.alg.tree: Result of a LowestCommonAncestorOffline computation for IntGraph.
LowestCommonAncestorOffline.Queries<V,E> - Interface in com.jgalgo.alg.tree: Queries container for LowestCommonAncestorOffline computations.
LowestCommonAncestorOffline.Result<V,E> - Interface in com.jgalgo.alg.tree: Result of a LowestCommonAncestorOffline computation.
LowestCommonAncestorOfflineAbstract - Class in com.jgalgo.alg.tree: Abstract class for offline LCA computation.
LowestCommonAncestorOfflineAbstract() - Constructor for class com.jgalgo.alg.tree.LowestCommonAncestorOfflineAbstract: Default constructor.
LowestCommonAncestorOfflineUnionFind - Class in com.jgalgo.alg.tree: Offline LCA algorithm based on Union-Find data structure.
LowestCommonAncestorOfflineUnionFind() - Constructor for class com.jgalgo.alg.tree.LowestCommonAncestorOfflineUnionFind: Create a new offline LCA algorithm object.
LowestCommonAncestorStatic - Interface in com.jgalgo.alg.tree: Static Lowest Common Ancestor (LCA) algorithm.
LowestCommonAncestorStatic.DataStructure<V,E> - Interface in com.jgalgo.alg.tree: Data structure result created from a static LCA pre-processing.
LowestCommonAncestorStatic.IDataStructure - Interface in com.jgalgo.alg.tree: Data structure result created from a static LCA pre-processing for IntGraph.
LowestCommonAncestorStaticAbstract - Class in com.jgalgo.alg.tree: Abstract class for static LCA data structures.
LowestCommonAncestorStaticAbstract() - Constructor for class com.jgalgo.alg.tree.LowestCommonAncestorStaticAbstract: Default constructor.
LowestCommonAncestorStaticRmq - Class in com.jgalgo.alg.tree: Static LCA implementation using RMQ.
LowestCommonAncestorStaticRmq() - Constructor for class com.jgalgo.alg.tree.LowestCommonAncestorStaticRmq: Create a new static LCA algorithm object.

M

main(String[]) - Static method in class com.jgalgo.example.BfsDfsExample: Main function that runs the examples.
main(String[]) - Static method in class com.jgalgo.example.ColoringExample: Main function that runs the examples.
main(String[]) - Static method in class com.jgalgo.example.EdgeIterationExample: Main function that runs the examples.
main(String[]) - Static method in class com.jgalgo.example.LowestCommonAncestorExample: Main function that runs the examples.
main(String[]) - Static method in class com.jgalgo.example.MaximumMatchingExample: Main function that runs the examples.
main(String[]) - Static method in class com.jgalgo.example.MinimumSpanningTreeExample: Main function that runs the examples.
main(String[]) - Static method in class com.jgalgo.example.ShortestPathExample: Main function that runs the examples.
map(int) - Method in class com.jgalgo.graph.IndexGraphBuilder.ReIndexingMap: Map an element's index to its re-indexed index.
mapEdge(int) - Method in interface com.jgalgo.alg.isomorphism.IsomorphismIMapping: Map an edge from the first graph to an edge of the second graph.
mapEdge(E1) - Method in interface com.jgalgo.alg.isomorphism.IsomorphismMapping: Map an edge from the first graph to an edge of the second graph.
mapEdge(Integer) - Method in interface com.jgalgo.alg.isomorphism.IsomorphismIMapping: Deprecated.
Please use IsomorphismIMapping.mapEdge(int) instead to avoid un/boxing.
mappedEdges() - Method in interface com.jgalgo.alg.isomorphism.IsomorphismIMapping
mappedEdges() - Method in interface com.jgalgo.alg.isomorphism.IsomorphismMapping: Get the set of the edges that are mapped out of all the edges of the source graph.
mappedVertices() - Method in interface com.jgalgo.alg.isomorphism.IsomorphismIMapping
mappedVertices() - Method in interface com.jgalgo.alg.isomorphism.IsomorphismMapping: Get the set of the vertices that are mapped out of all the vertices of the source graph.
mapVertex(int) - Method in interface com.jgalgo.alg.isomorphism.IsomorphismIMapping: Map a vertex from the first graph to a vertex of the second graph.
mapVertex(Integer) - Method in interface com.jgalgo.alg.isomorphism.IsomorphismIMapping: Deprecated.
Please use IsomorphismIMapping.mapVertex(int) instead to avoid un/boxing.
mapVertex(V1) - Method in interface com.jgalgo.alg.isomorphism.IsomorphismMapping: Map a vertex from the first graph to a vertex of the second graph.
matchedVertices() - Method in interface com.jgalgo.alg.match.IMatching
matchedVertices() - Method in interface com.jgalgo.alg.match.Matching: Get all the vertices matched by the matching.
Matching<V,E> - Interface in com.jgalgo.alg.match: A matching in a graph.
MatchingAlgo - Interface in com.jgalgo.alg.match: Maximum/minimum matching algorithm.
MatchingAlgo.Builder - Interface in com.jgalgo.alg.match: A builder for MatchingAlgo objects.
MatchingAlgoAbstract - Class in com.jgalgo.alg.match: Abstract class for computing matchings in graphs.
MatchingAlgoAbstract() - Constructor for class com.jgalgo.alg.match.MatchingAlgoAbstract: Default constructor.
MatchingAlgoAbstractBasedMaximum - Class in com.jgalgo.alg.match: Abstract class for computing matching in graphs, based on a maximum matching solution.
MatchingAlgoAbstractBasedMaximum() - Constructor for class com.jgalgo.alg.match.MatchingAlgoAbstractBasedMaximum: Default constructor.
MatchingAlgoAbstractBasedMinimum - Class in com.jgalgo.alg.match: Abstract class for computing matching in graphs, based on a minimum matching solution.
MatchingAlgoAbstractBasedMinimum() - Constructor for class com.jgalgo.alg.match.MatchingAlgoAbstractBasedMinimum: Default constructor.
MatchingAlgoAbstractCardinality - Class in com.jgalgo.alg.match: Abstract class for computing (only) cardinality matching in a graph.
MatchingAlgoAbstractCardinality() - Constructor for class com.jgalgo.alg.match.MatchingAlgoAbstractCardinality: Default constructor.
MatchingCardinalityBipartiteHopcroftKarp - Class in com.jgalgo.alg.match: Hopcroft–Karp maximum unweighted matching algorithm for undirected bipartite graphs.
MatchingCardinalityBipartiteHopcroftKarp() - Constructor for class com.jgalgo.alg.match.MatchingCardinalityBipartiteHopcroftKarp: Create a new maximum matching object.
MatchingCardinalityGabow1976 - Class in com.jgalgo.alg.match: Gabow's implementation of Endmond's algorithm for cardinality maximum matching in general graphs.
MatchingCardinalityGabow1976() - Constructor for class com.jgalgo.alg.match.MatchingCardinalityGabow1976: Create a new maximum matching object.
MatchingWeightedBipartiteHungarianMethod - Class in com.jgalgo.alg.match: Kuhn's Hungarian method for maximum weighted matching in bipartite graphs.
MatchingWeightedBipartiteHungarianMethod() - Constructor for class com.jgalgo.alg.match.MatchingWeightedBipartiteHungarianMethod: Create a new maximum weighted matching object.
MatchingWeightedBipartiteSssp - Class in com.jgalgo.alg.match: Maximum weighted matching algorithm using ShortestPathSingleSource for bipartite graphs.
MatchingWeightedBipartiteSssp() - Constructor for class com.jgalgo.alg.match.MatchingWeightedBipartiteSssp: Create a new maximum weighted matching object.
MatchingWeightedBlossomV - Class in com.jgalgo.alg.match: Blossom V implementation for maximum weighted matching.
MatchingWeightedBlossomV() - Constructor for class com.jgalgo.alg.match.MatchingWeightedBlossomV: Create a new minimum weighted matching object.
MatchingWeightedGabow1990 - Class in com.jgalgo.alg.match: Edmonds' Blossom algorithm for Maximum weighted matching with Gabow's dynamic LCA data structure.
MatchingWeightedGabow1990() - Constructor for class com.jgalgo.alg.match.MatchingWeightedGabow1990: Create a new maximum weighted matching object.
MatchingWeightedGabow1990Simpler - Class in com.jgalgo.alg.match: Edmonds' Blossom algorithm for Maximum weighted matching with Gabow's implementation WITHOUT dynamic LCA data structure.
MatchingWeightedGabow1990Simpler() - Constructor for class com.jgalgo.alg.match.MatchingWeightedGabow1990Simpler: Create a new maximum weighted matching object.
maxCore() - Method in interface com.jgalgo.alg.cores.CoresAlgo.Result: The maximum core number of the graph.
maxDistance(double) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.Builder: Set the maximum distance that should be supported.
MaximalCliquesEnumerator - Interface in com.jgalgo.alg.clique: Algorithm for enumerating over all maximal cliques in a graph.
MaximalCliquesEnumeratorAbstract - Class in com.jgalgo.alg.clique: Abstract class for enumerating over all maximal cliques in a graph.
MaximalCliquesEnumeratorAbstract() - Constructor for class com.jgalgo.alg.clique.MaximalCliquesEnumeratorAbstract: Default constructor.
MaximalCliquesEnumeratorBronKerbosch - Class in com.jgalgo.alg.clique: The Bron-Kerbosch algorithm for Maximal cliques.
MaximalCliquesEnumeratorBronKerbosch() - Constructor for class com.jgalgo.alg.clique.MaximalCliquesEnumeratorBronKerbosch: Create a new instance of the algorithm.
MaximalCliquesEnumeratorBronKerboschPivot - Class in com.jgalgo.alg.clique: The Bron-Kerbosch algorithm for Maximal cliques with the pivot heuristic.
MaximalCliquesEnumeratorBronKerboschPivot() - Constructor for class com.jgalgo.alg.clique.MaximalCliquesEnumeratorBronKerboschPivot: Create a new instance of the algorithm.
maximalCliquesIter(Graph<V, E>) - Method in interface com.jgalgo.alg.clique.MaximalCliquesEnumerator: Iterate over all maximal cliques in a graph.
maximalCliquesIter(Graph<V, E>) - Method in class com.jgalgo.alg.clique.MaximalCliquesEnumeratorAbstract
MaximalIndependentSetsEnumerator - Interface in com.jgalgo.alg.clique: Algorithm for enumerating over all maximal independent sets in a graph.
MaximalIndependentSetsEnumeratorAbstract - Class in com.jgalgo.alg.clique: Abstract class for enumerating over all maximal independent sets in a graph.
MaximalIndependentSetsEnumeratorAbstract() - Constructor for class com.jgalgo.alg.clique.MaximalIndependentSetsEnumeratorAbstract: Default constructor.
MaximalIndependentSetsEnumeratorComplementCliques - Class in com.jgalgo.alg.clique: Compute the maximal independent sets of a graph by computing the maximal cliques of the complement graph.
MaximalIndependentSetsEnumeratorComplementCliques() - Constructor for class com.jgalgo.alg.clique.MaximalIndependentSetsEnumeratorComplementCliques: Create a new instance of the algorithm.
maximalIndependentSetsIter(Graph<V, E>) - Method in interface com.jgalgo.alg.clique.MaximalIndependentSetsEnumerator: Iterate over all maximal independent sets in a graph.
maximalIndependentSetsIter(Graph<V, E>) - Method in class com.jgalgo.alg.clique.MaximalIndependentSetsEnumeratorAbstract
MaximumFlow - Interface in com.jgalgo.alg.flow: Calculate the maximum flow in a flow network.
MaximumFlowAbstract - Class in com.jgalgo.alg.flow: Abstract class for computing a maximum flow in a graph.
MaximumFlowAbstract() - Constructor for class com.jgalgo.alg.flow.MaximumFlowAbstract: Default constructor.
MaximumFlowAbstractWithoutResidualNet - Class in com.jgalgo.alg.flow: Abstract class for computing a maximum flow in a graph without using a residual network.
MaximumFlowAbstractWithoutResidualNet() - Constructor for class com.jgalgo.alg.flow.MaximumFlowAbstractWithoutResidualNet: Default constructor.
MaximumFlowAbstractWithResidualNet - Class in com.jgalgo.alg.flow: Abstract class for computing a maximum flow in a graph with a residual network.
MaximumFlowAbstractWithResidualNet() - Constructor for class com.jgalgo.alg.flow.MaximumFlowAbstractWithResidualNet: Default constructor.
MaximumFlowDinic - Class in com.jgalgo.alg.flow: Dinic's algorithm for maximum flow.
MaximumFlowDinic() - Constructor for class com.jgalgo.alg.flow.MaximumFlowDinic: Create a new maximum flow algorithm object.
MaximumFlowDinicDynamicTrees - Class in com.jgalgo.alg.flow: Dinic's algorithm for maximum flow using dynamic trees.
MaximumFlowDinicDynamicTrees() - Constructor for class com.jgalgo.alg.flow.MaximumFlowDinicDynamicTrees: Create a new maximum flow algorithm object.
MaximumFlowEdmondsKarp - Class in com.jgalgo.alg.flow: The Edmonds-Karp algorithm for maximum flow.
MaximumFlowEdmondsKarp() - Constructor for class com.jgalgo.alg.flow.MaximumFlowEdmondsKarp: Create a new maximum flow algorithm object.
MaximumFlowPushRelabel - Class in com.jgalgo.alg.flow: The push-relabel maximum flow algorithm with FIFO ordering.
MaximumFlowPushRelabelDynamicTrees - Class in com.jgalgo.alg.flow: The push relabel algorithm for maximum flow using dynamic trees.
MaximumFlowPushRelabelDynamicTrees() - Constructor for class com.jgalgo.alg.flow.MaximumFlowPushRelabelDynamicTrees: Create a new maximum flow algorithm object.
maximumMatchingExample() - Static method in class com.jgalgo.example.MaximumMatchingExample: This example demonstrates how to use the maximum matching algorithm.
MaximumMatchingExample - Class in com.jgalgo.example: This example demonstrates how to use the maximum matching algorithm.
MinimumCostFlow - Interface in com.jgalgo.alg.flow: Compute the minimum-cost (max) flow in a flow network.
MinimumCostFlow.Builder - Interface in com.jgalgo.alg.flow: A builder for MinimumCostFlow objects.
MinimumCostFlowAbstract - Class in com.jgalgo.alg.flow: Abstract class for computing minimum cost flow in a graph.
MinimumCostFlowAbstract() - Constructor for class com.jgalgo.alg.flow.MinimumCostFlowAbstract: Default constructor.
MinimumCostFlowAbstractBasedSourceSink - Class in com.jgalgo.alg.flow: Abstract class for computing a minimum cost flow in a graph, based on a source-sink solution.
MinimumCostFlowAbstractBasedSourceSink() - Constructor for class com.jgalgo.alg.flow.MinimumCostFlowAbstractBasedSourceSink: Default constructor.
MinimumCostFlowAbstractBasedSupply - Class in com.jgalgo.alg.flow: Abstract class for computing a minimum cost flow in a graph, based on a supply solution.
MinimumCostFlowAbstractBasedSupply() - Constructor for class com.jgalgo.alg.flow.MinimumCostFlowAbstractBasedSupply: Default constructor.
MinimumCostFlowCostScaling - Class in com.jgalgo.alg.flow: Minimum-cost flow computation using the cost-scaling algorithm with partial-augmentations push-relabel variant.
MinimumCostFlowCostScaling() - Constructor for class com.jgalgo.alg.flow.MinimumCostFlowCostScaling: Create a new minimum-cost flow algorithm object.
MinimumCostFlowCycleCanceling - Class in com.jgalgo.alg.flow: Compute the minimum-cost (max) flow in a flow network using cycle canceling.
MinimumCostFlowCycleCanceling() - Constructor for class com.jgalgo.alg.flow.MinimumCostFlowCycleCanceling: Create a new minimum-cost flow algorithm object.
minimumCutsIter(Graph<V, E>, WeightFunction<E>, V, V) - Method in interface com.jgalgo.alg.connect.MinimumEdgeCutAllSt: Iterate over all the minimum edge-cuts in a graph between two terminal vertices.
minimumCutsIter(Graph<V, E>, WeightFunction<E>, V, V) - Method in class com.jgalgo.alg.connect.MinimumEdgeCutAllStAbstract
minimumCutsIter(Graph<V, E>, WeightFunction<V>) - Method in interface com.jgalgo.alg.connect.MinimumVertexCutAllGlobal: Iterate over all the minimum vertex-cuts in a graph.
minimumCutsIter(Graph<V, E>, WeightFunction<V>) - Method in class com.jgalgo.alg.connect.MinimumVertexCutAllGlobalAbstract
minimumCutsIter(Graph<V, E>, WeightFunction<V>, V, V) - Method in interface com.jgalgo.alg.connect.MinimumVertexCutAllSt: Iterate over all the minimum vertex-cuts in a graph between two terminal vertices.
minimumCutsIter(Graph<V, E>, WeightFunction<V>, V, V) - Method in class com.jgalgo.alg.connect.MinimumVertexCutAllStAbstract
MinimumDirectedSpanningTree - Interface in com.jgalgo.alg.span: Minimum spanning tree algorithm for directed graphs.
MinimumDirectedSpanningTreeAbstract - Class in com.jgalgo.alg.span: Abstract class for computing minimum spanning trees in directed graphs.
MinimumDirectedSpanningTreeAbstract() - Constructor for class com.jgalgo.alg.span.MinimumDirectedSpanningTreeAbstract: Default constructor.
MinimumDirectedSpanningTreeTarjan - Class in com.jgalgo.alg.span: Tarjan's minimum directed spanning tree algorithm.
MinimumDirectedSpanningTreeTarjan() - Constructor for class com.jgalgo.alg.span.MinimumDirectedSpanningTreeTarjan: Construct a new MDST algorithm object.
MinimumEdgeCutAllSt - Interface in com.jgalgo.alg.connect: Minimum Edge-Cut algorithm that finds all minimum edge-cuts in a graph between two terminal vertices (source-sink, S-T).
MinimumEdgeCutAllStAbstract - Class in com.jgalgo.alg.connect: Abstract class for computing all minimum edge cuts between two terminal nodes.
MinimumEdgeCutAllStAbstract() - Constructor for class com.jgalgo.alg.connect.MinimumEdgeCutAllStAbstract: Default constructor.
MinimumEdgeCutAllStPicardQueyranne - Class in com.jgalgo.alg.connect: Picard-Queyranne algorithm for enumerating all the minimum edge cuts between two terminal nodes.
MinimumEdgeCutAllStPicardQueyranne() - Constructor for class com.jgalgo.alg.connect.MinimumEdgeCutAllStPicardQueyranne: Create a new instance of the algorithm.
MinimumEdgeCutGlobal - Interface in com.jgalgo.alg.connect: Global Minimum Edge-Cut algorithm without terminal vertices.
MinimumEdgeCutGlobalAbstract - Class in com.jgalgo.alg.connect: Abstract class for computing the global minimum edge cut in a graph.
MinimumEdgeCutGlobalAbstract() - Constructor for class com.jgalgo.alg.connect.MinimumEdgeCutGlobalAbstract: Default constructor.
MinimumEdgeCutGlobalStoerWagner - Class in com.jgalgo.alg.connect: Stoer-Wagner Algorithm for global minimum cut.
MinimumEdgeCutGlobalStoerWagner() - Constructor for class com.jgalgo.alg.connect.MinimumEdgeCutGlobalStoerWagner: Create a new instance of the algorithm.
MinimumEdgeCutSt - Interface in com.jgalgo.alg.connect: Minimum Edge-Cut algorithm with terminal vertices (source-sink, S-T).
MinimumEdgeCutStAbstract - Class in com.jgalgo.alg.connect: Abstract class for computing the minimum edge cut between two vertices in a graph.
MinimumEdgeCutStAbstract() - Constructor for class com.jgalgo.alg.connect.MinimumEdgeCutStAbstract: Default constructor.
MinimumMeanCycle - Interface in com.jgalgo.alg.cycle: Algorithm that find the cycle with the minimum mean weight.
MinimumMeanCycleAbstract - Class in com.jgalgo.alg.cycle: Abstract class for computing the cycle with minimum mean weight in a graph.
MinimumMeanCycleAbstract() - Constructor for class com.jgalgo.alg.cycle.MinimumMeanCycleAbstract: Default constructor.
MinimumMeanCycleDasdanGupta - Class in com.jgalgo.alg.cycle: Dasdan and Gupta algorithm for minimum mean cycle.
MinimumMeanCycleDasdanGupta() - Constructor for class com.jgalgo.alg.cycle.MinimumMeanCycleDasdanGupta: Create a new minimum mean cycle algorithm.
MinimumMeanCycleHoward - Class in com.jgalgo.alg.cycle: Howard's algorithm for minimum mean cycle detection.
MinimumMeanCycleHoward() - Constructor for class com.jgalgo.alg.cycle.MinimumMeanCycleHoward: Create a new minimum mean cycle algorithm.
MinimumSpanningTree - Interface in com.jgalgo.alg.span: Minimum spanning tree algorithm.
MinimumSpanningTree.IResult - Interface in com.jgalgo.alg.span: A result object for MinimumSpanningTree computation for IntGraph.
MinimumSpanningTree.Result<V,E> - Interface in com.jgalgo.alg.span: A result object for MinimumSpanningTree computation.
MinimumSpanningTreeAbstract - Class in com.jgalgo.alg.span: Abstract class for computing a minimum spanning trees in undirected graphs.
MinimumSpanningTreeAbstract() - Constructor for class com.jgalgo.alg.span.MinimumSpanningTreeAbstract: Default constructor.
MinimumSpanningTreeBoruvka - Class in com.jgalgo.alg.span: Boruvka minimum spanning tree algorithm.
MinimumSpanningTreeBoruvka() - Constructor for class com.jgalgo.alg.span.MinimumSpanningTreeBoruvka: Construct a new MST algorithm object.
MinimumSpanningTreeExample - Class in com.jgalgo.example: This example demonstrates how to use the minimum spanning tree algorithm.
MinimumSpanningTreeFredmanTarjan - Class in com.jgalgo.alg.span: Fredman and Tarjan’s minimum spanning tree algorithm.
MinimumSpanningTreeFredmanTarjan() - Constructor for class com.jgalgo.alg.span.MinimumSpanningTreeFredmanTarjan: Construct a new MST algorithm object.
MinimumSpanningTreeKargerKleinTarjan - Class in com.jgalgo.alg.span: Karger, Klein and Tarjan randomized linear minimum spanning tree algorithm
MinimumSpanningTreeKargerKleinTarjan() - Constructor for class com.jgalgo.alg.span.MinimumSpanningTreeKargerKleinTarjan: Create a new MST algorithm object.
MinimumSpanningTreeKruskal - Class in com.jgalgo.alg.span: Kruskal's minimum spanning tree algorithm.
MinimumSpanningTreeKruskal() - Constructor for class com.jgalgo.alg.span.MinimumSpanningTreeKruskal: Construct a new MST algorithm object.
MinimumSpanningTreePrim - Class in com.jgalgo.alg.span: Prim's minimum spanning tree algorithm.
MinimumSpanningTreePrim() - Constructor for class com.jgalgo.alg.span.MinimumSpanningTreePrim: Construct a new MST algorithm object.
MinimumSpanningTreeYao - Class in com.jgalgo.alg.span: Yao's buckets minimum spanning tree algorithm.
MinimumSpanningTreeYao() - Constructor for class com.jgalgo.alg.span.MinimumSpanningTreeYao: Construct a new MST algorithm object.
MinimumVertexCutAllGlobal - Interface in com.jgalgo.alg.connect: Minimum Vertex-Cut algorithm that finds all minimum vertex-cuts in a graph (global vertex-cut).
MinimumVertexCutAllGlobalAbstract - Class in com.jgalgo.alg.connect: Abstract class for computing all global minimum vertex cuts in a graph.
MinimumVertexCutAllGlobalAbstract() - Constructor for class com.jgalgo.alg.connect.MinimumVertexCutAllGlobalAbstract: Default constructor.
MinimumVertexCutAllGlobalKanevsky - Class in com.jgalgo.alg.connect: Kanevsky algorithm for computing all minimum unweighted vertex cuts in a graph.
MinimumVertexCutAllGlobalKanevsky() - Constructor for class com.jgalgo.alg.connect.MinimumVertexCutAllGlobalKanevsky: Create a new instance of the algorithm.
MinimumVertexCutAllSt - Interface in com.jgalgo.alg.connect: Minimum Vertex-Cut algorithm that finds all minimum vertex-cuts in a graph between two terminal vertices (source-sink, S-T).
MinimumVertexCutAllStAbstract - Class in com.jgalgo.alg.connect: Abstract class for computing all minimum vertex cuts between two vertices in a graph.
MinimumVertexCutAllStAbstract() - Constructor for class com.jgalgo.alg.connect.MinimumVertexCutAllStAbstract: Default constructor.
MinimumVertexCutAllStEdgeCut - Class in com.jgalgo.alg.connect: All Minimum Vertex-Cuts algorithm with terminal vertices (source-sink, S-T) using All Minimum Edge-Cuts algorithm.
MinimumVertexCutAllStEdgeCut() - Constructor for class com.jgalgo.alg.connect.MinimumVertexCutAllStEdgeCut: Create a new instance of the algorithm.
MinimumVertexCutGlobal - Interface in com.jgalgo.alg.connect: Minimum Vertex-Cut algorithm without terminal vertices.
MinimumVertexCutGlobalAbstract - Class in com.jgalgo.alg.connect: Abstract class for computing the global minimum vertex cut in a graph.
MinimumVertexCutGlobalAbstract() - Constructor for class com.jgalgo.alg.connect.MinimumVertexCutGlobalAbstract: Default constructor.
MinimumVertexCutGlobalEsfahanianHakimi - Class in com.jgalgo.alg.connect: Esfahanian-Hakimi algorithm for computing a minimum unweighted vertex cut in a graph.
MinimumVertexCutGlobalEsfahanianHakimi() - Constructor for class com.jgalgo.alg.connect.MinimumVertexCutGlobalEsfahanianHakimi: Create a new instance of the algorithm.
MinimumVertexCutSt - Interface in com.jgalgo.alg.connect: Minimum Vertex-Cut algorithm with terminal vertices (source-sink, S-T).
MinimumVertexCutStAbstract - Class in com.jgalgo.alg.connect: Abstract class for computing the minimum vertex cut between two vertices in a graph.
MinimumVertexCutStAbstract() - Constructor for class com.jgalgo.alg.connect.MinimumVertexCutStAbstract: Default constructor.
MinimumVertexCutStEdgeCut - Class in com.jgalgo.alg.connect: Minimum Vertex-Cut algorithm with terminal vertices (source-sink, S-T) using Minimum Edge-Cut algorithm.
MinimumVertexCutStEdgeCut() - Constructor for class com.jgalgo.alg.connect.MinimumVertexCutStEdgeCut: Create a new instance of the algorithm.
moveEdge(int, int, int) - Method in interface com.jgalgo.graph.IntGraph: Move an existing edge to new source and target vertices.
moveEdge(E, V, V) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
moveEdge(E, V, V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
moveEdge(E, V, V) - Method in interface com.jgalgo.graph.Graph: Move an existing edge to new source and target vertices.
moveEdge(Integer, Integer, Integer) - Method in interface com.jgalgo.graph.IntGraph: Deprecated.
Please use IntGraph.moveEdge(int, int, int) instead to avoid un/boxing.
mstExample() - Static method in class com.jgalgo.example.MinimumSpanningTreeExample: This example demonstrates how to use the minimum spanning tree algorithm.

N

negate(IWeightFunction) - Static method in class com.jgalgo.graph.WeightFunctions: Get a weight function that returns the negative of the given weight function.
NegativeCycleException - Exception in com.jgalgo.alg.shortestpath: Exception thrown when a negative cycle is detected in a graph during a shortest path computation.
NegativeCycleException(Graph<V, E>, Path<V, E>) - Constructor for exception com.jgalgo.alg.shortestpath.NegativeCycleException: Create a new instance of the exception.
negativeWeights(boolean) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.Builder: Enable/disable the support for negative numbers.
newBuilder() - Method in interface com.jgalgo.graph.GraphFactory: Create a new graph builder with the factory parameters.
newBuilder() - Method in interface com.jgalgo.graph.IndexGraphFactory
newBuilder() - Method in interface com.jgalgo.graph.IntGraphFactory
newBuilderCopyOf(Graph<Integer, Integer>) - Method in interface com.jgalgo.graph.IndexGraphFactory: Create a new graph builder with the factory parameters initialized with an existing graph vertices and edges, without copying the weights.
newBuilderCopyOf(Graph<Integer, Integer>) - Method in interface com.jgalgo.graph.IntGraphFactory
newBuilderCopyOf(Graph<Integer, Integer>, boolean, boolean) - Method in interface com.jgalgo.graph.IndexGraphFactory: Create a new graph builder with the factory parameters initialized with an existing graph vertices and edges, with/without copying the weights.
newBuilderCopyOf(Graph<Integer, Integer>, boolean, boolean) - Method in interface com.jgalgo.graph.IntGraphFactory
newBuilderCopyOf(Graph<V, E>) - Method in interface com.jgalgo.graph.GraphFactory: Create a new graph builder with the factory parameters initialized with an existing graph vertices and edges, without copying the weights.
newBuilderCopyOf(Graph<V, E>, boolean, boolean) - Method in interface com.jgalgo.graph.GraphFactory: Create a new graph builder with the factory parameters initialized with an existing graph vertices and edges, with/without copying the weights.
newCopyOf(Graph<Integer, Integer>) - Method in interface com.jgalgo.graph.IndexGraphFactory
newCopyOf(Graph<Integer, Integer>) - Static method in interface com.jgalgo.graph.IntGraphBuilder: Create a new builder initialized with an existing graph vertices and edges, without copying the weights.
newCopyOf(Graph<Integer, Integer>) - Method in interface com.jgalgo.graph.IntGraphFactory
newCopyOf(Graph<Integer, Integer>, boolean, boolean) - Method in interface com.jgalgo.graph.IndexGraphFactory
newCopyOf(Graph<Integer, Integer>, boolean, boolean) - Static method in interface com.jgalgo.graph.IntGraphBuilder: Create a new builder initialized with an existing graph vertices and edges, with/without copying the weights.
newCopyOf(Graph<Integer, Integer>, boolean, boolean) - Method in interface com.jgalgo.graph.IntGraphFactory
newCopyOf(Graph<V, E>) - Static method in interface com.jgalgo.graph.GraphBuilder: Create a new builder initialized with an existing graph vertices and edges, without copying the weights.
newCopyOf(Graph<V, E>) - 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<V, E>, boolean, 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.
newCopyOf(Graph<V, E>, boolean, 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) - Static method in interface com.jgalgo.graph.IndexGraphBuilder: Create a new builder initialized with an existing graph vertices and edges, without copying the weights.
newCopyOf(IndexGraph, boolean, 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.
newDirected() - Static method in interface com.jgalgo.graph.Graph: Create a new directed empty graph.
newDirected() - Static method in interface com.jgalgo.graph.IndexGraph: Create a new directed empty index graph.
newDirected() - Static method in interface com.jgalgo.graph.IntGraph: Create a new directed empty int graph.
newFromMaximumFlow(MaximumFlow) - Static method in interface com.jgalgo.alg.connect.MinimumEdgeCutSt: Create a new minimum edge-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
newGraph() - Method in interface com.jgalgo.graph.IntGraphFactory
newImmutableCopyOf(Graph<Integer, Integer>) - Method in interface com.jgalgo.graph.IndexGraphFactory
newImmutableCopyOf(Graph<Integer, Integer>) - Method in interface com.jgalgo.graph.IntGraphFactory
newImmutableCopyOf(Graph<Integer, Integer>, boolean, boolean) - Method in interface com.jgalgo.graph.IndexGraphFactory
newImmutableCopyOf(Graph<Integer, Integer>, boolean, boolean) - Method in interface com.jgalgo.graph.IntGraphFactory
newImmutableCopyOf(Graph<V, E>) - Method in interface com.jgalgo.graph.GraphFactory: Create a new immutable copy of a given graph, with the same vertices and edges, without copying weights.
newImmutableCopyOf(Graph<V, E>, boolean, boolean) - Method in interface com.jgalgo.graph.GraphFactory: Create a new immutable copy of a given graph, with the same vertices and edges, with/without copying weights.
newInstance() - Static method in interface com.jgalgo.alg.clique.MaximalCliquesEnumerator: Create a new maximal cliques algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.clique.MaximalIndependentSetsEnumerator: Create a new maximal independent sets algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.closure.ClosuresEnumerator: Create a new closure enumeration algorithm.
newInstance() - Static method in interface com.jgalgo.alg.color.ColoringAlgo: Create a new coloring algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.connect.BiConnectedComponentsAlgo: Create a new bi-connected components algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.connect.KEdgeConnectedComponentsAlgo: Create a new k-edge connected components algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.connect.KVertexConnectedComponentsAlgo: Create a new k-connected components algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.connect.MinimumEdgeCutAllSt: Create a new minimum S-T all edge-cuts algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.connect.MinimumEdgeCutGlobal: Create a new minimum global edge-cut algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.connect.MinimumEdgeCutSt: Create a new minimum S-T edge-cut algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.connect.MinimumVertexCutAllGlobal: Create a new global minimum all vertex-cuts algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.connect.MinimumVertexCutAllSt: Create a new minimum S-T all vertex-cuts algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.connect.MinimumVertexCutGlobal: Create a new minimum global vertex-cut algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.connect.MinimumVertexCutSt: Create a new minimum S-T vertex-cut algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.connect.StronglyConnectedComponentsAlgo: Create a new strongly connected components algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.connect.WeaklyConnectedComponentsAlgo: Create a new weakly connected components algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.cores.CoresAlgo: Create a new cores algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.cover.DominatingSetAlgo: Create a new dominating set algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.cover.EdgeCover: Create a new edge cover algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.cover.VertexCover: Create a new vertex cover algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.cycle.ChinesePostman: Create a new algorithm object for chinese postman problem.
newInstance() - Static method in interface com.jgalgo.alg.cycle.CyclesEnumerator: Create a new algorithm for cycles enumerating.
newInstance() - Static method in interface com.jgalgo.alg.cycle.MinimumMeanCycle: Create a new min mean cycle algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.dag.TopologicalOrderAlgo: Create a new topological order algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.euler.EulerianTourAlgo: Create a new Eulerian tour computation algorithm.
newInstance() - Static method in interface com.jgalgo.alg.flow.MaximumFlow: Create a new maximum flow algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.flow.MinimumCostFlow: Create a new min-cost-flow algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.hamilton.HamiltonianPathAlgo: Create a new Hamiltonian path algorithm.
newInstance() - Static method in interface com.jgalgo.alg.isomorphism.IsomorphismTester: Create a new isomorphism tester.
newInstance() - Static method in interface com.jgalgo.alg.match.MatchingAlgo: Create a new matching algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.shortestpath.KShortestPathsSt: Create a new K shortest paths algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.shortestpath.ShortestPathAllPairs: Create a new all-pairs-shortest-paths algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.shortestpath.ShortestPathHeuristicSt: Create a new shortest path algorithm with heuristic.
newInstance() - Static method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource: Create a new shortest path algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.shortestpath.ShortestPathSt: Create a new S-T shortest path algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.shortestpath.SimplePathsEnumerator: Create a new algorithm for simple paths enumeration.
newInstance() - Static method in interface com.jgalgo.alg.shortestpath.VoronoiAlgo: Create a new Voronoi cells algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.span.MinimumDirectedSpanningTree: Create a new directed-MST algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.span.MinimumSpanningTree: Create a new MST algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.span.SteinerTreeAlgo: Create a new Steiner tree algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.tree.LowestCommonAncestorDynamic: Create a new algorithm for dynamic LCA queries.
newInstance() - Static method in interface com.jgalgo.alg.tree.LowestCommonAncestorOffline: Create a new offline LCA algorithm object.
newInstance() - Static method in interface com.jgalgo.alg.tree.LowestCommonAncestorStatic: Create a new algorithm for static LCA queries.
newInstance() - Static method in interface com.jgalgo.alg.tree.TreePathMaxima: Create a new tree path maxima algorithm object.
newInstance(boolean) - Static method in interface com.jgalgo.graph.GraphBuilder: Create a new builder that builds un/directed graphs.
newInstance(boolean) - Static method in interface com.jgalgo.graph.GraphFactory: Create a new un/directed graph factory.
newInstance(boolean) - Static method in interface com.jgalgo.graph.IndexGraphBuilder: Create a new builder that builds un/directed graphs.
newInstance(boolean) - Static method in interface com.jgalgo.graph.IndexGraphFactory: Create a new un/directed index graph factory.
newInstance(boolean) - Static method in interface com.jgalgo.graph.IntGraphBuilder: Create a new builder that builds un/directed int graphs.
newInstance(boolean) - Static method in interface com.jgalgo.graph.IntGraphFactory: Create a new un/directed int graph factory.
newInstance(Graph<V, E>) - Static method in interface com.jgalgo.alg.tree.LowestCommonAncestorOffline.Queries: Create an empty queries container.
newInstance(Graph<V, E>) - Static method in interface com.jgalgo.alg.tree.TreePathMaxima.Queries: Create an empty queries container.
newInstance(Graph<V, E>, V) - Static method in interface com.jgalgo.alg.traversal.BfsIter: Create a BFS iterator.
newInstance(Graph<V, E>, V) - Static method in interface com.jgalgo.alg.traversal.DfsIter: Create a DFS iterator.
newInstance(Graph<V, E>, V) - Static method in interface com.jgalgo.alg.traversal.RandomWalkIter: Create a new random walk iterator.
newInstance(Graph<V, E>, V, WeightFunction<E>) - Static method in interface com.jgalgo.alg.traversal.RandomWalkIter: Create a new weighted random walk iterator.
newInstance(IntGraph) - Static method in interface com.jgalgo.alg.tree.LowestCommonAncestorOffline.IQueries: Create an empty queries container.
newInstance(IntGraph) - Static method in interface com.jgalgo.alg.tree.TreePathMaxima.IQueries: Create an empty queries container.
newInstance(IntGraph, int) - Static method in interface com.jgalgo.alg.traversal.BfsIter: Create a BFS iterator in an int graph.
newInstance(IntGraph, int) - Static method in interface com.jgalgo.alg.traversal.DfsIter: Create a DFS iterator for an int graph.
newInstanceFifo() - Static method in class com.jgalgo.alg.flow.MaximumFlowPushRelabel: Create a new push-relabel maximum flow algorithm object with a FIFO heuristic.
newInstanceHighestFirst() - Static method in class com.jgalgo.alg.flow.MaximumFlowPushRelabel: Create a new push-relabel maximum flow algorithm object with a highest first heuristic.
newInstanceLowestFirst() - Static method in class com.jgalgo.alg.flow.MaximumFlowPushRelabel: Create a new push-relabel maximum flow algorithm object with a lowest first heuristic.
newInstanceMoveToFront() - Static method in class com.jgalgo.alg.flow.MaximumFlowPushRelabel: Create a new push-relabel maximum flow algorithm object with a move-to-front heuristic.
newInstancePartialAugment() - Static method in class com.jgalgo.alg.flow.MaximumFlowPushRelabel: Create a new push-relabel maximum flow algorithm object with a partial augment discharge policy and highest first active heuristic.
newUndirected() - Static method in interface com.jgalgo.graph.Graph: Create a new undirected empty graph.
newUndirected() - Static method in interface com.jgalgo.graph.IndexGraph: Create a new undirected empty index graph.
newUndirected() - Static method in interface com.jgalgo.graph.IntGraph: Create a new undirected empty int graph.
next() - Method in interface com.jgalgo.alg.traversal.BfsIter.Int: Deprecated.
Please use the corresponding type-specific method instead.
next() - Method in interface com.jgalgo.alg.traversal.BfsIter: Advance the iterator and return a vertex that was not visited by the iterator yet.
next() - Method in interface com.jgalgo.alg.traversal.DfsIter.Int: Deprecated.
Please use the corresponding type-specific method instead.
next() - Method in interface com.jgalgo.alg.traversal.DfsIter: Advance the iterator and return a vertex that was not visited by the iterator yet.
next() - Method in interface com.jgalgo.alg.traversal.RandomWalkIter.Int: Deprecated.
Please use the corresponding type-specific method instead.
next() - Method in interface com.jgalgo.alg.traversal.RandomWalkIter: Advance the iterator from the current vertex along one of its out edges and return the vertex reached.
nextInt() - Method in interface com.jgalgo.alg.traversal.BfsIter.Int: Advance the iterator and return a vertex that was not visited by the iterator yet.
nextInt() - Method in interface com.jgalgo.alg.traversal.DfsIter.Int: Advance the iterator and return a vertex that was not visited by the iterator yet.
nextInt() - Method in interface com.jgalgo.alg.traversal.RandomWalkIter.Int: Advance the iterator from the current vertex along one of its out edges and return the vertex reached.
nodeOrder() - Method in class com.jgalgo.adapt.guava.GuavaGraphAdapter
nodeOrder() - Method in class com.jgalgo.adapt.guava.GuavaNetworkAdapter
nodeOrder() - Method in class com.jgalgo.adapt.guava.GuavaValueGraphAdapter
nodes() - Method in class com.jgalgo.adapt.guava.GuavaGraphAdapter
nodes() - Method in class com.jgalgo.adapt.guava.GuavaNetworkAdapter
nodes() - Method in class com.jgalgo.adapt.guava.GuavaValueGraphAdapter
NoSuchEdgeException - Exception in com.jgalgo.graph: Exception thrown when an edge is not found in a graph.
NoSuchVertexException - Exception in com.jgalgo.graph: Exception thrown when a vertex is not found in a graph.
numberOfBlocks() - Method in interface com.jgalgo.alg.common.VertexBiPartition
numberOfBlocks() - Method in interface com.jgalgo.alg.common.VertexPartition: Get the number of blocks in the partition.

O

of(Graph<V, E>, WeightFunction<E>) - Static method in interface com.jgalgo.alg.distancemeasures.DistanceMeasures: Get a distance measures object of a graph.
of(IntSet, IntGraph) - Static method in interface com.jgalgo.graph.IEdgeSet: Create an edge set object from a plain set of edges.
of(Set<E>, Graph<V, E>) - Static method in interface com.jgalgo.graph.EdgeSet: Create an edge set object from a plain set of edges.
ofEdge(int) - Static method in exception com.jgalgo.graph.NoSuchEdgeException: Create a new exception of a missing edge by its int identifier.
ofEdge(Object) - Static method in exception com.jgalgo.graph.NoSuchEdgeException: Create a new exception of a missing edge by its identifier.
ofIndex(int) - Static method in exception com.jgalgo.graph.NoSuchEdgeException: Create a new exception of a missing edge by its index.
ofIndex(int) - Static method in exception com.jgalgo.graph.NoSuchVertexException: Create a new exception of a missing vertex by its index.
ofVertex(int) - Static method in exception com.jgalgo.graph.NoSuchVertexException: Create a new exception of a missing vertex by its int identifier.
ofVertex(Object) - Static method in exception com.jgalgo.graph.NoSuchVertexException: Create a new exception of a missing vertex by its identifier.
orderComparator() - Method in interface com.jgalgo.alg.dag.TopologicalOrderAlgo.IResult
orderComparator() - Method in interface com.jgalgo.alg.dag.TopologicalOrderAlgo.Result: Get a comparator that compare vertices by their order in the topological order.
orderedVertices() - Method in interface com.jgalgo.alg.dag.TopologicalOrderAlgo.IResult
orderedVertices() - Method in interface com.jgalgo.alg.dag.TopologicalOrderAlgo.Result: Get all the vertices ordered in the list by the topological order.
Out - com.jgalgo.alg.common.EdgeDirection: The 'Out' direction include all the edges with the vertex as the source, in case of a directed graph, or as the source or the target, in case of an undirected graph.
outDegree(V) - Method in class com.jgalgo.adapt.guava.GuavaGraphAdapter
outDegree(V) - Method in class com.jgalgo.adapt.guava.GuavaValueGraphAdapter
outDegreeOf(V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
outEdges(int) - Method in interface com.jgalgo.graph.IntGraph: Get the edges whose source is source.
outEdges(Integer) - Method in interface com.jgalgo.graph.IntGraph: Deprecated.
Please use IntGraph.outEdges(int) instead to avoid un/boxing.
outEdges(V) - Method in class com.jgalgo.adapt.guava.GuavaNetworkAdapter
outEdges(V) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
outEdges(V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
outEdges(V) - Method in interface com.jgalgo.graph.Graph: Get the edges whose source is source.
outgoingEdgesOf(V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter

P

parallelEdges(boolean) - Method in class com.jgalgo.gen.GnmBipartiteGraphGenerator: Determine if the generated graph(s) will contain parallel-edges.
parallelEdges(boolean) - Method in class com.jgalgo.gen.GnmGraphGenerator: Determine if the generated graph(s) will contain parallel-edges.
partition() - Method in interface com.jgalgo.alg.shortestpath.VoronoiAlgo.IResult
partition() - Method in interface com.jgalgo.alg.shortestpath.VoronoiAlgo.Result: Get the partition of the graph to blocks where each block contains the vertices which are closest to a single site.
partitionFromIndexPartition(Graph<V, E>, IVertexBiPartition) - Static method in interface com.jgalgo.alg.common.VertexBiPartition: Create a vertex bi-partition view from a vertex bi-partition of the index graph of the given graph.
partitionFromIndexPartition(Graph<V, E>, IVertexPartition) - Static method in interface com.jgalgo.alg.common.VertexPartition: Create a vertex partition view from a vertex partition of the index graph of the given graph.
Path<V,E> - Interface in com.jgalgo.alg.common: A path of edges in a graph.
pathFromIndexPath(Graph<V, E>, IPath) - Static method in interface com.jgalgo.alg.common.Path: Create a path view from a path in the index graph of the given graph.
peekNext() - Method in interface com.jgalgo.graph.EdgeIter: Peek at the next edge of the iterator without advancing it.
peekNext() - Method in interface com.jgalgo.graph.IEdgeIter: Deprecated.
Please use IEdgeIter.peekNextInt() instead to avoid un/boxing.
peekNextInt() - Method in interface com.jgalgo.graph.IEdgeIter: Peek at the next edge of the iterator without advancing it.
periphery() - Method in interface com.jgalgo.alg.distancemeasures.DistanceMeasures: Get the periphery of the graph.
periphery() - Method in interface com.jgalgo.alg.distancemeasures.IDistanceMeasures
predecessors(V) - Method in class com.jgalgo.adapt.guava.GuavaGraphAdapter
predecessors(V) - Method in class com.jgalgo.adapt.guava.GuavaNetworkAdapter
predecessors(V) - Method in class com.jgalgo.adapt.guava.GuavaValueGraphAdapter
preProcessTree(Graph<V, E>, V) - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorStatic: Perform a static pre processing of a tree for future LCA (Lowest common ancestor) queries.
preProcessTree(Graph<V, E>, V) - Method in class com.jgalgo.alg.tree.LowestCommonAncestorStaticAbstract
putEdge(EndpointPair<V>) - Method in class com.jgalgo.adapt.guava.GuavaMutableGraphAdapter
putEdge(V, V) - Method in class com.jgalgo.adapt.guava.GuavaMutableGraphAdapter
putEdgeValue(EndpointPair<V>, ValueT) - Method in class com.jgalgo.adapt.guava.GuavaMutableValueGraphAdapter
putEdgeValue(V, V, ValueT) - Method in class com.jgalgo.adapt.guava.GuavaMutableValueGraphAdapter

R

radius() - Method in interface com.jgalgo.alg.distancemeasures.DistanceMeasures: Get the radius of the graph.
randEdge(Graph<?, E>, Random) - Static method in class com.jgalgo.graph.Graphs: Get a random edge from the given graph.
randEdge(IntGraph, Random) - Static method in class com.jgalgo.graph.Graphs: Get a random edge from the given int graph.
RandomizedAlgorithm - Interface in com.jgalgo.alg.common: Randomized algorithm interface.
RandomWalkIter<V,E> - Interface in com.jgalgo.alg.traversal: Random walk iterator.
RandomWalkIter.Int - Interface in com.jgalgo.alg.traversal: A random walk iterator for IntGraph.
randVertex(Graph<V, ?>, Random) - Static method in class com.jgalgo.graph.Graphs: Get a random vertex from the given graph.
randVertex(IntGraph, Random) - Static method in class com.jgalgo.graph.Graphs: Get a random vertex from the given int graph.
reachableVertices(Graph<V, E>, Iterator<V>) - Static method in interface com.jgalgo.alg.common.Path: Find all the vertices reachable from a given set of source vertices.
reachableVertices(Graph<V, E>, V) - Static method in interface com.jgalgo.alg.common.Path: Find all the vertices reachable from a given source vertex.
reachableVertices(IntGraph, int) - Static method in interface com.jgalgo.alg.common.IPath: Find all the vertices reachable from a given source vertex.
reachableVertices(IntGraph, IntIterator) - Static method in interface com.jgalgo.alg.common.IPath: Find all the vertices reachable from a set of given source vertices.
readGraph(File) - Method in interface com.jgalgo.io.GraphReader: Read a graph from a file.
readGraph(Reader) - Method in interface com.jgalgo.io.GraphReader: Read a graph from an I/O reader.
readGraph(String) - Method in interface com.jgalgo.io.GraphReader: Read a graph from a file, given a path to it.
readIntoBuilder(Reader) - Method in interface com.jgalgo.io.GraphReader: Read a graph from an I/O reader into a GraphBuilder.
RecursiveMatrixGraphGenerator<V,E> - Class in com.jgalgo.gen: Generates a random graph using the R-MAT model.
RecursiveMatrixGraphGenerator() - Constructor for class com.jgalgo.gen.RecursiveMatrixGraphGenerator: Create a new R-MAT generator that will use the default graph factory.
RecursiveMatrixGraphGenerator(GraphFactory<V, E>) - Constructor for class com.jgalgo.gen.RecursiveMatrixGraphGenerator: Create a new R-MAT generator that will use the given graph factory.
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.
removeAllEdges(V, V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
removeEdge(int) - Method in interface com.jgalgo.graph.IndexGraph: Remove an edge from the graph.
removeEdge(int) - Method in interface com.jgalgo.graph.IntGraph: Remove an edge from the graph.
removeEdge(EndpointPair<V>) - Method in class com.jgalgo.adapt.guava.GuavaMutableGraphAdapter
removeEdge(EndpointPair<V>) - Method in class com.jgalgo.adapt.guava.GuavaMutableValueGraphAdapter
removeEdge(E) - Method in class com.jgalgo.adapt.guava.GuavaMutableNetworkAdapter
removeEdge(E) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
removeEdge(E) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
removeEdge(E) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
removeEdge(E) - Method in interface com.jgalgo.graph.Graph: Remove an edge from the graph.
removeEdge(Integer) - Method in interface com.jgalgo.graph.IntGraph: Deprecated.
Please use IntGraph.removeEdge(int) instead to avoid un/boxing.
removeEdge(V, V) - Method in class com.jgalgo.adapt.guava.GuavaMutableGraphAdapter
removeEdge(V, V) - Method in class com.jgalgo.adapt.guava.GuavaMutableValueGraphAdapter
removeEdge(V, V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
removeEdgeRemoveListener(IndexRemoveListener) - Method in interface com.jgalgo.graph.IndexGraph: Removes an edge remove listener.
removeEdges(Collection<? extends E>) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
removeEdges(Collection<? extends E>) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
removeEdges(Collection<? extends E>) - Method in interface com.jgalgo.graph.Graph: Remove multiple edges from the graph.
removeEdgesOf(int) - Method in interface com.jgalgo.graph.IndexGraph: Remove all the edges of a vertex.
removeEdgesOf(int) - Method in interface com.jgalgo.graph.IntGraph: Remove all the edges of a vertex.
removeEdgesOf(Integer) - Method in interface com.jgalgo.graph.IntGraph: Deprecated.
Please use IntGraph.removeEdgesOf(int) instead to avoid un/boxing.
removeEdgesOf(V) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
removeEdgesOf(V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
removeEdgesOf(V) - Method in interface com.jgalgo.graph.Graph: Remove all the edges of a vertex.
removeEdgesWeights(String) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
removeEdgesWeights(String) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
removeEdgesWeights(String) - Method in interface com.jgalgo.graph.Graph: Remove a weight type associated with the edges of the graph.
removeEdgesWeights(String) - Method in interface com.jgalgo.graph.IndexGraph: 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
removeHint(GraphFactory.Hint) - Method in interface com.jgalgo.graph.IntGraphFactory
removeInEdgesOf(int) - Method in interface com.jgalgo.graph.IndexGraph: Remove all edges whose target is target.
removeInEdgesOf(int) - Method in interface com.jgalgo.graph.IntGraph: Remove all edges whose target is target.
removeInEdgesOf(Integer) - Method in interface com.jgalgo.graph.IntGraph: Deprecated.
Please use IntGraph.removeInEdgesOf(int) instead to avoid un/boxing.
removeInEdgesOf(V) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
removeInEdgesOf(V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
removeInEdgesOf(V) - Method in interface com.jgalgo.graph.Graph: Remove all edges whose target is target.
removeLast(int) - Method in interface com.jgalgo.graph.IndexRemoveListener: A callback that is called when the last element is removed.
removeNode(V) - Method in class com.jgalgo.adapt.guava.GuavaMutableGraphAdapter
removeNode(V) - Method in class com.jgalgo.adapt.guava.GuavaMutableNetworkAdapter
removeNode(V) - Method in class com.jgalgo.adapt.guava.GuavaMutableValueGraphAdapter
removeOutEdgesOf(int) - Method in interface com.jgalgo.graph.IndexGraph: Remove all edges whose source is source.
removeOutEdgesOf(int) - Method in interface com.jgalgo.graph.IntGraph: Remove all edges whose source is source.
removeOutEdgesOf(Integer) - Method in interface com.jgalgo.graph.IntGraph: Deprecated.
Please use IntGraph.removeOutEdgesOf(int) instead to avoid un/boxing.
removeOutEdgesOf(V) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
removeOutEdgesOf(V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
removeOutEdgesOf(V) - Method in interface com.jgalgo.graph.Graph: Remove all edges whose source is source.
removeVertex(int) - Method in interface com.jgalgo.graph.IndexGraph: Remove a vertex and all its edges from the graph.
removeVertex(int) - Method in interface com.jgalgo.graph.IntGraph: Remove a vertex and all its edges from the graph.
removeVertex(Integer) - Method in interface com.jgalgo.graph.IntGraph: Deprecated.
Please use IntGraph.removeVertex(int) instead to avoid un/boxing.
removeVertex(V) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
removeVertex(V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
removeVertex(V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
removeVertex(V) - Method in interface com.jgalgo.graph.Graph: Remove a vertex and all its edges from the graph.
removeVertexRemoveListener(IndexRemoveListener) - Method in interface com.jgalgo.graph.IndexGraph: Removes a vertex remove listener.
removeVertices(Collection<? extends V>) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
removeVertices(Collection<? extends V>) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
removeVertices(Collection<? extends V>) - Method in interface com.jgalgo.graph.Graph: Remove multiple vertices and all their edges from the graph.
removeVerticesWeights(String) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
removeVerticesWeights(String) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
removeVerticesWeights(String) - Method in interface com.jgalgo.graph.Graph: Remove a weight type associated with the vertices of the graph.
removeVerticesWeights(String) - Method in interface com.jgalgo.graph.IndexGraph: Remove a weight type associated with the vertices of the graph.
renameEdge(int, int) - Method in interface com.jgalgo.graph.IndexGraph: Deprecated.
unsupported operation
renameEdge(int, int) - Method in interface com.jgalgo.graph.IntGraph: Set a new identifier for an existing edge.
renameEdge(E, E) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
renameEdge(E, E) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
renameEdge(E, E) - Method in interface com.jgalgo.graph.Graph: Set a new identifier for an existing edge.
renameEdge(Integer, Integer) - Method in interface com.jgalgo.graph.IntGraph: Deprecated.
Please use IntGraph.renameEdge(int, int) instead to avoid un/boxing.
renameVertex(int, int) - Method in interface com.jgalgo.graph.IndexGraph: Deprecated.
unsupported operation
renameVertex(int, int) - Method in interface com.jgalgo.graph.IntGraph: Set a new identifier for an existing vertex.
renameVertex(Integer, Integer) - Method in interface com.jgalgo.graph.IntGraph: Deprecated.
Please use IntGraph.renameVertex(int, int) instead to avoid un/boxing.
renameVertex(V, V) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper
renameVertex(V, V) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper
renameVertex(V, V) - Method in interface com.jgalgo.graph.Graph: Set a new identifier for an existing vertex.
replaceNullWeightFunc(IWeightFunction) - Static method in interface com.jgalgo.graph.IWeightFunction: Replace null weight function with IWeightFunction.CardinalityWeightFunction.
replaceNullWeightFunc(IWeightFunctionInt) - Static method in interface com.jgalgo.graph.IWeightFunction: Replace null weight function with IWeightFunction.CardinalityWeightFunction.
replaceNullWeightFunc(WeightFunction<K>) - Static method in interface com.jgalgo.graph.WeightFunction: Replace null weight function with WeightFunction.CardinalityWeightFunction.
replaceNullWeightFunc(WeightFunctionInt<K>) - Static method in interface com.jgalgo.graph.WeightFunction: Replace null weight function with WeightFunction.CardinalityWeightFunction.
reverseEdge(int) - Method in interface com.jgalgo.graph.IntGraph: Reverse an edge by switching its source and target.
reverseEdge(E) - Method in interface com.jgalgo.graph.Graph: Reverse an edge by switching its source and target.
reverseEdge(Integer) - Method in interface com.jgalgo.graph.IntGraph: Deprecated.
Please use IntGraph.reverseEdge(int) instead to avoid un/boxing.
reverseView() - Method in interface com.jgalgo.graph.Graph: Get a reversed view of this graph.
reverseView() - Method in interface com.jgalgo.graph.IndexGraph
reverseView() - Method in interface com.jgalgo.graph.IntGraph
rightEdges() - Method in interface com.jgalgo.alg.common.IVertexBiPartition
rightEdges() - Method in interface com.jgalgo.alg.common.VertexBiPartition: Get the edges that are contained in the right block.
rightVertices() - Method in interface com.jgalgo.alg.common.IVertexBiPartition
rightVertices() - Method in interface com.jgalgo.alg.common.VertexBiPartition: Get the vertices in the 'right' block.

S

seed(long) - Method in class com.jgalgo.gen.BarabasiAlbertGraphGenerator: Set the seed of the random number generator used to generate the graph(s).
seed(long) - Method in class com.jgalgo.gen.GnmBipartiteGraphGenerator: Set the seed of the random number generator used to generate the graph(s).
seed(long) - Method in class com.jgalgo.gen.GnmGraphGenerator: Set the seed of the random number generator used to generate the graph(s).
seed(long) - Method in class com.jgalgo.gen.GnpBipartiteGraphGenerator: Set the seed of the random number generator used to generate the graph(s).
seed(long) - Method in class com.jgalgo.gen.GnpGraphGenerator: Set the seed of the random number generator used to generate the graph(s).
seed(long) - Method in class com.jgalgo.gen.RecursiveMatrixGraphGenerator: Set the seed of the random number generator used to generate the graph(s).
seed(long) - Method in class com.jgalgo.gen.UniformTreeGenerator: Set the seed of the random number generator used to generate the graph(s).
selfEdges(boolean) - Method in class com.jgalgo.gen.ComplementGraphGenerator: Set whether or not to generate self edges.
selfEdges(boolean) - Method in class com.jgalgo.gen.CompleteGraphGenerator: Determine if the generated graph(s) will contain self-edges.
selfEdges(boolean) - Method in class com.jgalgo.gen.GnmGraphGenerator: Determine if the generated graph(s) will contain self-edges.
selfEdges(boolean) - Method in class com.jgalgo.gen.GnpGraphGenerator: Determine if the generated graph(s) will contain self-edges.
selfEdges(Graph<V, E>) - Static method in class com.jgalgo.graph.Graphs: Get a view of all the self edges in a graph.
selfEdges(IntGraph) - Static method in class com.jgalgo.graph.Graphs: Get a view of all the self edges in an int graph.
set(int, boolean) - Method in interface com.jgalgo.graph.IWeightsBool: Set the weight associated with the given element.
set(int, byte) - Method in interface com.jgalgo.graph.IWeightsByte: Set the weight associated with the given element.
set(int, char) - Method in interface com.jgalgo.graph.IWeightsChar: Set the weight associated with the given element.
set(int, double) - Method in interface com.jgalgo.graph.IWeightsDouble: Set the weight associated with the given element.
set(int, float) - Method in interface com.jgalgo.graph.IWeightsFloat: Set the weight associated with the given element.
set(int, int) - Method in interface com.jgalgo.graph.IWeightsInt: Set the weight associated with the given element.
set(int, long) - Method in interface com.jgalgo.graph.IWeightsLong: Set the weight associated with the given element.
set(int, short) - Method in interface com.jgalgo.graph.IWeightsShort: Set the weight associated with the given element.
set(int, T) - Method in interface com.jgalgo.graph.IWeightsObj: Set the weight associated with the given element.
set(Integer, boolean) - Method in interface com.jgalgo.graph.IWeightsBool: Deprecated.
Please use IWeightsBool.set(int, boolean) instead to avoid un/boxing.
set(Integer, byte) - Method in interface com.jgalgo.graph.IWeightsByte: Deprecated.
Please use IWeightsByte.set(int, byte) instead to avoid un/boxing.
set(Integer, char) - Method in interface com.jgalgo.graph.IWeightsChar: Deprecated.
Please use IWeightsChar.set(int, char) instead to avoid un/boxing.
set(Integer, double) - Method in interface com.jgalgo.graph.IWeightsDouble: Deprecated.
Please use IWeightsDouble.set(int, double) instead to avoid un/boxing.
set(Integer, float) - Method in interface com.jgalgo.graph.IWeightsFloat: Deprecated.
Please use IWeightsFloat.set(int, float) instead to avoid un/boxing.
set(Integer, int) - Method in interface com.jgalgo.graph.IWeightsInt: Deprecated.
Please use IWeightsInt.set(int, int) instead to avoid un/boxing.
set(Integer, long) - Method in interface com.jgalgo.graph.IWeightsLong: Deprecated.
Please use IWeightsLong.set(int, long) instead to avoid un/boxing.
set(Integer, short) - Method in interface com.jgalgo.graph.IWeightsShort: Deprecated.
Please use IWeightsShort.set(int, short) instead to avoid un/boxing.
set(Integer, T) - Method in interface com.jgalgo.graph.IWeightsObj: Deprecated.
Please use IWeightsObj.set(int, Object) instead to avoid un/boxing.
set(K, boolean) - Method in interface com.jgalgo.graph.WeightsBool: Set the weight associated with the given element.
set(K, byte) - Method in interface com.jgalgo.graph.WeightsByte: Set the weight associated with the given element.
set(K, char) - Method in interface com.jgalgo.graph.WeightsChar: Set the weight associated with the given element.
set(K, double) - Method in interface com.jgalgo.graph.WeightsDouble: Set the weight associated with the given element.
set(K, float) - Method in interface com.jgalgo.graph.WeightsFloat: Set the weight associated with the given element.
set(K, int) - Method in interface com.jgalgo.graph.WeightsInt: Set the weight associated with the given element.
set(K, long) - Method in interface com.jgalgo.graph.WeightsLong: Set the weight associated with the given element.
set(K, short) - Method in interface com.jgalgo.graph.WeightsShort: Set the weight associated with the given element.
set(K, T) - Method in interface com.jgalgo.graph.WeightsObj: Set the weight associated with the given element.
setAsObj(int, Boolean) - Method in interface com.jgalgo.graph.IWeightsBool: Deprecated.
Please use IWeightsBool.set(int, boolean) instead to avoid un/boxing.
setAsObj(int, Byte) - Method in interface com.jgalgo.graph.IWeightsByte: Deprecated.
Please use IWeightsByte.set(int, byte) instead to avoid un/boxing.
setAsObj(int, Character) - Method in interface com.jgalgo.graph.IWeightsChar: Deprecated.
Please use IWeightsChar.set(int, char) instead to avoid un/boxing.
setAsObj(int, Double) - Method in interface com.jgalgo.graph.IWeightsDouble: Deprecated.
Please use IWeightsDouble.set(int, double) instead to avoid un/boxing.
setAsObj(int, Float) - Method in interface com.jgalgo.graph.IWeightsFloat: Deprecated.
Please use IWeightsFloat.set(int, float) instead to avoid un/boxing.
setAsObj(int, Integer) - Method in interface com.jgalgo.graph.IWeightsInt: Deprecated.
Please use IWeightsInt.set(int, int) instead to avoid un/boxing.
setAsObj(int, Long) - Method in interface com.jgalgo.graph.IWeightsLong: Deprecated.
Please use IWeightsLong.set(int, long) instead to avoid un/boxing.
setAsObj(int, Short) - Method in interface com.jgalgo.graph.IWeightsShort: Deprecated.
Please use IWeightsShort.set(int, short) instead to avoid un/boxing.
setAsObj(int, T) - Method in interface com.jgalgo.graph.IWeights: Set the weight associated with the given id.
setAsObj(int, T) - Method in interface com.jgalgo.graph.IWeightsObj: Deprecated.
Please use IWeightsObj.set(int, Object) instead to avoid un/boxing.
setAsObj(Integer, Boolean) - Method in interface com.jgalgo.graph.IWeightsBool: Deprecated.
Please use IWeightsBool.set(int, boolean) instead to avoid un/boxing.
setAsObj(Integer, Byte) - Method in interface com.jgalgo.graph.IWeightsByte: Deprecated.
Please use IWeightsByte.set(int, byte) instead to avoid un/boxing.
setAsObj(Integer, Character) - Method in interface com.jgalgo.graph.IWeightsChar: Deprecated.
Please use IWeightsChar.set(int, char) instead to avoid un/boxing.
setAsObj(Integer, Double) - Method in interface com.jgalgo.graph.IWeightsDouble: Deprecated.
Please use IWeightsDouble.set(int, double) instead to avoid un/boxing.
setAsObj(Integer, Float) - Method in interface com.jgalgo.graph.IWeightsFloat: Deprecated.
Please use IWeightsFloat.set(int, float) instead to avoid un/boxing.
setAsObj(Integer, Integer) - Method in interface com.jgalgo.graph.IWeightsInt: Deprecated.
Please use IWeightsInt.set(int, int) instead to avoid un/boxing.
setAsObj(Integer, Long) - Method in interface com.jgalgo.graph.IWeightsLong: Deprecated.
Please use IWeightsLong.set(int, long) instead to avoid un/boxing.
setAsObj(Integer, Short) - Method in interface com.jgalgo.graph.IWeightsShort: Deprecated.
Please use IWeightsShort.set(int, short) instead to avoid un/boxing.
setAsObj(Integer, T) - Method in interface com.jgalgo.graph.IWeights: Deprecated.
Please use IWeights.setAsObj(int, Object) instead to avoid un/boxing.
setAsObj(Integer, T) - Method in interface com.jgalgo.graph.IWeightsObj: Deprecated.
Please use IWeightsObj.set(int, Object) instead to avoid un/boxing.
setAsObj(K, Boolean) - Method in interface com.jgalgo.graph.WeightsBool: Deprecated.
Please use WeightsBool.set(Object, boolean) instead to avoid un/boxing.
setAsObj(K, Byte) - Method in interface com.jgalgo.graph.WeightsByte: Deprecated.
Please use WeightsByte.set(Object, byte) instead to avoid un/boxing.
setAsObj(K, Character) - Method in interface com.jgalgo.graph.WeightsChar: Deprecated.
Please use WeightsChar.set(Object, char) instead to avoid un/boxing.
setAsObj(K, Double) - Method in interface com.jgalgo.graph.WeightsDouble: Deprecated.
Please use WeightsDouble.set(Object, double) instead to avoid un/boxing.
setAsObj(K, Float) - Method in interface com.jgalgo.graph.WeightsFloat: Deprecated.
Please use WeightsFloat.set(Object, float) instead to avoid un/boxing.
setAsObj(K, Integer) - Method in interface com.jgalgo.graph.WeightsInt: Deprecated.
Please use WeightsInt.set(Object, int) instead to avoid un/boxing.
setAsObj(K, Long) - Method in interface com.jgalgo.graph.WeightsLong: Deprecated.
Please use WeightsLong.set(Object, long) instead to avoid un/boxing.
setAsObj(K, Short) - Method in interface com.jgalgo.graph.WeightsShort: Deprecated.
Please use WeightsShort.set(Object, short) instead to avoid un/boxing.
setAsObj(K, T) - Method in interface com.jgalgo.graph.Weights: Set the weight associated with the given element.
setAsObj(K, T) - Method in interface com.jgalgo.graph.WeightsObj: Deprecated.
Please use WeightsObj.set(Object, Object) instead to avoid un/boxing.
setBitsLookupTablesEnable(boolean) - Method in class com.jgalgo.alg.tree.TreePathMaximaHagerup: Enable/disable the use of bits lookup tables.
setData(Object) - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorDynamic.Vertex: Set the user data of this vertex.
setDirected(boolean) - Method in interface com.jgalgo.graph.GraphFactory: Determine if graphs built by this factory should be directed.
setDirected(boolean) - Method in interface com.jgalgo.graph.IndexGraphFactory
setDirected(boolean) - Method in interface com.jgalgo.graph.IntGraphFactory
setEdgeBuilder(IdBuilder<E>) - Method in interface com.jgalgo.graph.GraphFactory: Set the edge builder used by the built graph(s).
setEdgeBuilder(IdBuilder<E>) - Method in class com.jgalgo.io.GexfGraphReader: Set the builder for the edges identifiers.
setEdgeBuilder(IdBuilder<E>) - Method in class com.jgalgo.io.GraphMlGraphReader: Set the builder for the edges identifiers.
setEdgeBuilder(IdBuilder<Integer>) - Method in interface com.jgalgo.graph.IndexGraphFactory: Deprecated.
Index graphs does not support custom edge builder
setEdgeBuilder(IdBuilder<Integer>) - Method in interface com.jgalgo.graph.IntGraphFactory: Set the edge builder used by the built graph(s).
setEdgeBuilderDefault(Class<E>) - Method in class com.jgalgo.io.GexfGraphReader: Set the builder for the edges identifiers, using a default builder for the given edge type.
setEdgeBuilderDefault(Class<E>) - Method in class com.jgalgo.io.GraphMlGraphReader: Set the builder for the edges identifiers, using a default builder for the given edge type.
setEdgeFactory(Supplier<? extends IdBuilder<E>>) - Method in interface com.jgalgo.graph.GraphFactory: Set the edge factory which create builders for the edges of the built graph(s).
setEdgeFactory(Supplier<? extends IdBuilder<Integer>>) - Method in interface com.jgalgo.graph.IndexGraphFactory: Deprecated.
Index graphs does not support custom edge builder
setEdgeFactory(Supplier<? extends IdBuilder<Integer>>) - Method in interface com.jgalgo.graph.IntGraphFactory
setEdgeParser(Function<String, E>) - Method in class com.jgalgo.io.GexfGraphReader: Set the parser for the edges identifiers.
setEdgeParser(Function<String, E>) - Method in class com.jgalgo.io.GraphMlGraphReader: Set the parser for the edges identifiers.
setEdgeParserDefault(Class<E>) - Method in class com.jgalgo.io.GexfGraphReader: Set the parser for the edges identifiers, using a default parser for the given edge type.
setEdgeParserDefault(Class<E>) - Method in class com.jgalgo.io.GraphMlGraphReader: Set the parser for the edges identifiers, using a default parser for the given edge type.
setEdgeSupplier(Supplier<E>) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter: Set the edge supplier of the adapter.
setEdgesWeightsKey(String) - Method in class com.jgalgo.io.LedaGraphReader: Sets the key of the edges weights that will be read.
setEdgesWeightsKey(String) - Method in class com.jgalgo.io.LedaGraphWriter: Set the key of the edges weights to write.
setEdgesWeightsKeys(Collection<String>) - Method in class com.jgalgo.io.GmlGraphWriter: Set the weights keys of the edges to write.
setEdgeType(Class<E>) - Method in class com.jgalgo.io.GmlGraphReader: Set the type of edges.
setEdgeWeight(E, double) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter
setEdgeWeights(String) - Method in class com.jgalgo.io.DimacsGraphWriter: Set the key of the edge weights to write.
setEdgeWeightsKey(String) - Method in class com.jgalgo.io.DimacsGraphReader: Sets the key of the edge weights that will be read.
setFastReplacementThreshold(int) - Method in class com.jgalgo.alg.shortestpath.KShortestPathsStHershbergerMaxelSuri: Set the threshold for the fast replacement algorithm.
setFastReplacementThreshold(int) - Method in class com.jgalgo.alg.shortestpath.KShortestPathsStKatohIbarakiMine: Set the threshold for the fast replacement algorithm.
setOption(String, Object) - Method in interface com.jgalgo.alg.common.AlgorithmBuilderBase: [TL;DR Don't call me!]
setOption(String, Object) - Method in interface com.jgalgo.graph.GraphFactory: [TL;DR Don't call me!]
setOption(String, Object) - Method in interface com.jgalgo.graph.IndexGraphFactory
setOption(String, Object) - Method in interface com.jgalgo.graph.IntGraphFactory
setParallelByDefault(boolean) - Static method in class com.jgalgo.JGAlgoConfig: Enable/disable default parallel computations in all algorithms.
setSeed(long) - Method in class com.jgalgo.alg.color.ColoringGreedy
setSeed(long) - Method in interface com.jgalgo.alg.common.RandomizedAlgorithm: Sets the seed for the random number generator.
setSeed(long) - Method in class com.jgalgo.alg.connect.KEdgeConnectedComponentsWang
setSeed(long) - Method in class com.jgalgo.alg.cover.DominatingSetAlgoGreedy
setSeed(long) - Method in class com.jgalgo.alg.span.MinimumSpanningTreeKargerKleinTarjan
setSsspAlgo(ShortestPathSingleSource) - Method in class com.jgalgo.alg.match.MatchingWeightedBipartiteSssp: Set the ShortestPathSingleSource algorithm used by this algorithm.
setVertexBuilder(IdBuilder<Integer>) - Method in interface com.jgalgo.graph.IndexGraphFactory: Deprecated.
Index graphs does not support custom vertex builder
setVertexBuilder(IdBuilder<Integer>) - Method in interface com.jgalgo.graph.IntGraphFactory: Set the vertex builder used by the built graph(s).
setVertexBuilder(IdBuilder<V>) - Method in interface com.jgalgo.graph.GraphFactory: Set the vertex builder used by the built graph(s).
setVertexFactory(Supplier<? extends IdBuilder<Integer>>) - Method in interface com.jgalgo.graph.IndexGraphFactory: Deprecated.
Index graphs does not support custom vertex builder
setVertexFactory(Supplier<? extends IdBuilder<Integer>>) - Method in interface com.jgalgo.graph.IntGraphFactory
setVertexFactory(Supplier<? extends IdBuilder<V>>) - Method in interface com.jgalgo.graph.GraphFactory: Set the vertex factory which create builders for the vertices of the built graph(s).
setVertexParser(Function<String, V>) - Method in class com.jgalgo.io.GexfGraphReader: Set the parser for the vertices identifiers.
setVertexParser(Function<String, V>) - Method in class com.jgalgo.io.GraphMlGraphReader: Set the parser for the vertices identifiers.
setVertexParserDefault(Class<V>) - Method in class com.jgalgo.io.GexfGraphReader: Set the parser for the vertices identifiers, using a default parser for the given vertex type.
setVertexParserDefault(Class<V>) - Method in class com.jgalgo.io.GraphMlGraphReader: Set the parser for the vertices identifiers, using a default parser for the given vertex type.
setVertexSupplier(Supplier<V>) - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter: Set the vertex supplier of the adapter.
setVertexType(Class<V>) - Method in class com.jgalgo.io.GmlGraphReader: Set the type of vertices.
setVerticesWeightsKey(String) - Method in class com.jgalgo.io.LedaGraphReader: Sets the key of the vertices weights that will be read.
setVerticesWeightsKey(String) - Method in class com.jgalgo.io.LedaGraphWriter: Set the key of the vertices weights to write.
setVerticesWeightsKeys(Collection<String>) - Method in class com.jgalgo.io.GmlGraphWriter: Set the weights keys of the vertices to write.
ShortestPathAllPairs - Interface in com.jgalgo.alg.shortestpath: An algorithm that compute all pairs shortest path (APSP) in a graph.
ShortestPathAllPairs.Builder - Interface in com.jgalgo.alg.shortestpath: A builder for ShortestPathAllPairs objects.
ShortestPathAllPairs.IResult - Interface in com.jgalgo.alg.shortestpath: A result object for an ShortestPathAllPairs algorithm for IntGraph.
ShortestPathAllPairs.Result<V,E> - Interface in com.jgalgo.alg.shortestpath: A result object for an ShortestPathAllPairs algorithm.
ShortestPathAllPairsAbstract - Class in com.jgalgo.alg.shortestpath: Abstract class for computing shortest path between all pairs in a graph.
ShortestPathAllPairsAbstract() - Constructor for class com.jgalgo.alg.shortestpath.ShortestPathAllPairsAbstract: Default constructor.
ShortestPathAllPairsCardinality - Class in com.jgalgo.alg.shortestpath: All pairs cardinality shortest path algorithm.
ShortestPathAllPairsCardinality() - Constructor for class com.jgalgo.alg.shortestpath.ShortestPathAllPairsCardinality: Create a APSP algorithm for cardinality weight function only.
ShortestPathAllPairsFloydWarshall - Class in com.jgalgo.alg.shortestpath: The Floyd Warshall algorithm for all pairs shortest path.
ShortestPathAllPairsFloydWarshall() - Constructor for class com.jgalgo.alg.shortestpath.ShortestPathAllPairsFloydWarshall: Create a APSP algorithm.
ShortestPathAllPairsJohnson - Class in com.jgalgo.alg.shortestpath: Johnson's algorithm for all pairs shortest path.
ShortestPathAllPairsJohnson() - Constructor for class com.jgalgo.alg.shortestpath.ShortestPathAllPairsJohnson: Create a APSP algorithm.
ShortestPathAStar - Class in com.jgalgo.alg.shortestpath: A* shortest path algorithm.
ShortestPathAStar() - Constructor for class com.jgalgo.alg.shortestpath.ShortestPathAStar: Construct a new AStart algorithm.
shortestPathExample() - Static method in class com.jgalgo.example.ShortestPathExample: This example demonstrates how to use the single-source shortest path algorithm.
ShortestPathExample - Class in com.jgalgo.example: This example demonstrates how to use the single-source shortest path algorithm.
ShortestPathHeuristicSt - Interface in com.jgalgo.alg.shortestpath: Shortest path algorithm that uses a distance heuristic function.
ShortestPathHeuristicStAbstract - Class in com.jgalgo.alg.shortestpath: Abstract class for computing shortest path between a source and a target with a heuristic.
ShortestPathHeuristicStAbstract() - Constructor for class com.jgalgo.alg.shortestpath.ShortestPathHeuristicStAbstract: Default constructor.
ShortestPathSingleSource - Interface in com.jgalgo.alg.shortestpath: Single Source Shortest Path algorithm.
ShortestPathSingleSource.Builder - Interface in com.jgalgo.alg.shortestpath: A builder for ShortestPathSingleSource objects.
ShortestPathSingleSource.IResult - Interface in com.jgalgo.alg.shortestpath: A result object for the ShortestPathSingleSource problem for IntGraph.
ShortestPathSingleSource.Result<V,E> - Interface in com.jgalgo.alg.shortestpath: A result object for the ShortestPathSingleSource problem.
ShortestPathSingleSourceAbstract - Class in com.jgalgo.alg.shortestpath: Abstract class for computing shortest path from a single source in graphs.
ShortestPathSingleSourceAbstract() - Constructor for class com.jgalgo.alg.shortestpath.ShortestPathSingleSourceAbstract: Default constructor.
ShortestPathSingleSourceBellmanFord - Class in com.jgalgo.alg.shortestpath: Bellman–Ford algorithm for Single Source Shortest Path (SSSP) with negative weights in directed graphs.
ShortestPathSingleSourceBellmanFord() - Constructor for class com.jgalgo.alg.shortestpath.ShortestPathSingleSourceBellmanFord: Create a Sssp bellman-ford algorithm.
ShortestPathSingleSourceCardinality - Class in com.jgalgo.alg.shortestpath: Single Source Shortest Path for cardinality weight function.
ShortestPathSingleSourceCardinality() - Constructor for class com.jgalgo.alg.shortestpath.ShortestPathSingleSourceCardinality: Create a cardinality BFS-based SSSP algorithm.
ShortestPathSingleSourceDag - Class in com.jgalgo.alg.shortestpath: Linear Single Source Shortest Path (SSSP) algorithm for directed acyclic graphs (DAG).
ShortestPathSingleSourceDag() - Constructor for class com.jgalgo.alg.shortestpath.ShortestPathSingleSourceDag: Create a SSSP algorithm for directed acyclic graphs (DAG).
ShortestPathSingleSourceDial - Class in com.jgalgo.alg.shortestpath: Dial's algorithm for Single Source Shortest Path for positive integer weights.
ShortestPathSingleSourceDial() - Constructor for class com.jgalgo.alg.shortestpath.ShortestPathSingleSourceDial: Create a Dial's SSSP algorithm for integer weights.
ShortestPathSingleSourceDijkstra - Class in com.jgalgo.alg.shortestpath: Dijkstra's algorithm for Single Source Shortest Path (SSSP).
ShortestPathSingleSourceDijkstra() - Constructor for class com.jgalgo.alg.shortestpath.ShortestPathSingleSourceDijkstra: Create a Dijkstra's SSSP algorithm.
ShortestPathSingleSourceGoldberg - Class in com.jgalgo.alg.shortestpath: Goldberg's SSSP algorithm for integer (positive and negative) weights on directed graphs.
ShortestPathSingleSourceGoldberg() - Constructor for class com.jgalgo.alg.shortestpath.ShortestPathSingleSourceGoldberg: Create a Goldberg's SSSP algorithm for integer weights, with negative weights.
ShortestPathSt - Interface in com.jgalgo.alg.shortestpath: An algorithm for computing the shortest path between two vertices in a graph.
ShortestPathStAbstract - Class in com.jgalgo.alg.shortestpath: Abstract class for computing a single shortest path between a source and a target.
ShortestPathStAbstract() - Constructor for class com.jgalgo.alg.shortestpath.ShortestPathStAbstract: Default constructor.
ShortestPathStBidirectionalBfs - Class in com.jgalgo.alg.shortestpath: Compute the shortest path between a source and a target using bidirectional breadth-first search.
ShortestPathStBidirectionalBfs() - Constructor for class com.jgalgo.alg.shortestpath.ShortestPathStBidirectionalBfs: Create a algorithm for computing a shortest path between a source and a target with respect to a cardinality weight function.
ShortestPathStBidirectionalDijkstra - Class in com.jgalgo.alg.shortestpath: Compute the shortest path between a source and a target using bidirectional Dijkstra's algorithm.
ShortestPathStBidirectionalDijkstra() - Constructor for class com.jgalgo.alg.shortestpath.ShortestPathStBidirectionalDijkstra: Create a algorithm for computing a shortest path between a source and a target.
shortestPathTree() - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.IResult
shortestPathTree() - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.Result: Get the shortest path tree.
shortestPathTree(boolean) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.IResult
shortestPathTree(boolean) - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.Result: Get the shortest path tree, optionally directed or undirected.
SimplePathsEnumerator - Interface in com.jgalgo.alg.shortestpath: An algorithm that enumerate over simple paths between a source and a target.
SimplePathsEnumeratorAbstract - Class in com.jgalgo.alg.shortestpath: Abstract class for enumerating all simple paths between a source and target vertices.
SimplePathsEnumeratorAbstract() - Constructor for class com.jgalgo.alg.shortestpath.SimplePathsEnumeratorAbstract: Default constructor.
SimplePathsEnumeratorSedgewick - Class in com.jgalgo.alg.shortestpath: Sedgewick's simple paths enumerator implementation.
SimplePathsEnumeratorSedgewick() - Constructor for class com.jgalgo.alg.shortestpath.SimplePathsEnumeratorSedgewick: Create a algorithm for enumerating over all simple paths between a source and target vertices.
simplePathsIter(Graph<V, E>, V, V) - Method in interface com.jgalgo.alg.shortestpath.SimplePathsEnumerator: Iterate over all the simple paths between a source and a target vertices in the given graph.
simplePathsIter(Graph<V, E>, V, V) - Method in class com.jgalgo.alg.shortestpath.SimplePathsEnumeratorAbstract
size() - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorDynamic: Get the number of vertices in the tree.
size() - Method in class com.jgalgo.alg.tree.LowestCommonAncestorDynamicGabowInts
size() - Method in class com.jgalgo.alg.tree.LowestCommonAncestorDynamicGabowLongs
size() - Method in class com.jgalgo.alg.tree.LowestCommonAncestorDynamicGabowSimple
size() - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorOffline.Queries: Get the number of queries in this container.
size() - Method in interface com.jgalgo.alg.tree.LowestCommonAncestorOffline.Result: Get the number of queries in this result.
size() - Method in interface com.jgalgo.alg.tree.TreePathMaxima.Queries: Get the number of queries in this container.
size() - Method in interface com.jgalgo.alg.tree.TreePathMaxima.Result: Get the number queries results this result object hold.
source() - Method in interface com.jgalgo.alg.common.IPath: Deprecated.
Please use IPath.sourceInt() instead to avoid un/boxing.
source() - Method in interface com.jgalgo.alg.common.Path: Get the source vertex of the path.
source() - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.IResult: Deprecated.
Please use ShortestPathSingleSource.IResult.sourceInt() instead to avoid un/boxing.
source() - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.Result: Get the source vertex from which all shortest paths were computed from.
source() - Method in interface com.jgalgo.graph.EdgeIter: Get the source vertex of the last returned edge.
source() - Method in interface com.jgalgo.graph.IEdgeIter: Deprecated.
Please use IEdgeIter.sourceInt() instead to avoid un/boxing.
sourceGraph() - Method in interface com.jgalgo.alg.isomorphism.IsomorphismIMapping
sourceGraph() - Method in interface com.jgalgo.alg.isomorphism.IsomorphismMapping: Get the source graph.
sourceInt() - Method in interface com.jgalgo.alg.common.IPath: Get the source vertex of the path.
sourceInt() - Method in interface com.jgalgo.alg.shortestpath.ShortestPathSingleSource.IResult: Get the source vertex from which all shortest paths were computed from.
sourceInt() - Method in interface com.jgalgo.graph.IEdgeIter: Get the source vertex of the last returned edge.
Sparse6GraphReader - Class in com.jgalgo.io: Read a graph in 'sparse6' format.
Sparse6GraphReader() - Constructor for class com.jgalgo.io.Sparse6GraphReader: Create a new reader.
Sparse6GraphWriter - Class in com.jgalgo.io: Write a graph in 'sparse6' format.
Sparse6GraphWriter() - Constructor for class com.jgalgo.io.Sparse6GraphWriter: Create a new writer.
staticLcaExample() - Static method in class com.jgalgo.example.LowestCommonAncestorExample: This example demonstrates how to use the static lowest common ancestor algorithm.
SteinerTreeAlgo - Interface in com.jgalgo.alg.span: An algorithm for the Steiner tree problem.
SteinerTreeAlgo.IResult - Interface in com.jgalgo.alg.span: A result object for SteinerTreeAlgo computation for IntGraph.
SteinerTreeAlgo.Result<V,E> - Interface in com.jgalgo.alg.span: A result object for SteinerTreeAlgo computation.
SteinerTreeAlgoAbstract - Class in com.jgalgo.alg.span: Abstract class for computing Steiner trees in graphs.
SteinerTreeAlgoAbstract() - Constructor for class com.jgalgo.alg.span.SteinerTreeAlgoAbstract: Default constructor.
SteinerTreeMehlhorn - Class in com.jgalgo.alg.span: Mehlhorn algorithm for Steiner tree approximation.
SteinerTreeMehlhorn() - Constructor for class com.jgalgo.alg.span.SteinerTreeMehlhorn: Construct a new Steiner tree algorithm object.
StronglyConnectedComponentsAlgo - Interface in com.jgalgo.alg.connect: Strongly Connected components algorithm.
StronglyConnectedComponentsAlgoAbstract - Class in com.jgalgo.alg.connect: Abstract class for computing strongly connected components in a graph.
StronglyConnectedComponentsAlgoAbstract() - Constructor for class com.jgalgo.alg.connect.StronglyConnectedComponentsAlgoAbstract: Default constructor.
StronglyConnectedComponentsPathBasedDfs - Class in com.jgalgo.alg.connect: Path based DFS implementation of Dijkstra's strongly connected components algorithm.
StronglyConnectedComponentsPathBasedDfs() - Constructor for class com.jgalgo.alg.connect.StronglyConnectedComponentsPathBasedDfs: Create a new instance of the algorithm.
StronglyConnectedComponentsTarjan - Class in com.jgalgo.alg.connect: Tarjan's strongly connected components algorithm.
StronglyConnectedComponentsTarjan() - Constructor for class com.jgalgo.alg.connect.StronglyConnectedComponentsTarjan: Create a new instance of the algorithm.
subGraph(Graph<V, E>, Collection<V>) - Static method in class com.jgalgo.graph.Graphs: Create a new graph that is an induced subgraph of the given graph.
subGraph(Graph<V, E>, Collection<V>, Collection<E>) - Static method in class com.jgalgo.graph.Graphs: Create a new graph that is a subgraph of the given graph.
subGraph(Graph<V, E>, Collection<V>, Collection<E>, boolean, boolean) - Static method in class com.jgalgo.graph.Graphs: Create a new graph that is a subgraph of the given graph, with option to copy weights.
subGraph(IntGraph, IntCollection, IntCollection, boolean, boolean) - Static method in class com.jgalgo.graph.Graphs: Create a new graph that is a subgraph of the given int graph, with option to copy weights.
subGraphCopy(Collection<Integer>, Collection<Integer>) - Method in interface com.jgalgo.graph.IntGraph: Create a new graph that is a subgraph of this graph.
subGraphCopy(Collection<V>, Collection<E>) - Method in interface com.jgalgo.graph.Graph: Create a new graph that is a subgraph of this graph.
subPath(int, int) - Method in interface com.jgalgo.alg.common.IPath
subPath(int, int) - Method in interface com.jgalgo.alg.common.Path: Create a sub path of this path that contains the edges between the specified fromEdgeIndex, inclusive, and toEdgeIndex, exclusive.
successors(V) - Method in class com.jgalgo.adapt.guava.GuavaGraphAdapter
successors(V) - Method in class com.jgalgo.adapt.guava.GuavaNetworkAdapter
successors(V) - Method in class com.jgalgo.adapt.guava.GuavaValueGraphAdapter
swapAndRemove(int, int) - Method in interface com.jgalgo.graph.IndexRemoveListener: A callback that is called when removedIdx is swapped with swappedIdx and then removed.
SymmetricDifferenceGraphGenerator<V,E> - Class in com.jgalgo.gen: Generate a graph that contains the edges that exist in one of two input graphs but not in both.
SymmetricDifferenceGraphGenerator() - Constructor for class com.jgalgo.gen.SymmetricDifferenceGraphGenerator: Create a new symmetric difference graph generator that will use the default graph factory.
SymmetricDifferenceGraphGenerator(GraphFactory<V, E>) - Constructor for class com.jgalgo.gen.SymmetricDifferenceGraphGenerator: Create a new symmetric difference graph generator that will use the given graph factory.

T

target() - Method in interface com.jgalgo.alg.common.IPath

Deprecated.
Please use IPath.targetInt() instead to avoid un/boxing.

target() - Method in interface com.jgalgo.alg.common.Path

Get the target vertex of the path.

target() - Method in interface com.jgalgo.graph.EdgeIter

Get the target vertex of the last returned edge.

target() - Method in interface com.jgalgo.graph.IEdgeIter

Deprecated.
Please use IEdgeIter.targetInt() instead to avoid un/boxing.

targetGraph() - Method in interface com.jgalgo.alg.isomorphism.IsomorphismIMapping

targetGraph() - Method in interface com.jgalgo.alg.isomorphism.IsomorphismMapping

Get the target graph.

targetInt() - Method in interface com.jgalgo.alg.common.IPath

Get the target vertex of the path.

targetInt() - Method in interface com.jgalgo.graph.IEdgeIter

Get the target vertex of the last returned edge.

TopologicalOrderAlgo - Interface in com.jgalgo.alg.dag

Algorithm that calculate a topological order of graph vertices.

TopologicalOrderAlgo.IResult - Interface in com.jgalgo.alg.dag

A result object of a TopologicalOrderAlgo algorithm for IntGraph.

TopologicalOrderAlgo.Result<V,E> - Interface in com.jgalgo.alg.dag

A result object of a TopologicalOrderAlgo algorithm.

TopologicalOrderAlgoAbstract - Class in com.jgalgo.alg.dag

Abstract class for computing a topological order in a DAG graph.

TopologicalOrderAlgoAbstract() - Constructor for class com.jgalgo.alg.dag.TopologicalOrderAlgoAbstract

Default constructor.

TopologicalOrderAlgoImpl - Class in com.jgalgo.alg.dag

A simple algorithm that compute a topological order in a DAG graph.

TopologicalOrderAlgoImpl() - Constructor for class com.jgalgo.alg.dag.TopologicalOrderAlgoImpl

Create a new topological order algorithm.

toString() - Method in class com.jgalgo.graph.AbstractGraph

TreePathMaxima - Interface in com.jgalgo.alg.tree

Tree Path Maxima (TPM) algorithm.

TreePathMaxima.IQueries - Interface in com.jgalgo.alg.tree

Queries container for TreePathMaxima computations for IntGraph.

TreePathMaxima.IResult - Interface in com.jgalgo.alg.tree

A result object for TreePathMaxima algorithm for IntGraph.

TreePathMaxima.Queries<V,E> - Interface in com.jgalgo.alg.tree

Queries container for TreePathMaxima computations.

TreePathMaxima.Result<V,E> - Interface in com.jgalgo.alg.tree

A result object for TreePathMaxima algorithm.

TreePathMaximaAbstract - Class in com.jgalgo.alg.tree

Abstract class for TPM computations.

TreePathMaximaAbstract() - Constructor for class com.jgalgo.alg.tree.TreePathMaximaAbstract

Default constructor.

TreePathMaximaHagerup - Class in com.jgalgo.alg.tree

Hagerup's Tree Path Maxima (TPM) linear time algorithm.

TreePathMaximaHagerup() - Constructor for class com.jgalgo.alg.tree.TreePathMaximaHagerup

Create a new TPM object.

Trees - Class in com.jgalgo.alg.tree

Static methods class for tree graphs.

Tsp - Interface in com.jgalgo.alg.shortestpath

Traveling Salesman Problem (TSP) algorithm.

TspAbstract - Class in com.jgalgo.alg.shortestpath

Abstract class for computing the shortest tour that visit all vertices in a graph.

TspAbstract() - Constructor for class com.jgalgo.alg.shortestpath.TspAbstract

Default constructor.

TspMetricMatchingAppx - Class in com.jgalgo.alg.shortestpath

TSP \(3/2\)-approximation using maximum matching.

TspMetricMatchingAppx() - Constructor for class com.jgalgo.alg.shortestpath.TspMetricMatchingAppx

Create a new TSP \(3/2\)-approximation algorithm.

TspMetricMstAppx - Class in com.jgalgo.alg.shortestpath

Metric TSP \(2\)-approximation using minimum spanning trees.

TspMetricMstAppx() - Constructor for class com.jgalgo.alg.shortestpath.TspMetricMstAppx

Create a new TSP \(2\)-approximation algorithm.

U

undirected() - Method in class com.jgalgo.gen.CompleteBipartiteGraphGenerator

Sets the generated graph(s) to be undirected.

undirected() - Method in class com.jgalgo.gen.GnmBipartiteGraphGenerator

Sets the generated graph(s) to be undirected.

undirected() - Method in class com.jgalgo.gen.GnpBipartiteGraphGenerator

Sets the generated graph(s) to be undirected.

undirected() - Static method in interface com.jgalgo.graph.GraphBuilder

Create a new builder that builds undirected graphs.

undirected() - Static method in interface com.jgalgo.graph.GraphFactory

Create an undirected graph factory.

undirected() - Static method in interface com.jgalgo.graph.IndexGraphBuilder

Create a new builder that builds undirected graphs.

undirected() - Static method in interface com.jgalgo.graph.IndexGraphFactory

Create an undirected index graph factory.

undirected() - Static method in interface com.jgalgo.graph.IntGraphBuilder

Create a new builder that builds undirected graphs.

undirected() - Static method in interface com.jgalgo.graph.IntGraphFactory

Create an undirected int graph factory.

undirectedView() - Method in interface com.jgalgo.graph.Graph

Get an undirected view of this (directed) graph.

undirectedView() - Method in interface com.jgalgo.graph.IndexGraph

undirectedView() - Method in interface com.jgalgo.graph.IntGraph

UniformTreeGenerator<V,E> - Class in com.jgalgo.gen

Generate a uniform random tree.

UniformTreeGenerator() - Constructor for class com.jgalgo.gen.UniformTreeGenerator

Create a new uniform tree generator that will use the default graph factory.

UniformTreeGenerator(GraphFactory<V, E>) - Constructor for class com.jgalgo.gen.UniformTreeGenerator

Create a new uniform tree generator that will use the given graph factory.

UnionGraphGenerator<V,E> - Class in com.jgalgo.gen

Generate the union graph of two or more given graphs.

UnionGraphGenerator() - Constructor for class com.jgalgo.gen.UnionGraphGenerator

Create a new union graph generator that will use the default graph factory.

UnionGraphGenerator(GraphFactory<V, E>) - Constructor for class com.jgalgo.gen.UnionGraphGenerator

Create a new union graph generator that will use the given graph factory.

unmatchedVertices() - Method in interface com.jgalgo.alg.match.IMatching

unmatchedVertices() - Method in interface com.jgalgo.alg.match.Matching

Get all the vertices that are not matched by the matching.

V

valueOf(Graph<V, E>, V, V, List<E>) - Static method in interface com.jgalgo.alg.common.Path

Create a new path from an edge list, a source and a target vertices.

valueOf(IntGraph, int, int, IntList) - Static method in interface com.jgalgo.alg.common.IPath

Create a new path from an edge list, a source and a target vertices.

valueOf(String) - Static method in enum com.jgalgo.alg.common.EdgeDirection

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.alg.common.EdgeDirection

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<V, E>, WeightFunction<E>, Collection<E>, TreePathMaxima) - Static method in interface com.jgalgo.alg.tree.TreePathMaxima

Verify that the given edges actually form an MST of a graph.

VertexBiPartition<V,E> - Interface in com.jgalgo.alg.common

A partition of the vertices of a graph into two blocks.

VertexBiPartitionWeightKey - Static variable in class com.jgalgo.alg.bipartite.BipartiteGraphs

The vertices weight key of the bipartite property.

vertexBlock(int) - Method in interface com.jgalgo.alg.common.IVertexBiPartition

vertexBlock(int) - Method in interface com.jgalgo.alg.common.IVertexPartition

Get the block containing a vertex.

vertexBlock(Integer) - Method in interface com.jgalgo.alg.common.IVertexBiPartition

Deprecated.
Please use IVertexBiPartition.vertexBlock(int) instead to avoid un/boxing.

vertexBlock(Integer) - Method in interface com.jgalgo.alg.common.IVertexPartition

Deprecated.
Please use IVertexPartition.vertexBlock(int) instead to avoid un/boxing.

vertexBlock(V) - Method in interface com.jgalgo.alg.common.VertexBiPartition

vertexBlock(V) - Method in interface com.jgalgo.alg.common.VertexPartition

Get the block containing a vertex.

vertexBuilder() - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper

vertexBuilder() - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper

vertexBuilder() - Method in interface com.jgalgo.graph.Graph

Get the vertex builder of this graph.

vertexBuilder() - Method in interface com.jgalgo.graph.GraphBuilder

Get the vertex builder of this builder.

vertexBuilder() - Method in interface com.jgalgo.graph.IndexGraph

Get the vertex builder of this graph.

vertexBuilder() - Method in interface com.jgalgo.graph.IndexGraphBuilder

Get the vertex builder of this builder.

vertexBuilder() - Method in interface com.jgalgo.graph.IntGraph

vertexBuilder() - Method in interface com.jgalgo.graph.IntGraphBuilder

vertexCoreNum(int) - Method in interface com.jgalgo.alg.cores.CoresAlgo.IResult

The core number of the given vertex.

vertexCoreNum(Integer) - Method in interface com.jgalgo.alg.cores.CoresAlgo.IResult

Deprecated.
Please use CoresAlgo.IResult.vertexCoreNum(int) instead to avoid un/boxing.

vertexCoreNum(V) - Method in interface com.jgalgo.alg.cores.CoresAlgo.Result

The core number of the given vertex.

VertexCover - Interface in com.jgalgo.alg.cover

Minimum weighted vertex cover algorithm.

VertexCoverAbstract - Class in com.jgalgo.alg.cover

Abstract class for computing a minimum vertex cover.

VertexCoverAbstract() - Constructor for class com.jgalgo.alg.cover.VertexCoverAbstract

Default constructor.

VertexCoverBarYehuda - Class in com.jgalgo.alg.cover

Bar Yehuda's vertex cover algorithm.

VertexCoverBarYehuda() - Constructor for class com.jgalgo.alg.cover.VertexCoverBarYehuda

Create a new Bar Yehuda's vertex cover algorithm object.

vertexOrderIndex(int) - Method in interface com.jgalgo.alg.dag.TopologicalOrderAlgo.IResult

Get the index of a vertex in the topological order.

vertexOrderIndex(Integer) - Method in interface com.jgalgo.alg.dag.TopologicalOrderAlgo.IResult

Deprecated.
Please use TopologicalOrderAlgo.IResult.vertexOrderIndex(int) instead to avoid un/boxing.

vertexOrderIndex(V) - Method in interface com.jgalgo.alg.dag.TopologicalOrderAlgo.Result

Get the index of a vertex in the topological order.

VertexPartition<V,E> - Interface in com.jgalgo.alg.common

A partition of the vertices of a graph.

vertexSet() - Method in class com.jgalgo.adapt.jgrapht.JGraphTAdapter

vertexSite(int) - Method in interface com.jgalgo.alg.shortestpath.VoronoiAlgo.IResult

Get the site vertex of a vertex.

vertexSite(Integer) - Method in interface com.jgalgo.alg.shortestpath.VoronoiAlgo.IResult

Deprecated.
Please use VoronoiAlgo.IResult.vertexSite(int) instead to avoid un/boxing.

vertexSite(V) - Method in interface com.jgalgo.alg.shortestpath.VoronoiAlgo.Result

Get the site vertex of a vertex.

vertices() - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper

vertices() - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper

vertices() - Method in interface com.jgalgo.alg.common.IPath

vertices() - Method in interface com.jgalgo.alg.common.Path

Get the vertices forming this path.

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.IntGraph

vertices() - Method in interface com.jgalgo.graph.IntGraphBuilder

vertices(int) - Method in class com.jgalgo.gen.BarabasiAlbertGraphGenerator

Set the number of vertices that will be generated for each graph.

vertices(int) - Method in class com.jgalgo.gen.CompleteGraphGenerator

Set the number of vertices that will be generated for each graph.

vertices(int) - Method in class com.jgalgo.gen.EmptyGraphGenerator

Set the number of vertices that will be generated for each graph.

vertices(int) - Method in class com.jgalgo.gen.GnmGraphGenerator

Set the number of vertices that will be generated for each graph.

vertices(int) - Method in class com.jgalgo.gen.GnpGraphGenerator

Set the number of vertices that will be generated for each graph.

vertices(int) - Method in class com.jgalgo.gen.RecursiveMatrixGraphGenerator

Set the number of vertices that will be generated for each graph.

vertices(int) - Method in class com.jgalgo.gen.UniformTreeGenerator

Set the number of vertices that will be generated for each graph.

vertices(int, int) - Method in class com.jgalgo.gen.CompleteBipartiteGraphGenerator

Set the number of vertices that will be generated for each graph.

vertices(int, int) - Method in class com.jgalgo.gen.GnmBipartiteGraphGenerator

Set the number of vertices that will be generated for each graph.

vertices(int, int) - Method in class com.jgalgo.gen.GnpBipartiteGraphGenerator

Set the number of vertices that will be generated for each graph.

vertices(int, int, IdBuilder<V>) - Method in class com.jgalgo.gen.CompleteBipartiteGraphGenerator

Set the number of vertices that will be generated for each graph, and the vertex builder that will be used to generate them.

vertices(int, int, IdBuilder<V>) - Method in class com.jgalgo.gen.GnmBipartiteGraphGenerator

Set the number of vertices that will be generated for each graph, and the vertex builder that will be used to generate them.

vertices(int, int, IdBuilder<V>) - Method in class com.jgalgo.gen.GnpBipartiteGraphGenerator

Set the number of vertices that will be generated for each graph, and the vertex builder that will be used to generate them.

vertices(int, IdBuilder<V>) - Method in class com.jgalgo.gen.BarabasiAlbertGraphGenerator

Set the number of vertices that will be generated for each graph, and the vertex builder that will be used to generate them.

vertices(int, IdBuilder<V>) - Method in class com.jgalgo.gen.CompleteGraphGenerator

Set the number of vertices that will be generated for each graph, and the vertex builder that will be used to generate them.

vertices(int, IdBuilder<V>) - Method in class com.jgalgo.gen.EmptyGraphGenerator

Set the number of vertices that will be generated for each graph, and the vertex builder that will be used to generate them.

vertices(int, IdBuilder<V>) - Method in class com.jgalgo.gen.GnmGraphGenerator

Set the number of vertices that will be generated for each graph, and the vertex builder that will be used to generate them.

vertices(int, IdBuilder<V>) - Method in class com.jgalgo.gen.GnpGraphGenerator

Set the number of vertices that will be generated for each graph, and the vertex builder that will be used to generate them.

vertices(int, IdBuilder<V>) - Method in class com.jgalgo.gen.RecursiveMatrixGraphGenerator

Set the number of vertices that will be generated for each graph, and the vertex builder that will be used to generate them.

vertices(int, IdBuilder<V>) - Method in class com.jgalgo.gen.UniformTreeGenerator

Set the number of vertices that will be generated for each graph, and the vertex builder that will be used to generate them.

vertices(Collection<? extends V>) - Method in class com.jgalgo.gen.BarabasiAlbertGraphGenerator

Set the vertices set of the generated graph(s).

vertices(Collection<? extends V>) - Method in class com.jgalgo.gen.CompleteGraphGenerator

Set the vertices set of the generated graph(s).

vertices(Collection<? extends V>) - Method in class com.jgalgo.gen.EmptyGraphGenerator

Set the vertices set of the generated graph(s).

vertices(Collection<? extends V>) - Method in class com.jgalgo.gen.GnmGraphGenerator

Set the vertices set of the generated graph(s).

vertices(Collection<? extends V>) - Method in class com.jgalgo.gen.GnpGraphGenerator

Set the vertices set of the generated graph(s).

vertices(Collection<? extends V>) - Method in class com.jgalgo.gen.RecursiveMatrixGraphGenerator

Set the vertices set of the generated graph(s).

vertices(Collection<? extends V>) - Method in class com.jgalgo.gen.UniformTreeGenerator

Set the vertices set of the generated graph(s).

vertices(Collection<? extends V>, Collection<? extends V>) - Method in class com.jgalgo.gen.CompleteBipartiteGraphGenerator

Set the vertices of the generated graph(s).

vertices(Collection<? extends V>, Collection<? extends V>) - Method in class com.jgalgo.gen.GnmBipartiteGraphGenerator

Set the vertices of the generated graph(s).

vertices(Collection<? extends V>, Collection<? extends V>) - Method in class com.jgalgo.gen.GnpBipartiteGraphGenerator

Set the vertices of the generated graph(s).

verticesIter(Graph<V, E>, V, List<E>) - Static method in interface com.jgalgo.alg.common.Path

Create an iterator that iterate over the vertices visited by an edge path.

verticesIter(IntGraph, int, IntList) - Static method in interface com.jgalgo.alg.common.IPath

Create an iterator that iterate over the vertices visited by an edge path.

verticesReIndexing - Variable in class com.jgalgo.graph.IndexGraphBuilder.ReIndexedGraph

The re-indexing map of the vertices.

verticesWeights(String) - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper

verticesWeights(String) - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper

verticesWeights(String) - Method in interface com.jgalgo.graph.Graph

Get the vertices weights of some key.

verticesWeights(String) - Method in interface com.jgalgo.graph.GraphBuilder

Get the vertices weights of some key.

verticesWeights(String) - Method in interface com.jgalgo.graph.IntGraph

Get the vertices weights of some key.

verticesWeights(String) - Method in interface com.jgalgo.graph.IntGraphBuilder

Get the vertices weights of some key.

verticesWeightsKeys() - Method in class com.jgalgo.adapt.guava.GuavaNetworkWrapper

verticesWeightsKeys() - Method in class com.jgalgo.adapt.jgrapht.JGraphTWrapper

verticesWeightsKeys() - Method in interface com.jgalgo.graph.Graph

Get the keys of all the associated vertices weights.

verticesWeightsKeys() - Method in interface com.jgalgo.graph.GraphBuilder

Get the keys of all the associated vertices weights.

verticesWeightsKeys(Set<String>) - Method in class com.jgalgo.gen.UnionGraphGenerator

Set the vertices weights keys to be copied from the input graphs to the generated graph(s).

VoronoiAlgo - Interface in com.jgalgo.alg.shortestpath

Voronoi cells algorithm.

VoronoiAlgo.IResult - Interface in com.jgalgo.alg.shortestpath

A result object of VoronoiAlgo computation for IntGraph.

VoronoiAlgo.Result<V,E> - Interface in com.jgalgo.alg.shortestpath

A result object of VoronoiAlgo computation.

VoronoiAlgoAbstract - Class in com.jgalgo.alg.shortestpath

Abstract class for computing the Voronoi cells in a graph given a set of site vertices.

VoronoiAlgoAbstract() - Constructor for class com.jgalgo.alg.shortestpath.VoronoiAlgoAbstract

Default constructor.

VoronoiAlgoDijkstra - Class in com.jgalgo.alg.shortestpath

Variant of Dijkstra algorithm that starts at multiple vertices and compute the Voronoi cells.

VoronoiAlgoDijkstra() - Constructor for class com.jgalgo.alg.shortestpath.VoronoiAlgoDijkstra

Create a algorithm for computing the Voronoi cells in a graph.

W

WeaklyConnectedComponentsAlgo - Interface in com.jgalgo.alg.connect

Weakly Connected components algorithm.

WeaklyConnectedComponentsAlgoAbstract - Class in com.jgalgo.alg.connect

Abstract class for computing weakly connected components in a graph.

WeaklyConnectedComponentsAlgoAbstract() - Constructor for class com.jgalgo.alg.connect.WeaklyConnectedComponentsAlgoAbstract

Default constructor.

WeaklyConnectedComponentsAlgoImpl - Class in com.jgalgo.alg.connect

Simple implementation of the weakly connected components algorithm.

WeaklyConnectedComponentsAlgoImpl() - Constructor for class com.jgalgo.alg.connect.WeaklyConnectedComponentsAlgoImpl

Create a new instance of the algorithm.

weight(int) - Method in interface com.jgalgo.graph.IWeightFunction

Get the weight of an element.

weight(int) - Method in interface com.jgalgo.graph.IWeightFunctionInt

Deprecated.
Please use IWeightFunctionInt.weightInt(int) instead to avoid un/boxing, and tp avoid the cast to int.

weight(int) - Method in interface com.jgalgo.graph.IWeightsDouble

Get the weight of an element.

weight(int) - Method in interface com.jgalgo.graph.IWeightsFloat

Get the weight of an element.

weight(int) - Method in interface com.jgalgo.graph.IWeightsLong

Get the weight of an element.

weight(Integer) - Method in interface com.jgalgo.graph.IWeightFunction

Deprecated.
Please use IWeightFunction.weight(int) instead to avoid un/boxing.

weight(Integer) - Method in interface com.jgalgo.graph.IWeightFunctionInt

Deprecated.
Please use IWeightFunctionInt.weightInt(int) instead to avoid un/boxing, and tp avoid the cast to int.

weight(Integer) - Method in interface com.jgalgo.graph.IWeightsDouble

Deprecated.

weight(Integer) - Method in interface com.jgalgo.graph.IWeightsFloat

Deprecated.

weight(Integer) - Method in interface com.jgalgo.graph.IWeightsLong

Deprecated.

weight(K) - Method in interface com.jgalgo.graph.WeightFunction

Get the weight of an element.

weight(K) - Method in interface com.jgalgo.graph.WeightFunctionInt

Deprecated.
Please use WeightFunctionInt.weightInt(Object) instead to avoid un/boxing.

weight(K) - Method in interface com.jgalgo.graph.WeightsDouble

Get the weight of an element.

weight(K) - Method in interface com.jgalgo.graph.WeightsFloat

Get the weight of an element.

weight(K) - Method in interface com.jgalgo.graph.WeightsLong

Get the weight of an element.

WeightFunction<K> - Interface in com.jgalgo.graph

Weight function that maps graph edges or vertices to weights.

WeightFunctionInt<K> - 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.IWeightFunctionInt

Get the integer weight of an element.

weightInt(int) - Method in interface com.jgalgo.graph.IWeightsByte

Get the integer weight of an element.

weightInt(int) - Method in interface com.jgalgo.graph.IWeightsInt

Get the integer weight of an element.

weightInt(int) - Method in interface com.jgalgo.graph.IWeightsShort

Get the integer weight of an element.

weightInt(Integer) - Method in interface com.jgalgo.graph.IWeightFunctionInt

Deprecated.
Please use IWeightFunctionInt.weightInt(int) instead to avoid un/boxing.

weightInt(Integer) - Method in interface com.jgalgo.graph.IWeightsByte

Deprecated.

weightInt(Integer) - Method in interface com.jgalgo.graph.IWeightsInt

Deprecated.

weightInt(Integer) - Method in interface com.jgalgo.graph.IWeightsShort

Deprecated.

weightInt(K) - Method in interface com.jgalgo.graph.WeightFunctionInt

Get the integer weight of an element.

weightInt(K) - Method in interface com.jgalgo.graph.WeightsByte

Get the integer weight of an element.

weightInt(K) - Method in interface com.jgalgo.graph.WeightsInt

Get the integer weight of an element.

weightInt(K) - Method in interface com.jgalgo.graph.WeightsShort

Get the integer weight of an element.

Weights<K,T> - Interface in com.jgalgo.graph

Weights of graph vertices or edges.

WeightsBool<K> - Interface in com.jgalgo.graph

Specific weights of boolean.

WeightsByte<K> - Interface in com.jgalgo.graph

Specific weights of byte.

WeightsChar<K> - Interface in com.jgalgo.graph

Specific weights of char.

WeightsDouble<K> - Interface in com.jgalgo.graph

Specific weights of double.

WeightsFloat<K> - Interface in com.jgalgo.graph

Specific weights of float.

WeightsInt<K> - Interface in com.jgalgo.graph

Specific weights of int.

WeightsLong<K> - Interface in com.jgalgo.graph

Specific weights of long.

WeightsObj<K,T> - Interface in com.jgalgo.graph

Specific weights of Object.

WeightsShort<K> - Interface in com.jgalgo.graph

Specific weights of short.

weightSum(IWeightFunction, IntIterable) - Static method in interface com.jgalgo.graph.IWeightFunction

Get the sum of the weights of multiple elements.

weightSum(WeightFunction<K>, Iterable<K>) - Static method in interface com.jgalgo.graph.WeightFunction

Get the sum of the weights of multiple elements.

weightSum(Iterable<Integer>) - Method in interface com.jgalgo.graph.IWeightFunction

weightSum(Iterable<Integer>) - Method in interface com.jgalgo.graph.IWeightFunctionInt

weightSum(Iterable<K>) - Method in interface com.jgalgo.graph.WeightFunction

Get the sum of the weights of multiple elements.

weightSum(Iterable<K>) - Method in interface com.jgalgo.graph.WeightFunctionInt

writeGraph(Graph<V, E>, File) - Method in interface com.jgalgo.io.GraphWriter

Write a graph to a file.

writeGraph(Graph<V, E>, Writer) - Method in interface com.jgalgo.io.GraphWriter

Write a graph to an I/O writer.

writeGraph(Graph<V, E>, String) - Method in interface com.jgalgo.io.GraphWriter

Write a graph to a file, given its path.

writeGraphImpl(Graph<Integer, Integer>, Writer) - Method in class com.jgalgo.io.DimacsGraphWriter

writeGraphImpl(Graph<Integer, Integer>, Writer) - Method in class com.jgalgo.io.LedaGraphWriter

writeGraphImpl(Graph<V, E>, Writer) - Method in class com.jgalgo.io.GmlGraphWriter

A B C D E F G H I J K L M N O P R S T U V W
All Classes All Packages