diff --git a/0.4.1-snapshot/allclasses-index.html b/0.4.1-snapshot/allclasses-index.html index 3e64585110..3e31620506 100644 --- a/0.4.1-snapshot/allclasses-index.html +++ b/0.4.1-snapshot/allclasses-index.html @@ -2,10 +2,10 @@ - + All Classes (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -28,7 +28,7 @@ catch(err) { } //--> -var data = {"i0":2,"i1":1,"i2":2,"i3":2,"i4":1,"i5":1,"i6":1,"i7":1,"i8":1,"i9":2,"i10":2,"i11":2,"i12":1,"i13":1,"i14":2,"i15":2,"i16":1,"i17":1,"i18":2,"i19":2,"i20":2,"i21":2,"i22":2,"i23":2,"i24":2,"i25":2,"i26":1,"i27":1,"i28":1,"i29":1,"i30":1,"i31":1,"i32":1,"i33":2,"i34":2,"i35":2,"i36":2,"i37":2,"i38":1,"i39":1,"i40":1,"i41":1,"i42":4,"i43":1,"i44":2,"i45":1,"i46":2,"i47":1,"i48":1,"i49":2,"i50":2,"i51":2,"i52":2,"i53":2,"i54":2,"i55":2,"i56":2,"i57":1,"i58":2,"i59":2,"i60":1,"i61":1,"i62":4,"i63":1,"i64":2,"i65":2,"i66":1,"i67":2,"i68":1,"i69":2,"i70":2,"i71":2,"i72":2,"i73":2,"i74":2,"i75":2,"i76":1,"i77":1,"i78":1,"i79":1,"i80":1,"i81":1,"i82":1,"i83":1,"i84":1,"i85":1,"i86":2,"i87":2,"i88":1,"i89":1,"i90":2,"i91":1,"i92":1,"i93":2,"i94":1,"i95":1,"i96":1,"i97":1,"i98":1,"i99":1,"i100":1,"i101":1,"i102":1,"i103":1,"i104":1,"i105":1,"i106":1,"i107":1,"i108":1,"i109":1,"i110":1,"i111":1,"i112":1,"i113":1,"i114":1,"i115":2,"i116":2,"i117":2,"i118":1,"i119":2,"i120":2,"i121":1,"i122":1,"i123":1,"i124":2,"i125":2,"i126":2,"i127":2,"i128":2,"i129":1,"i130":1,"i131":1,"i132":2,"i133":1,"i134":1,"i135":1,"i136":1,"i137":1,"i138":1,"i139":1,"i140":1,"i141":1,"i142":1,"i143":1,"i144":1,"i145":1,"i146":2,"i147":2,"i148":2,"i149":1,"i150":2,"i151":2,"i152":1,"i153":1,"i154":2,"i155":1,"i156":1,"i157":1,"i158":1,"i159":2,"i160":2,"i161":1,"i162":2,"i163":2,"i164":1,"i165":2,"i166":1,"i167":1,"i168":1,"i169":1,"i170":1,"i171":1,"i172":2,"i173":1,"i174":2,"i175":2,"i176":1,"i177":2,"i178":2,"i179":1,"i180":2,"i181":2,"i182":1,"i183":2,"i184":2,"i185":8,"i186":8,"i187":8,"i188":1,"i189":1,"i190":1,"i191":1,"i192":2,"i193":1,"i194":1,"i195":1,"i196":1,"i197":2,"i198":1,"i199":1,"i200":1,"i201":1,"i202":1,"i203":1,"i204":1,"i205":1,"i206":1,"i207":2,"i208":2,"i209":1,"i210":1,"i211":1,"i212":1,"i213":1,"i214":2,"i215":2,"i216":2,"i217":2,"i218":1,"i219":1,"i220":1,"i221":1,"i222":1,"i223":1,"i224":1,"i225":1,"i226":1,"i227":2,"i228":1,"i229":2,"i230":2,"i231":2,"i232":2,"i233":1,"i234":1,"i235":1,"i236":1,"i237":1,"i238":1,"i239":1,"i240":2,"i241":2,"i242":1,"i243":1,"i244":2,"i245":1,"i246":1,"i247":1,"i248":1,"i249":1,"i250":1,"i251":1,"i252":1,"i253":1,"i254":1}; +var data = {"i0":2,"i1":1,"i2":2,"i3":2,"i4":1,"i5":1,"i6":1,"i7":1,"i8":1,"i9":2,"i10":2,"i11":2,"i12":1,"i13":2,"i14":2,"i15":1,"i16":2,"i17":2,"i18":1,"i19":1,"i20":2,"i21":2,"i22":2,"i23":2,"i24":2,"i25":2,"i26":2,"i27":2,"i28":1,"i29":1,"i30":1,"i31":2,"i32":2,"i33":1,"i34":1,"i35":2,"i36":2,"i37":2,"i38":1,"i39":1,"i40":2,"i41":2,"i42":2,"i43":2,"i44":2,"i45":1,"i46":1,"i47":2,"i48":2,"i49":1,"i50":1,"i51":2,"i52":2,"i53":2,"i54":4,"i55":1,"i56":2,"i57":1,"i58":2,"i59":1,"i60":1,"i61":2,"i62":2,"i63":2,"i64":2,"i65":2,"i66":2,"i67":2,"i68":2,"i69":1,"i70":2,"i71":2,"i72":1,"i73":1,"i74":4,"i75":1,"i76":2,"i77":2,"i78":1,"i79":2,"i80":1,"i81":2,"i82":2,"i83":2,"i84":2,"i85":2,"i86":2,"i87":2,"i88":1,"i89":1,"i90":1,"i91":1,"i92":1,"i93":1,"i94":1,"i95":1,"i96":1,"i97":1,"i98":2,"i99":2,"i100":1,"i101":1,"i102":2,"i103":1,"i104":1,"i105":2,"i106":1,"i107":1,"i108":1,"i109":1,"i110":1,"i111":1,"i112":1,"i113":1,"i114":1,"i115":1,"i116":1,"i117":1,"i118":1,"i119":1,"i120":1,"i121":1,"i122":1,"i123":1,"i124":1,"i125":1,"i126":1,"i127":2,"i128":2,"i129":2,"i130":1,"i131":2,"i132":2,"i133":1,"i134":1,"i135":1,"i136":2,"i137":2,"i138":2,"i139":2,"i140":2,"i141":1,"i142":1,"i143":1,"i144":2,"i145":1,"i146":1,"i147":1,"i148":1,"i149":1,"i150":1,"i151":1,"i152":1,"i153":1,"i154":1,"i155":1,"i156":1,"i157":1,"i158":2,"i159":2,"i160":2,"i161":1,"i162":2,"i163":2,"i164":1,"i165":1,"i166":2,"i167":1,"i168":1,"i169":1,"i170":1,"i171":2,"i172":2,"i173":1,"i174":2,"i175":2,"i176":1,"i177":2,"i178":1,"i179":1,"i180":2,"i181":2,"i182":2,"i183":1,"i184":1,"i185":1,"i186":1,"i187":2,"i188":1,"i189":2,"i190":2,"i191":1,"i192":2,"i193":2,"i194":1,"i195":2,"i196":2,"i197":1,"i198":2,"i199":2,"i200":8,"i201":8,"i202":8,"i203":1,"i204":1,"i205":1,"i206":1,"i207":2,"i208":1,"i209":1,"i210":1,"i211":1,"i212":2,"i213":1,"i214":1,"i215":1,"i216":1,"i217":1,"i218":1,"i219":1,"i220":1,"i221":1,"i222":2,"i223":2,"i224":1,"i225":1,"i226":1,"i227":1,"i228":1,"i229":2,"i230":2,"i231":2,"i232":2,"i233":1,"i234":1,"i235":1,"i236":2,"i237":2,"i238":1,"i239":1,"i240":1,"i241":1,"i242":1,"i243":1,"i244":2,"i245":1,"i246":2,"i247":2,"i248":2,"i249":2,"i250":1,"i251":1,"i252":2,"i253":2,"i254":1,"i255":1,"i256":1,"i257":1,"i258":1,"i259":2,"i260":2,"i261":1,"i262":1,"i263":2,"i264":1,"i265":1,"i266":1,"i267":1,"i268":1,"i269":1,"i270":1,"i271":1,"i272":1,"i273":1}; var tabs = {65535:["t0","All Classes"],1:["t1","Interface Summary"],2:["t2","Class Summary"],4:["t3","Enum Summary"],8:["t4","Exception Summary"]}; var altColor = "altColor"; var rowColor = "rowColor"; @@ -192,1456 +192,1570 @@

All Classes

+ChinesePostmanAbstract + +
Abstract class for computing a shortest edge visitor circle in a graph.
+ + + +ChinesePostmanImpl + +
An algorithm for the chinese postman problem using minimum weighted perfect matching and Eulerian tour.
+ + + ClosuresEnumerator
An algorithm that enumerate all the closure subsets in a directed graph.
- + ClosuresEnumeratorAbstract
Abstract class for enumerating over all the closure subsets in a directed graph.
- + ClosuresEnumeratorSchrageBaker
Schrage-Baker algorithm for enumerating all the closure subsets in a directed graph.
- + ColoringAlgo
An algorithm that assign a color to each vertex in a graph while avoiding identical color for any pair of adjacent vertices.
- + ColoringAlgo.Builder
A builder for ColoringAlgo objects.
- + ColoringAlgoAbstract
Abstract class for coloring algorithms.
- + ColoringDSatur
The D-Satur coloring algorithm.
- + ColoringExample
This example demonstrates how to use the coloring algorithm.
- + ColoringGreedy
A greedy coloring algorithm with random vertices order.
- + ColoringRecursiveLargestFirst
The Recursive Largest First coloring algorithm.
- + ComplementGraphGenerator<V,​E>
Generates the complement graph of a given graph.
- + CompleteBipartiteGraphGenerator<V,​E>
Generates a complete bipartite graph.
- + CompleteGraphGenerator<V,​E>
Generates a complete graph.
- + CoresAlgo
Cores computing algorithm.
- + CoresAlgo.IResult
The result of the cores computation for IntGraph.
- + CoresAlgo.Result<V,​E>
The result of the cores computation.
- + +CoresAlgoAbstract + +
Abstract class for computing the cores of a graph.
+ + + +CoresAlgoImpl + +
Linear cores computing algorithm.
+ + + CyclesEnumerator
An algorithm that enumerate all cycles in a graph.
- + CyclesEnumerator.Builder
A builder for CyclesEnumerator objects.
- + +CyclesEnumeratorAbstract + +
Abstract class for enumerating all simple cycles in a graph.
+ + + +CyclesEnumeratorJohnson + +
Johnson's algorithm for finding all cycles in a directed graph.
+ + + +CyclesEnumeratorTarjan + +
Tarjan's algorithm for enumeration all cycles in a directed graph.
+ + + DfsIter<V,​E>
Depth first search (DFS) iterators static class.
- + DfsIter.Int
A DFS iterator for IntGraph.
- + DifferenceGraphGenerator<V,​E>
Generate a graph that contains the edges that exist in one graph but not in the other.
- + Digraph6GraphReader
Read a graph in 'digraph6' format.
- + Digraph6GraphWriter
Write a graph in 'digraph6' format.
- + DimacsGraphReader
Read a graph in 'DIMACS' format.
- + DimacsGraphWriter
Write a graph in 'DIMACS' format.
- + DistanceMeasures<V,​E>
A set of graph distance measures.
- + DominatingSetAlgo
An algorithm for computing a minimum dominating set.
- + +DominatingSetAlgoAbstract + +
Abstract class for computing a minimum dominating set.
+ + + +DominatingSetAlgoGreedy + +
A greedy algorithm for computing a minimum dominating set.
+ + + EdgeCover
Minimum edge vertex cover algorithm.
- + EdgeCover.Builder
A builder for EdgeCover algorithms.
- + +EdgeCoverAbstract + +
Abstract class for computing a minimum edge cover.
+ + + +EdgeCoverCardinality + +
A simply algorithm for computing a minimum edge cover using a maximum matching algorithm.
+ + + +EdgeCoverWeighted + +
A simply algorithm for computing a minimum weighted edge cover using a minimum weighted perfect matching algorithm.
+ + + EdgeDirection
The direction type of an edge with respect to a vertex.
- + EdgeIter<V,​E>
Iterator used to iterate over graph edges.
- + EdgeIterationExample
This example demonstrates how to iterate over the edges of a graph.
- + EdgeSet<V,​E>
Set of graph edges.
- + EmptyGraphGenerator<V,​E>
Generate a graph with no edges.
- + EulerianTourAlgo
Eulerian tour calculation algorithm.
- + Flow<V,​E>
Flow on graph edges.
- + GexfGraphReader<V,​E>
Read a graph in 'GEXF' format.
- + GexfGraphWriter<V,​E>
Write a graph in 'GEXF' format.
- + GmlGraphReader<V,​E>
Read a graph in 'GML' format.
- + GmlGraphWriter<V,​E>
Write a graph in 'GML' format.
- + GnmBipartiteGraphGenerator<V,​E>
Generates a uniformly random bipartite graph among all graphs with \(n\) vertices and \(m\) edges.
- + GnmGraphGenerator<V,​E>
Generates a uniformly random graph among all graphs with \(n\) vertices and \(m\) edges.
- + GnpBipartiteGraphGenerator<V,​E>
Generates a random bipartite graph using the \(G(n_1,n_2,p)\) model in which every edge exists with probability \(p\).
- + GnpGraphGenerator<V,​E>
Generates a random graph using the \(G(n,p)\) model in which every edge exists with probability \(p\).
- + Graph<V,​E>
A discrete graph with vertices and edges.
- + Graph6GraphReader
Read a graph in 'graph6' format.
- + Graph6GraphWriter
Write a graph in 'graph6' format.
- + GraphBuilder<V,​E>
A builder for graphs.
- + GraphFactory<V,​E>
A factory for Graph objects.
- + GraphFactory.Hint
Hints for a graph factory.
- + GraphGenerator<V,​E>
A generator of graphs.
- + GraphMlGraphReader<V,​E>
Read a graph in 'GraphML' format.
- + GraphMlGraphWriter<V,​E>
Write a graph in 'GraphML' format.
- + GraphReader<V,​E>
A reader that reads Graphs from files/IO-reader.
- + Graphs
Static methods class for graphs.
- + GraphWriter<V,​E>
A writer that writes Graphs to files/IO-writer.
- + GuavaGraphAdapter<V,​E>
An adapter from a JGAlgo graph to a Guava graph.
- + GuavaMutableGraphAdapter<V,​E>
An adapter from a JGAlgo graph to a mutable GUava graph.
- + GuavaMutableNetworkAdapter<V,​E>
An adapter from a JGAlgo graph to a Guava network.
- + GuavaMutableValueGraphAdapter<V,​E,​ValueT>
An adapter from a JGAlgo graph to a mutable Guava value graph.
- + GuavaNetworkAdapter<V,​E>
An adapter from a JGAlgo graph to a Guava network.
- + GuavaNetworkWrapper<V,​E>
An adapter from Guava Network to JGAlgo Graph.
- + GuavaValueGraphAdapter<V,​E,​ValueT>
An adapter from a JGAlgo graph to a Guava value graph.
- + HamiltonianPathAlgo
Hamiltonian path/cycle algorithm.
- + IdBuilder<K>
Builder for unique identifiers of vertices or edges in a graph.
- + IdBuilderInt
Builder for unique identifiers of vertices or edges in an IntGraph.
- + IDistanceMeasures
A set of graph distance measures for IntGraph.
- + IEdgeIter
Iterator used to iterate over int graph edges.
- + IEdgeSet
Set of int graph edges.
- + IFlow
Flow on IntGraph edges.
- + IMatching
A matching in a IntGraph.
- + IndexGraph
A graph whose vertices and edges identifiers are indices.
- + IndexGraphBuilder
A builder for Index graphs.
- + IndexGraphBuilder.ReIndexedGraph
A result object of re-indexing and building a graph operation.
- + IndexGraphBuilder.ReIndexingMap
A map of indices in range \([0, n)\) to indices in range \([0, n)\).
- + IndexGraphFactory
A factory for Index graphs.
- + IndexIdMap<K>
A mapping between Graph IDs to IndexGraph indices.
- + IndexIdMaps
Static methods class for index-id maps.
- + IndexIntIdMap
A mapping between IntGraph IDs to IndexGraph indices.
- + IndexRemoveListener
A listener that will be notified when an IndexGraph remove a vertex or an edge.
- + IntersectionGraphGenerator<V,​E>
Generate the intersection graph of two or more given graphs.
- + IntGraph
A discrete graph with int vertices and edges.
- + IntGraphBuilder
A builder for int graphs.
- + IntGraphFactory
A factory for IntGraph objects.
- + IPath
A path of edges in an int graph.
- + IsomorphismIMapping
A mapping between two graphs that preserves the structure of the graphs for IntGraph.
- + IsomorphismMapping<V1,​E1,​V2,​E2>
A mapping between two graphs that preserves the structure of the graphs.
- + IsomorphismTester
Tester that check whether two graphs are isomorphic.
- + IVertexBiPartition
A partition of the vertices of an int graph into two blocks.
- + IVertexPartition
A partition of the vertices of an int graph.
- + IWeightFunction
Weight function that maps graph edges or vertices of IntGraph to weights.
- + IWeightFunctionInt
Weight function that maps graph edges or vertices of IntGraph to integer weights.
- + IWeights<T>
Weights of int graph vertices or edges.
- + IWeightsBool
Specific weights of boolean for int graphs.
- + IWeightsByte
Specific weights of byte for int graphs.
- + IWeightsChar
Specific weights of char for int graphs.
- + IWeightsDouble
Specific weights of double for int graphs.
- + IWeightsFloat
Specific weights of float for int graphs.
- + IWeightsInt
Specific weights of int for int graphs.
- + IWeightsLong
Specific weights of long for int graphs.
- + IWeightsObj<T>
Specific weights of Object for int graphs.
- + IWeightsShort
Specific weights of short for int graphs.
- + JGAlgoConfig
A global configuration class.
- + JGraphTAdapter<V,​E>
An adapter from JGAlgo graph to JGraphT graph.
- + JGraphTWrapper<V,​E>
An adapter from JGraphT graph to JGAlgo graph.
- + KEdgeConnectedComponentsAlgo
An algorithm that compute the k-edge connected components of a graph.
- + KEdgeConnectedComponentsAlgoAbstract
Abstract class for k-edge connected components algorithms.
- + KEdgeConnectedComponentsWang
Wang's algorithm for computing the k-edge connected components of a graph.
- + KShortestPathsST
An algorithm for computing the K shortest paths between two vertices in a graph.
- + KShortestPathsST.Builder
A builder for KShortestPathsST objects.
- + KVertexConnectedComponentsAlgo
Finds the k-vertex connected components of a graph.
- + KVertexConnectedComponentsAlgoAbstract
Abstract class for k-vertex connected components algorithms.
- + KVertexConnectedComponentsWhiteMoody
White-Moody algorithm for finding k-vertex-connected components in an undirected graph.
- + LedaGraphReader
Read a graph in 'LEDA' format.
- + LedaGraphWriter
Write a graph in 'LEDA' format.
- + LineGraphGenerator<V,​E>
Generates the line graph given an existing graph.
- + LowestCommonAncestorDynamic
Dynamic algorithm for Lowest Common Ancestor (LCA) queries.
- + LowestCommonAncestorDynamic.Builder
A builder for LowestCommonAncestorDynamic objects.
- + LowestCommonAncestorDynamic.Vertex
A tree vertex in an LowestCommonAncestorDynamic data structure.
- + LowestCommonAncestorExample
This example demonstrates how to use the lowest common ancestor algorithm.
- + LowestCommonAncestorOffline
An algorithm for computing the lowest common ancestor (LCA) of two vertices in a tree, offline.
- + LowestCommonAncestorOffline.IQueries
Queries container for LowestCommonAncestorOffline computations for IntGraph.
- + LowestCommonAncestorOffline.IResult
Result of a LowestCommonAncestorOffline computation for IntGraph.
- + LowestCommonAncestorOffline.Queries<V,​E>
Queries container for LowestCommonAncestorOffline computations.
- + LowestCommonAncestorOffline.Result<V,​E>
Result of a LowestCommonAncestorOffline computation.
- + LowestCommonAncestorStatic
Static Lowest Common Ancestor (LCA) algorithm.
- + LowestCommonAncestorStatic.DataStructure<V,​E>
Data structure result created from a static LCA pre-processing.
- + LowestCommonAncestorStatic.IDataStructure
Data structure result created from a static LCA pre-processing for IntGraph.
- + Matching<V,​E>
A matching in a graph.
- + MatchingAlgo
Maximum/minimum matching algorithm.
- + MatchingAlgo.Builder
A builder for MatchingAlgo objects.
- + MaximalCliquesEnumerator
Algorithm for enumerating over all maximal cliques in a graph.
- + MaximalCliquesEnumerator.Builder
A builder for MaximalCliquesEnumerator objects.
- + MaximalCliquesEnumeratorAbstract
Abstract class for enumerating over all maximal cliques in a graph.
- + MaximalCliquesEnumeratorBronKerbosch
The Bron-Kerbosch algorithm for Maximal cliques.
- + MaximalCliquesEnumeratorBronKerboschPivot
The Bron-Kerbosch algorithm for Maximal cliques with the pivot heuristic.
- + MaximalIndependentSetsEnumerator
Algorithm for enumerating over all maximal independent sets in a graph.
- + MaximalIndependentSetsEnumeratorAbstract
Abstract class for enumerating over all maximal independent sets in a graph.
- + MaximalIndependentSetsEnumeratorComplementCliques
Compute the maximal independent sets of a graph by computing the maximal cliques of the complement graph.
- + MaximumFlow
Calculate the maximum flow in a flow network.
- + MaximumFlow.Builder
A builder for MaximumFlow objects.
- + MaximumMatchingExample
This example demonstrates how to use the maximum matching algorithm.
- + MinimumCostFlow
Compute the minimum-cost (max) flow in a flow network.
- + MinimumCostFlow.Builder
A builder for MinimumCostFlow objects.
- + MinimumDirectedSpanningTree
Minimum spanning tree algorithm for directed graphs.
- + MinimumEdgeCutAllST
Minimum Edge-Cut algorithm that finds all minimum edge-cuts in a graph between two terminal vertices (source-sink, S-T).
- + MinimumEdgeCutAllSTAbstract
Abstract class for computing all minimum edge cuts between two terminal nodes.
- + MinimumEdgeCutAllSTPicardQueyranne
Picard-Queyranne algorithm for enumerating all the minimum edge cuts between two terminal nodes.
- + MinimumEdgeCutGlobal
Global Minimum Edge-Cut algorithm without terminal vertices.
- + MinimumEdgeCutGlobalAbstract
Abstract class for computing the global minimum edge cut in a graph.
- + MinimumEdgeCutGlobalStoerWagner
Stoer-Wagner Algorithm for global minimum cut.
- + MinimumEdgeCutST
Minimum Edge-Cut algorithm with terminal vertices (source-sink, S-T).
- + MinimumEdgeCutSTAbstract
Abstract class for computing the minimum edge cut between two vertices in a graph.
- + MinimumMeanCycle
Algorithm that find the cycle with the minimum mean weight.
- + MinimumMeanCycle.Builder
A builder for MinimumMeanCycle objects.
- + +MinimumMeanCycleAbstract + +
Abstract class for computing the cycle with minimum mean weight in a graph.
+ + + +MinimumMeanCycleDasdanGupta + +
Dasdan and Gupta algorithm for minimum mean cycle.
+ + + +MinimumMeanCycleHoward + +
Howard's algorithm for minimum mean cycle detection.
+ + + MinimumSpanningTree
Minimum spanning tree algorithm.
- + MinimumSpanningTree.Builder
A builder for MinimumSpanningTree objects.
- + MinimumSpanningTree.IResult
A result object for MinimumSpanningTree computation for IntGraph.
- + MinimumSpanningTree.Result<V,​E>
A result object for MinimumSpanningTree computation.
- + MinimumSpanningTreeExample
This example demonstrates how to use the minimum spanning tree algorithm.
- + MinimumVertexCutAllGlobal
Minimum Vertex-Cut algorithm that finds all minimum vertex-cuts in a graph (global vertex-cut).
- + MinimumVertexCutAllGlobalAbstract
Abstract class for computing all global minimum vertex cuts in a graph.
- + MinimumVertexCutAllGlobalKanevsky
Kanevsky algorithm for computing all minimum unweighted vertex cuts in a graph.
- + MinimumVertexCutAllST
Minimum Vertex-Cut algorithm that finds all minimum vertex-cuts in a graph between two terminal vertices (source-sink, S-T).
- + MinimumVertexCutAllSTAbstract
Abstract class for computing all minimum vertex cuts between two vertices in a graph.
- + MinimumVertexCutAllSTEdgeCut
All Minimum Vertex-Cuts algorithm with terminal vertices (source-sink, S-T) using All Minimum Edge-Cuts algorithm.
- + MinimumVertexCutGlobal
Minimum Vertex-Cut algorithm without terminal vertices.
- + MinimumVertexCutGlobalAbstract
Abstract class for computing the global minimum vertex cut in a graph.
- + MinimumVertexCutGlobalEsfahanianHakimi
Esfahanian-Hakimi algorithm for computing a minimum unweighted vertex cut in a graph.
- + MinimumVertexCutST
Minimum Vertex-Cut algorithm with terminal vertices (source-sink, S-T).
- + MinimumVertexCutSTAbstract
Abstract class for computing the minimum vertex cut between two vertices in a graph.
- + MinimumVertexCutSTEdgeCut
Minimum Vertex-Cut algorithm with terminal vertices (source-sink, S-T) using Minimum Edge-Cut algorithm.
- + NegativeCycleException
Exception thrown when a negative cycle is detected in a graph during a shortest path computation.
- + NoSuchEdgeException
Exception thrown when an edge is not found in a graph.
- + NoSuchVertexException
Exception thrown when a vertex is not found in a graph.
- + Path<V,​E>
A path of edges in a graph.
- + RandomizedAlgorithm
Randomized algorithm interface.
- + RandomWalkIter<V,​E>
Random walk iterator.
- + RandomWalkIter.Int
A random walk iterator for IntGraph.
- + RecursiveMatrixGraphGenerator<V,​E>
Generates a random graph using the R-MAT model.
- + ShortestPathAllPairs
An algorithm that compute all pairs shortest path (APSP) in a graph.
- + ShortestPathAllPairs.Builder
A builder for ShortestPathAllPairs objects.
- + ShortestPathAllPairs.IResult
A result object for an ShortestPathAllPairs algorithm for IntGraph.
- + ShortestPathAllPairs.Result<V,​E>
A result object for an ShortestPathAllPairs algorithm.
- + ShortestPathExample
This example demonstrates how to use the single-source shortest path algorithm.
- + ShortestPathHeuristicST
Shortest path algorithm that uses a distance heuristic function.
- + ShortestPathHeuristicST.Builder
A builder for ShortestPathHeuristicST objects.
- + ShortestPathSingleSource
Single Source Shortest Path algorithm.
- + ShortestPathSingleSource.Builder
A builder for ShortestPathSingleSource objects.
- + ShortestPathSingleSource.IResult
A result object for the ShortestPathSingleSource problem for IntGraph.
- + ShortestPathSingleSource.Result<V,​E>
A result object for the ShortestPathSingleSource problem.
- + ShortestPathST
An algorithm for computing the shortest path between two vertices in a graph.
- + ShortestPathST.Builder
A builder for ShortestPathST objects.
- + SimplePathsEnumerator
An algorithm that enumerate over simple paths between a source and a target.
- + Sparse6GraphReader
Read a graph in 'sparse6' format.
- + Sparse6GraphWriter
Write a graph in 'sparse6' format.
- + SteinerTreeAlgo
An algorithm for the Steiner tree problem.
- + SteinerTreeAlgo.IResult
A result object for SteinerTreeAlgo computation for IntGraph.
- + SteinerTreeAlgo.Result<V,​E>
A result object for SteinerTreeAlgo computation.
- + StronglyConnectedComponentsAlgo
Strongly Connected components algorithm.
- + StronglyConnectedComponentsAlgo.Builder
A builder for StronglyConnectedComponentsAlgo objects.
- + StronglyConnectedComponentsAlgoAbstract
Abstract class for computing strongly connected components in a graph.
- + StronglyConnectedComponentsPathBasedDfs
Path based DFS implementation of Dijkstra's strongly connected components algorithm.
- + StronglyConnectedComponentsTarjan
Tarjan's strongly connected components algorithm.
- + SymmetricDifferenceGraphGenerator<V,​E>
Generate a graph that contains the edges that exist in one of two input graphs but not in both.
- + TopologicalOrderAlgo
Algorithm that calculate a topological order of graph vertices.
- + TopologicalOrderAlgo.IResult
A result object of a TopologicalOrderAlgo algorithm for IntGraph.
- + TopologicalOrderAlgo.Result<V,​E>
A result object of a TopologicalOrderAlgo algorithm.
- + +TopologicalOrderAlgoAbstract + +
Abstract class for computing a topological order in a DAG graph.
+ + + +TopologicalOrderAlgoImpl + +
A simple algorithm that compute a topological order in a DAG graph.
+ + + TreePathMaxima
Tree Path Maxima (TPM) algorithm.
- + TreePathMaxima.Builder
A builder for TreePathMaxima objects.
- + TreePathMaxima.IQueries
Queries container for TreePathMaxima computations for IntGraph.
- + TreePathMaxima.IResult
A result object for TreePathMaxima algorithm for IntGraph.
- + TreePathMaxima.Queries<V,​E>
Queries container for TreePathMaxima computations.
- + TreePathMaxima.Result<V,​E>
A result object for TreePathMaxima algorithm.
- + Trees
Static methods class for tree graphs.
- + TspMetric
Metric Traveling Salesman Problem (TSP) algorithm.
- + TspMetricMatchingAppx
TSP \(3/2\)-approximation using maximum matching.
- + TspMetricMSTAppx
TSP \(2\)-approximation using MST.
- + UniformTreeGenerator<V,​E>
Generate a uniform random tree.
- + UnionGraphGenerator<V,​E>
Generate the union graph of two or more given graphs.
- + VertexBiPartition<V,​E>
A partition of the vertices of a graph into two blocks.
- + VertexCover
Minimum weighted vertex cover algorithm.
- + +VertexCoverAbstract + +
Abstract class for computing a minimum vertex cover.
+ + + +VertexCoverBarYehuda + +
Bar Yehuda's vertex cover algorithm.
+ + + VertexPartition<V,​E>
A partition of the vertices of a graph.
- + VoronoiAlgo
Voronoi cells algorithm.
- + VoronoiAlgo.IResult
A result object of VoronoiAlgo computation for IntGraph.
- + VoronoiAlgo.Result<V,​E>
A result object of VoronoiAlgo computation.
- + WeaklyConnectedComponentsAlgo
Weakly Connected components algorithm.
- + WeaklyConnectedComponentsAlgoAbstract
Abstract class for computing weakly connected components in a graph.
- + WeaklyConnectedComponentsAlgoImpl
Simple implementation of the weakly connected components algorithm.
- + WeightFunction<K>
Weight function that maps graph edges or vertices to weights.
- + WeightFunctionInt<K>
Weight function that maps graph edges or vertices to integer weights.
- + WeightFunctions
Static methods class for weight functions.
- + Weights<K,​T>
Weights of graph vertices or edges.
- + WeightsBool<K>
Specific weights of boolean.
- + WeightsByte<K>
Specific weights of byte.
- + WeightsChar<K>
Specific weights of char.
- + WeightsDouble<K>
Specific weights of double.
- + WeightsFloat<K>
Specific weights of float.
- + WeightsInt<K>
Specific weights of int.
- + WeightsLong<K>
Specific weights of long.
- + WeightsObj<K,​T>
Specific weights of Object.
- + WeightsShort<K>
Specific weights of short.
diff --git a/0.4.1-snapshot/allclasses.html b/0.4.1-snapshot/allclasses.html index c1726ef777..1a6b338ba3 100644 --- a/0.4.1-snapshot/allclasses.html +++ b/0.4.1-snapshot/allclasses.html @@ -2,10 +2,10 @@ - + All Classes (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -36,6 +36,8 @@

All Classes

  • BiConnectedComponentsAlgoHopcroftTarjan
  • BipartiteGraphs
  • ChinesePostman
  • +
  • ChinesePostmanAbstract
  • +
  • ChinesePostmanImpl
  • ClosuresEnumerator
  • ClosuresEnumeratorAbstract
  • ClosuresEnumeratorSchrageBaker
  • @@ -52,8 +54,13 @@

    All Classes

  • CoresAlgo
  • CoresAlgo.IResult
  • CoresAlgo.Result
  • +
  • CoresAlgoAbstract
  • +
  • CoresAlgoImpl
  • CyclesEnumerator
  • CyclesEnumerator.Builder
  • +
  • CyclesEnumeratorAbstract
  • +
  • CyclesEnumeratorJohnson
  • +
  • CyclesEnumeratorTarjan
  • DfsIter
  • DfsIter.Int
  • DifferenceGraphGenerator
  • @@ -63,8 +70,13 @@

    All Classes

  • DimacsGraphWriter
  • DistanceMeasures
  • DominatingSetAlgo
  • +
  • DominatingSetAlgoAbstract
  • +
  • DominatingSetAlgoGreedy
  • EdgeCover
  • EdgeCover.Builder
  • +
  • EdgeCoverAbstract
  • +
  • EdgeCoverCardinality
  • +
  • EdgeCoverWeighted
  • EdgeDirection
  • EdgeIter
  • EdgeIterationExample
  • @@ -191,6 +203,9 @@

    All Classes

  • MinimumEdgeCutSTAbstract
  • MinimumMeanCycle
  • MinimumMeanCycle.Builder
  • +
  • MinimumMeanCycleAbstract
  • +
  • MinimumMeanCycleDasdanGupta
  • +
  • MinimumMeanCycleHoward
  • MinimumSpanningTree
  • MinimumSpanningTree.Builder
  • MinimumSpanningTree.IResult
  • @@ -244,6 +259,8 @@

    All Classes

  • TopologicalOrderAlgo
  • TopologicalOrderAlgo.IResult
  • TopologicalOrderAlgo.Result
  • +
  • TopologicalOrderAlgoAbstract
  • +
  • TopologicalOrderAlgoImpl
  • TreePathMaxima
  • TreePathMaxima.Builder
  • TreePathMaxima.IQueries
  • @@ -258,6 +275,8 @@

    All Classes

  • UnionGraphGenerator
  • VertexBiPartition
  • VertexCover
  • +
  • VertexCoverAbstract
  • +
  • VertexCoverBarYehuda
  • VertexPartition
  • VoronoiAlgo
  • VoronoiAlgo.IResult
  • diff --git a/0.4.1-snapshot/allpackages-index.html b/0.4.1-snapshot/allpackages-index.html index 3b33f23c9c..94fbe3398a 100644 --- a/0.4.1-snapshot/allpackages-index.html +++ b/0.4.1-snapshot/allpackages-index.html @@ -2,10 +2,10 @@ - + All Packages (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/JGAlgoConfig.html b/0.4.1-snapshot/com/jgalgo/JGAlgoConfig.html index 6b79dc02c9..4741cabf8b 100644 --- a/0.4.1-snapshot/com/jgalgo/JGAlgoConfig.html +++ b/0.4.1-snapshot/com/jgalgo/JGAlgoConfig.html @@ -2,10 +2,10 @@ - + JGAlgoConfig (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaGraphAdapter.html b/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaGraphAdapter.html index d95cab43c7..56ea794c6d 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaGraphAdapter.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaGraphAdapter.html @@ -2,10 +2,10 @@ - + GuavaGraphAdapter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaMutableGraphAdapter.html b/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaMutableGraphAdapter.html index 31ebf0689d..7fa29067a3 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaMutableGraphAdapter.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaMutableGraphAdapter.html @@ -2,10 +2,10 @@ - + GuavaMutableGraphAdapter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaMutableNetworkAdapter.html b/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaMutableNetworkAdapter.html index f467cd749a..d0aca751c4 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaMutableNetworkAdapter.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaMutableNetworkAdapter.html @@ -2,10 +2,10 @@ - + GuavaMutableNetworkAdapter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaMutableValueGraphAdapter.html b/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaMutableValueGraphAdapter.html index 2161dc62f5..4b9b7a864c 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaMutableValueGraphAdapter.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaMutableValueGraphAdapter.html @@ -2,10 +2,10 @@ - + GuavaMutableValueGraphAdapter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaNetworkAdapter.html b/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaNetworkAdapter.html index bae535e819..87e6af56ac 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaNetworkAdapter.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaNetworkAdapter.html @@ -2,10 +2,10 @@ - + GuavaNetworkAdapter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaNetworkWrapper.html b/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaNetworkWrapper.html index 389bcdc608..5c34a32041 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaNetworkWrapper.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaNetworkWrapper.html @@ -2,10 +2,10 @@ - + GuavaNetworkWrapper (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaValueGraphAdapter.html b/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaValueGraphAdapter.html index 9749ae6655..4c85705eb4 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaValueGraphAdapter.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/guava/GuavaValueGraphAdapter.html @@ -2,10 +2,10 @@ - + GuavaValueGraphAdapter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaGraphAdapter.html b/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaGraphAdapter.html index 69be2dc02b..ef32546892 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaGraphAdapter.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaGraphAdapter.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.adapt.guava.GuavaGraphAdapter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaMutableGraphAdapter.html b/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaMutableGraphAdapter.html index f11e296a01..09cacdcb07 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaMutableGraphAdapter.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaMutableGraphAdapter.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.adapt.guava.GuavaMutableGraphAdapter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaMutableNetworkAdapter.html b/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaMutableNetworkAdapter.html index 0209cb65e9..86ad3def32 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaMutableNetworkAdapter.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaMutableNetworkAdapter.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.adapt.guava.GuavaMutableNetworkAdapter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaMutableValueGraphAdapter.html b/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaMutableValueGraphAdapter.html index ed9e9dacef..8b3efab974 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaMutableValueGraphAdapter.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaMutableValueGraphAdapter.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.adapt.guava.GuavaMutableValueGraphAdapter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaNetworkAdapter.html b/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaNetworkAdapter.html index 0d5e8c766b..13f3a6d4f3 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaNetworkAdapter.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaNetworkAdapter.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.adapt.guava.GuavaNetworkAdapter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaNetworkWrapper.html b/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaNetworkWrapper.html index 7b781549aa..aee2d0f3e6 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaNetworkWrapper.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaNetworkWrapper.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.adapt.guava.GuavaNetworkWrapper (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaValueGraphAdapter.html b/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaValueGraphAdapter.html index a50c6c69a9..f7446b8197 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaValueGraphAdapter.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/guava/class-use/GuavaValueGraphAdapter.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.adapt.guava.GuavaValueGraphAdapter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/guava/package-summary.html b/0.4.1-snapshot/com/jgalgo/adapt/guava/package-summary.html index 35e6a35248..adc3167b6b 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/guava/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/guava/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.adapt.guava (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/guava/package-tree.html b/0.4.1-snapshot/com/jgalgo/adapt/guava/package-tree.html index 3b86e799c3..2918baf7d7 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/guava/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/guava/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.adapt.guava Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/guava/package-use.html b/0.4.1-snapshot/com/jgalgo/adapt/guava/package-use.html index 9969b0cd65..c035f26e7d 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/guava/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/guava/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.adapt.guava (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/JGraphTAdapter.html b/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/JGraphTAdapter.html index b1c353f945..09ff8dcdbc 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/JGraphTAdapter.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/JGraphTAdapter.html @@ -2,10 +2,10 @@ - + JGraphTAdapter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/JGraphTWrapper.html b/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/JGraphTWrapper.html index b5b830d595..1947555aab 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/JGraphTWrapper.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/JGraphTWrapper.html @@ -2,10 +2,10 @@ - + JGraphTWrapper (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/class-use/JGraphTAdapter.html b/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/class-use/JGraphTAdapter.html index 4bf35d565e..9ade3460ac 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/class-use/JGraphTAdapter.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/class-use/JGraphTAdapter.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.adapt.jgrapht.JGraphTAdapter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/class-use/JGraphTWrapper.html b/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/class-use/JGraphTWrapper.html index c0bba6e413..550a1278b4 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/class-use/JGraphTWrapper.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/class-use/JGraphTWrapper.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.adapt.jgrapht.JGraphTWrapper (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/package-summary.html b/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/package-summary.html index 7a74678e8f..a5aa511772 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.adapt.jgrapht (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/package-tree.html b/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/package-tree.html index d1baf3a190..36eba24f58 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.adapt.jgrapht Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/package-use.html b/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/package-use.html index 3acc669d86..146b1ab36f 100644 --- a/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/adapt/jgrapht/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.adapt.jgrapht (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/AlgorithmBuilderBase.html b/0.4.1-snapshot/com/jgalgo/alg/AlgorithmBuilderBase.html index 746bb33459..1e7d9663ea 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/AlgorithmBuilderBase.html +++ b/0.4.1-snapshot/com/jgalgo/alg/AlgorithmBuilderBase.html @@ -2,10 +2,10 @@ - + AlgorithmBuilderBase (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/EdgeDirection.html b/0.4.1-snapshot/com/jgalgo/alg/EdgeDirection.html index c3638e4598..e905dd2b07 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/EdgeDirection.html +++ b/0.4.1-snapshot/com/jgalgo/alg/EdgeDirection.html @@ -2,10 +2,10 @@ - + EdgeDirection (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/IVertexBiPartition.html b/0.4.1-snapshot/com/jgalgo/alg/IVertexBiPartition.html index 4480eeaddd..e210ffe916 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/IVertexBiPartition.html +++ b/0.4.1-snapshot/com/jgalgo/alg/IVertexBiPartition.html @@ -2,10 +2,10 @@ - + IVertexBiPartition (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/IVertexPartition.html b/0.4.1-snapshot/com/jgalgo/alg/IVertexPartition.html index be372d96c3..eaec390cc2 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/IVertexPartition.html +++ b/0.4.1-snapshot/com/jgalgo/alg/IVertexPartition.html @@ -2,10 +2,10 @@ - + IVertexPartition (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/RandomizedAlgorithm.html b/0.4.1-snapshot/com/jgalgo/alg/RandomizedAlgorithm.html index 92df538c24..22e3c8c9b4 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/RandomizedAlgorithm.html +++ b/0.4.1-snapshot/com/jgalgo/alg/RandomizedAlgorithm.html @@ -2,10 +2,10 @@ - + RandomizedAlgorithm (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -131,7 +131,7 @@

    Interface RandomizedAlgo
    All Known Implementing Classes:
    -
    ColoringGreedy, KEdgeConnectedComponentsWang
    +
    ColoringGreedy, DominatingSetAlgoGreedy, KEdgeConnectedComponentsWang

    public interface RandomizedAlgorithm
    diff --git a/0.4.1-snapshot/com/jgalgo/alg/VertexBiPartition.html b/0.4.1-snapshot/com/jgalgo/alg/VertexBiPartition.html index 8f3a9dab58..bf09ff773e 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/VertexBiPartition.html +++ b/0.4.1-snapshot/com/jgalgo/alg/VertexBiPartition.html @@ -2,10 +2,10 @@ - + VertexBiPartition (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/VertexPartition.html b/0.4.1-snapshot/com/jgalgo/alg/VertexPartition.html index 52b3502d77..49282d950f 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/VertexPartition.html +++ b/0.4.1-snapshot/com/jgalgo/alg/VertexPartition.html @@ -2,10 +2,10 @@ - + VertexPartition (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/bipartite/BipartiteGraphs.html b/0.4.1-snapshot/com/jgalgo/alg/bipartite/BipartiteGraphs.html index 1b9f41fb24..30f320ccb6 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/bipartite/BipartiteGraphs.html +++ b/0.4.1-snapshot/com/jgalgo/alg/bipartite/BipartiteGraphs.html @@ -2,10 +2,10 @@ - + BipartiteGraphs (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/bipartite/class-use/BipartiteGraphs.html b/0.4.1-snapshot/com/jgalgo/alg/bipartite/class-use/BipartiteGraphs.html index 94ccb29c1d..371541f6d3 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/bipartite/class-use/BipartiteGraphs.html +++ b/0.4.1-snapshot/com/jgalgo/alg/bipartite/class-use/BipartiteGraphs.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.bipartite.BipartiteGraphs (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/bipartite/package-summary.html b/0.4.1-snapshot/com/jgalgo/alg/bipartite/package-summary.html index c7d14206ce..66708b8dcb 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/bipartite/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/alg/bipartite/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.bipartite (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/bipartite/package-tree.html b/0.4.1-snapshot/com/jgalgo/alg/bipartite/package-tree.html index 5b652f38ec..fc5447b9c5 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/bipartite/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/bipartite/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.bipartite Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/bipartite/package-use.html b/0.4.1-snapshot/com/jgalgo/alg/bipartite/package-use.html index c36c44af62..62c415909c 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/bipartite/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/alg/bipartite/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.alg.bipartite (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/class-use/AlgorithmBuilderBase.html b/0.4.1-snapshot/com/jgalgo/alg/class-use/AlgorithmBuilderBase.html index 833d2d9834..29a89bb233 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/class-use/AlgorithmBuilderBase.html +++ b/0.4.1-snapshot/com/jgalgo/alg/class-use/AlgorithmBuilderBase.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.AlgorithmBuilderBase (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/class-use/EdgeDirection.html b/0.4.1-snapshot/com/jgalgo/alg/class-use/EdgeDirection.html index e72c6ee88a..40c554c6cc 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/class-use/EdgeDirection.html +++ b/0.4.1-snapshot/com/jgalgo/alg/class-use/EdgeDirection.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.EdgeDirection (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -184,6 +184,12 @@

    Uses of EdgeD
    Compute the cores of the graph with respect the given degree type.
    + +<V,​E>
    CoresAlgo.Result<V,​E> +CoresAlgoAbstract.computeCores​(Graph<V,​E> g, + EdgeDirection degreeType) +  + @@ -211,6 +217,13 @@

    Uses of EdgeD +<V,​E>
    Set<V> +DominatingSetAlgoAbstract.computeMinimumDominationSet​(Graph<V,​E> g, + WeightFunction<V> w, + EdgeDirection dominanceDirection) +  + + static <V,​E>
    boolean
    DominatingSetAlgo.isDominatingSet​(Graph<V,​E> g, Collection<V> dominatingSet, diff --git a/0.4.1-snapshot/com/jgalgo/alg/class-use/IVertexBiPartition.html b/0.4.1-snapshot/com/jgalgo/alg/class-use/IVertexBiPartition.html index ac6f70a80b..c2f26e327c 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/class-use/IVertexBiPartition.html +++ b/0.4.1-snapshot/com/jgalgo/alg/class-use/IVertexBiPartition.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.IVertexBiPartition (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/class-use/IVertexPartition.html b/0.4.1-snapshot/com/jgalgo/alg/class-use/IVertexPartition.html index e488ef45a1..79ff774e22 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/class-use/IVertexPartition.html +++ b/0.4.1-snapshot/com/jgalgo/alg/class-use/IVertexPartition.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.IVertexPartition (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -115,13 +115,6 @@

    Uses -com.jgalgo.alg.connect - -
    Algorithms for solving connectivity problems, such as strongly/weakly connected components, minimum edge/vertex cuts, - ect.
    - - - com.jgalgo.alg.path
    Algorithms for finding paths in graphs, such as shortest paths, iterating over all simple paths between two vertices, @@ -211,28 +204,6 @@

    Uses of -
    - - -

    Uses of IVertexPartition in com.jgalgo.alg.connect

    - - - - - - - - - - - - - - -
    Methods in com.jgalgo.alg.connect that return IVertexPartition 
    Modifier and TypeMethodDescription
    IVertexPartitionWeaklyConnectedComponentsAlgoImpl.findWeaklyConnectedComponents​(IndexGraph g) 
    -
    - -
  • diff --git a/0.4.1-snapshot/com/jgalgo/alg/class-use/RandomizedAlgorithm.html b/0.4.1-snapshot/com/jgalgo/alg/class-use/RandomizedAlgorithm.html index 86b8316113..a6a1d7d92b 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/class-use/RandomizedAlgorithm.html +++ b/0.4.1-snapshot/com/jgalgo/alg/class-use/RandomizedAlgorithm.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.RandomizedAlgorithm (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -122,6 +122,12 @@

    U +com.jgalgo.alg.cover + +
    Algorithms for solving set cover problems, such as minimum vertex/edge cover, dominating set, etc.
    + + + com.jgalgo.alg.traversal
    Algorithms for traversing graphs, such as depth-first search and breadth-first search.
    @@ -181,6 +187,30 @@

    Uses of +
    + + +

    Uses of RandomizedAlgorithm in com.jgalgo.alg.cover

    + + + + + + + + + + + + + + +
    Classes in com.jgalgo.alg.cover that implement RandomizedAlgorithm 
    Modifier and TypeClassDescription
    class DominatingSetAlgoGreedy +
    A greedy algorithm for computing a minimum dominating set.
    +
    +
    +

  • +
  • diff --git a/0.4.1-snapshot/com/jgalgo/alg/class-use/VertexBiPartition.html b/0.4.1-snapshot/com/jgalgo/alg/class-use/VertexBiPartition.html index 44c2a60f1f..c88b6a66b4 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/class-use/VertexBiPartition.html +++ b/0.4.1-snapshot/com/jgalgo/alg/class-use/VertexBiPartition.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.VertexBiPartition (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/class-use/VertexPartition.html b/0.4.1-snapshot/com/jgalgo/alg/class-use/VertexPartition.html index 47aa8da549..0808460698 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/class-use/VertexPartition.html +++ b/0.4.1-snapshot/com/jgalgo/alg/class-use/VertexPartition.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.VertexPartition (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalCliquesEnumerator.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalCliquesEnumerator.Builder.html index 6932f85f2b..e93945b88b 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalCliquesEnumerator.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalCliquesEnumerator.Builder.html @@ -2,10 +2,10 @@ - + MaximalCliquesEnumerator.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalCliquesEnumerator.html b/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalCliquesEnumerator.html index 646f53b0c7..f185989c13 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalCliquesEnumerator.html +++ b/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalCliquesEnumerator.html @@ -2,10 +2,10 @@ - + MaximalCliquesEnumerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalCliquesEnumeratorAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalCliquesEnumeratorAbstract.html index bb8e6ab25c..2826d182f1 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalCliquesEnumeratorAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalCliquesEnumeratorAbstract.html @@ -2,10 +2,10 @@ - + MaximalCliquesEnumeratorAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalCliquesEnumeratorBronKerbosch.html b/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalCliquesEnumeratorBronKerbosch.html index 1fe9a1fc5b..3cb4912709 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalCliquesEnumeratorBronKerbosch.html +++ b/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalCliquesEnumeratorBronKerbosch.html @@ -2,10 +2,10 @@ - + MaximalCliquesEnumeratorBronKerbosch (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalCliquesEnumeratorBronKerboschPivot.html b/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalCliquesEnumeratorBronKerboschPivot.html index 3c08f11991..04bc11f869 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalCliquesEnumeratorBronKerboschPivot.html +++ b/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalCliquesEnumeratorBronKerboschPivot.html @@ -2,10 +2,10 @@ - + MaximalCliquesEnumeratorBronKerboschPivot (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalIndependentSetsEnumerator.html b/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalIndependentSetsEnumerator.html index 13e6920944..abb845c3dd 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalIndependentSetsEnumerator.html +++ b/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalIndependentSetsEnumerator.html @@ -2,10 +2,10 @@ - + MaximalIndependentSetsEnumerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalIndependentSetsEnumeratorAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalIndependentSetsEnumeratorAbstract.html index 2b175bce63..ac6555350b 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalIndependentSetsEnumeratorAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalIndependentSetsEnumeratorAbstract.html @@ -2,10 +2,10 @@ - + MaximalIndependentSetsEnumeratorAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalIndependentSetsEnumeratorComplementCliques.html b/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalIndependentSetsEnumeratorComplementCliques.html index da774010fb..ab98368cbb 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalIndependentSetsEnumeratorComplementCliques.html +++ b/0.4.1-snapshot/com/jgalgo/alg/clique/MaximalIndependentSetsEnumeratorComplementCliques.html @@ -2,10 +2,10 @@ - + MaximalIndependentSetsEnumeratorComplementCliques (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalCliquesEnumerator.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalCliquesEnumerator.Builder.html index 0b72ac08d4..e67e7b74ae 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalCliquesEnumerator.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalCliquesEnumerator.Builder.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.clique.MaximalCliquesEnumerator.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalCliquesEnumerator.html b/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalCliquesEnumerator.html index b73cbf45ba..f776cadb29 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalCliquesEnumerator.html +++ b/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalCliquesEnumerator.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.clique.MaximalCliquesEnumerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalCliquesEnumeratorAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalCliquesEnumeratorAbstract.html index 62ea398ad2..7bd670d6e7 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalCliquesEnumeratorAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalCliquesEnumeratorAbstract.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.clique.MaximalCliquesEnumeratorAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalCliquesEnumeratorBronKerbosch.html b/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalCliquesEnumeratorBronKerbosch.html index a0db8b1dab..17e4030d9f 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalCliquesEnumeratorBronKerbosch.html +++ b/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalCliquesEnumeratorBronKerbosch.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.clique.MaximalCliquesEnumeratorBronKerbosch (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalCliquesEnumeratorBronKerboschPivot.html b/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalCliquesEnumeratorBronKerboschPivot.html index 0c4c4a46c0..85d674a5b7 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalCliquesEnumeratorBronKerboschPivot.html +++ b/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalCliquesEnumeratorBronKerboschPivot.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.clique.MaximalCliquesEnumeratorBronKerboschPivot (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalIndependentSetsEnumerator.html b/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalIndependentSetsEnumerator.html index 9a0fa56926..1002d4b831 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalIndependentSetsEnumerator.html +++ b/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalIndependentSetsEnumerator.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.clique.MaximalIndependentSetsEnumerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalIndependentSetsEnumeratorAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalIndependentSetsEnumeratorAbstract.html index 689dc25a9a..9690376d32 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalIndependentSetsEnumeratorAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalIndependentSetsEnumeratorAbstract.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.clique.MaximalIndependentSetsEnumeratorAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalIndependentSetsEnumeratorComplementCliques.html b/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalIndependentSetsEnumeratorComplementCliques.html index 1fb712e902..9b65df3f4c 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalIndependentSetsEnumeratorComplementCliques.html +++ b/0.4.1-snapshot/com/jgalgo/alg/clique/class-use/MaximalIndependentSetsEnumeratorComplementCliques.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.clique.MaximalIndependentSetsEnumeratorComplementCliques (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/clique/package-summary.html b/0.4.1-snapshot/com/jgalgo/alg/clique/package-summary.html index c4a812c552..1274dae6ca 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/clique/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/alg/clique/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.clique (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/clique/package-tree.html b/0.4.1-snapshot/com/jgalgo/alg/clique/package-tree.html index f003de977f..c5b988bea6 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/clique/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/clique/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.clique Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/clique/package-use.html b/0.4.1-snapshot/com/jgalgo/alg/clique/package-use.html index 40491f2bae..d644f78ec0 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/clique/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/alg/clique/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.alg.clique (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/closure/ClosuresEnumerator.html b/0.4.1-snapshot/com/jgalgo/alg/closure/ClosuresEnumerator.html index 12608e83dc..24bab05273 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/closure/ClosuresEnumerator.html +++ b/0.4.1-snapshot/com/jgalgo/alg/closure/ClosuresEnumerator.html @@ -2,10 +2,10 @@ - + ClosuresEnumerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/closure/ClosuresEnumeratorAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/closure/ClosuresEnumeratorAbstract.html index 6c39a8d802..553e142441 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/closure/ClosuresEnumeratorAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/closure/ClosuresEnumeratorAbstract.html @@ -2,10 +2,10 @@ - + ClosuresEnumeratorAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/closure/ClosuresEnumeratorSchrageBaker.html b/0.4.1-snapshot/com/jgalgo/alg/closure/ClosuresEnumeratorSchrageBaker.html index b19ca6e492..37761efe61 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/closure/ClosuresEnumeratorSchrageBaker.html +++ b/0.4.1-snapshot/com/jgalgo/alg/closure/ClosuresEnumeratorSchrageBaker.html @@ -2,10 +2,10 @@ - + ClosuresEnumeratorSchrageBaker (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/closure/class-use/ClosuresEnumerator.html b/0.4.1-snapshot/com/jgalgo/alg/closure/class-use/ClosuresEnumerator.html index 3ca7c1bd0e..f616ca5dcf 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/closure/class-use/ClosuresEnumerator.html +++ b/0.4.1-snapshot/com/jgalgo/alg/closure/class-use/ClosuresEnumerator.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.closure.ClosuresEnumerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/closure/class-use/ClosuresEnumeratorAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/closure/class-use/ClosuresEnumeratorAbstract.html index fedded8f2b..d856b4886b 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/closure/class-use/ClosuresEnumeratorAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/closure/class-use/ClosuresEnumeratorAbstract.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.closure.ClosuresEnumeratorAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/closure/class-use/ClosuresEnumeratorSchrageBaker.html b/0.4.1-snapshot/com/jgalgo/alg/closure/class-use/ClosuresEnumeratorSchrageBaker.html index d77a21cd7d..d1f55a5551 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/closure/class-use/ClosuresEnumeratorSchrageBaker.html +++ b/0.4.1-snapshot/com/jgalgo/alg/closure/class-use/ClosuresEnumeratorSchrageBaker.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.closure.ClosuresEnumeratorSchrageBaker (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/closure/package-summary.html b/0.4.1-snapshot/com/jgalgo/alg/closure/package-summary.html index 266ba1fecb..0bd30cb14d 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/closure/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/alg/closure/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.closure (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/closure/package-tree.html b/0.4.1-snapshot/com/jgalgo/alg/closure/package-tree.html index 7b1c21cbd9..7089c39ef9 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/closure/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/closure/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.closure Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/closure/package-use.html b/0.4.1-snapshot/com/jgalgo/alg/closure/package-use.html index b50dd93b3a..7409afc55a 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/closure/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/alg/closure/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.alg.closure (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/color/ColoringAlgo.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/color/ColoringAlgo.Builder.html index 8184c371cd..2b217643ce 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/color/ColoringAlgo.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/color/ColoringAlgo.Builder.html @@ -2,10 +2,10 @@ - + ColoringAlgo.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/color/ColoringAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/color/ColoringAlgo.html index 55cb417140..9753935013 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/color/ColoringAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/color/ColoringAlgo.html @@ -2,10 +2,10 @@ - + ColoringAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/color/ColoringAlgoAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/color/ColoringAlgoAbstract.html index ce88190f3b..15148c76b3 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/color/ColoringAlgoAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/color/ColoringAlgoAbstract.html @@ -2,10 +2,10 @@ - + ColoringAlgoAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/color/ColoringDSatur.html b/0.4.1-snapshot/com/jgalgo/alg/color/ColoringDSatur.html index b01940645b..c0b89c02bf 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/color/ColoringDSatur.html +++ b/0.4.1-snapshot/com/jgalgo/alg/color/ColoringDSatur.html @@ -2,10 +2,10 @@ - + ColoringDSatur (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/color/ColoringGreedy.html b/0.4.1-snapshot/com/jgalgo/alg/color/ColoringGreedy.html index 870dc1bf2c..acd77bd44d 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/color/ColoringGreedy.html +++ b/0.4.1-snapshot/com/jgalgo/alg/color/ColoringGreedy.html @@ -2,10 +2,10 @@ - + ColoringGreedy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/color/ColoringRecursiveLargestFirst.html b/0.4.1-snapshot/com/jgalgo/alg/color/ColoringRecursiveLargestFirst.html index 8b1c47f66d..dd14618112 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/color/ColoringRecursiveLargestFirst.html +++ b/0.4.1-snapshot/com/jgalgo/alg/color/ColoringRecursiveLargestFirst.html @@ -2,10 +2,10 @@ - + ColoringRecursiveLargestFirst (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringAlgo.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringAlgo.Builder.html index 5f613b357f..fffd5f41d6 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringAlgo.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringAlgo.Builder.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.color.ColoringAlgo.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringAlgo.html index 60ddeb37be..7159e4d292 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringAlgo.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.color.ColoringAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringAlgoAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringAlgoAbstract.html index 248e8bd618..bfc9351343 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringAlgoAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringAlgoAbstract.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.color.ColoringAlgoAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringDSatur.html b/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringDSatur.html index b1832de07e..c614a122c9 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringDSatur.html +++ b/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringDSatur.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.color.ColoringDSatur (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringGreedy.html b/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringGreedy.html index 5567487e60..c105636a92 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringGreedy.html +++ b/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringGreedy.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.color.ColoringGreedy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringRecursiveLargestFirst.html b/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringRecursiveLargestFirst.html index 2eab288003..f4d5515dc6 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringRecursiveLargestFirst.html +++ b/0.4.1-snapshot/com/jgalgo/alg/color/class-use/ColoringRecursiveLargestFirst.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.color.ColoringRecursiveLargestFirst (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/color/package-summary.html b/0.4.1-snapshot/com/jgalgo/alg/color/package-summary.html index 0cbd48eb85..91e0a56850 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/color/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/alg/color/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.color (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/color/package-tree.html b/0.4.1-snapshot/com/jgalgo/alg/color/package-tree.html index caa39c8141..e01d9ae027 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/color/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/color/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.color Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/color/package-use.html b/0.4.1-snapshot/com/jgalgo/alg/color/package-use.html index 766f008c03..13cba63aff 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/color/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/alg/color/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.alg.color (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/BiConnectedComponentsAlgo.IResult.html b/0.4.1-snapshot/com/jgalgo/alg/connect/BiConnectedComponentsAlgo.IResult.html index ffda07f424..b8ebfa9570 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/BiConnectedComponentsAlgo.IResult.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/BiConnectedComponentsAlgo.IResult.html @@ -2,10 +2,10 @@ - + BiConnectedComponentsAlgo.IResult (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/BiConnectedComponentsAlgo.Result.html b/0.4.1-snapshot/com/jgalgo/alg/connect/BiConnectedComponentsAlgo.Result.html index 8208467c01..269510cd69 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/BiConnectedComponentsAlgo.Result.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/BiConnectedComponentsAlgo.Result.html @@ -2,10 +2,10 @@ - + BiConnectedComponentsAlgo.Result (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/BiConnectedComponentsAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/connect/BiConnectedComponentsAlgo.html index 68f1c03ae1..4458819fde 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/BiConnectedComponentsAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/BiConnectedComponentsAlgo.html @@ -2,10 +2,10 @@ - + BiConnectedComponentsAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/BiConnectedComponentsAlgoAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/BiConnectedComponentsAlgoAbstract.html index 8bdd5eac70..685641371f 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/BiConnectedComponentsAlgoAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/BiConnectedComponentsAlgoAbstract.html @@ -2,10 +2,10 @@ - + BiConnectedComponentsAlgoAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/BiConnectedComponentsAlgoHopcroftTarjan.html b/0.4.1-snapshot/com/jgalgo/alg/connect/BiConnectedComponentsAlgoHopcroftTarjan.html index 0c6767e275..315d309f03 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/BiConnectedComponentsAlgoHopcroftTarjan.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/BiConnectedComponentsAlgoHopcroftTarjan.html @@ -2,10 +2,10 @@ - + BiConnectedComponentsAlgoHopcroftTarjan (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/KEdgeConnectedComponentsAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/connect/KEdgeConnectedComponentsAlgo.html index 87afcb399b..7b9ffff1ca 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/KEdgeConnectedComponentsAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/KEdgeConnectedComponentsAlgo.html @@ -2,10 +2,10 @@ - + KEdgeConnectedComponentsAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/KEdgeConnectedComponentsAlgoAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/KEdgeConnectedComponentsAlgoAbstract.html index 6ad8b8466c..e0b8c42076 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/KEdgeConnectedComponentsAlgoAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/KEdgeConnectedComponentsAlgoAbstract.html @@ -2,10 +2,10 @@ - + KEdgeConnectedComponentsAlgoAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/KEdgeConnectedComponentsWang.html b/0.4.1-snapshot/com/jgalgo/alg/connect/KEdgeConnectedComponentsWang.html index d4010aa5de..a1906fab22 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/KEdgeConnectedComponentsWang.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/KEdgeConnectedComponentsWang.html @@ -2,10 +2,10 @@ - + KEdgeConnectedComponentsWang (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/KVertexConnectedComponentsAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/connect/KVertexConnectedComponentsAlgo.html index e404d31f57..fec42b9b1b 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/KVertexConnectedComponentsAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/KVertexConnectedComponentsAlgo.html @@ -2,10 +2,10 @@ - + KVertexConnectedComponentsAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/KVertexConnectedComponentsAlgoAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/KVertexConnectedComponentsAlgoAbstract.html index 3c75bc34ed..6cd516fbe3 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/KVertexConnectedComponentsAlgoAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/KVertexConnectedComponentsAlgoAbstract.html @@ -2,10 +2,10 @@ - + KVertexConnectedComponentsAlgoAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/KVertexConnectedComponentsWhiteMoody.html b/0.4.1-snapshot/com/jgalgo/alg/connect/KVertexConnectedComponentsWhiteMoody.html index 727c4f41bb..059ed6cdfb 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/KVertexConnectedComponentsWhiteMoody.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/KVertexConnectedComponentsWhiteMoody.html @@ -2,10 +2,10 @@ - + KVertexConnectedComponentsWhiteMoody (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutAllST.html b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutAllST.html index 2a4f1bf8e9..8c2fcf495b 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutAllST.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutAllST.html @@ -2,10 +2,10 @@ - + MinimumEdgeCutAllST (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutAllSTAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutAllSTAbstract.html index e22945752f..fd429d09cc 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutAllSTAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutAllSTAbstract.html @@ -2,10 +2,10 @@ - + MinimumEdgeCutAllSTAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutAllSTPicardQueyranne.html b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutAllSTPicardQueyranne.html index d8337e6cce..21a7d94c8b 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutAllSTPicardQueyranne.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutAllSTPicardQueyranne.html @@ -2,10 +2,10 @@ - + MinimumEdgeCutAllSTPicardQueyranne (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutGlobal.html b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutGlobal.html index 8b16c49bb8..35cf699c1a 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutGlobal.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutGlobal.html @@ -2,10 +2,10 @@ - + MinimumEdgeCutGlobal (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutGlobalAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutGlobalAbstract.html index e8df3c4280..1045436110 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutGlobalAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutGlobalAbstract.html @@ -2,10 +2,10 @@ - + MinimumEdgeCutGlobalAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutGlobalStoerWagner.html b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutGlobalStoerWagner.html index e942b7dff9..acc2446f6a 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutGlobalStoerWagner.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutGlobalStoerWagner.html @@ -2,10 +2,10 @@ - + MinimumEdgeCutGlobalStoerWagner (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutST.html b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutST.html index 3deba8acef..06dabcfaf1 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutST.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutST.html @@ -2,10 +2,10 @@ - + MinimumEdgeCutST (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutSTAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutSTAbstract.html index dee4ba8e30..fae47f197b 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutSTAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumEdgeCutSTAbstract.html @@ -2,10 +2,10 @@ - + MinimumEdgeCutSTAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllGlobal.html b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllGlobal.html index d27213208b..a9c44f23dd 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllGlobal.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllGlobal.html @@ -2,10 +2,10 @@ - + MinimumVertexCutAllGlobal (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllGlobalAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllGlobalAbstract.html index ed210c0628..4af2499dc1 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllGlobalAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllGlobalAbstract.html @@ -2,10 +2,10 @@ - + MinimumVertexCutAllGlobalAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllGlobalKanevsky.html b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllGlobalKanevsky.html index 932cada32d..f2dc8fcc11 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllGlobalKanevsky.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllGlobalKanevsky.html @@ -2,10 +2,10 @@ - + MinimumVertexCutAllGlobalKanevsky (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllST.html b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllST.html index b25ddaed6b..7a8fffce2a 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllST.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllST.html @@ -2,10 +2,10 @@ - + MinimumVertexCutAllST (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllSTAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllSTAbstract.html index 4d775e36cd..ed05381b9f 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllSTAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllSTAbstract.html @@ -2,10 +2,10 @@ - + MinimumVertexCutAllSTAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllSTEdgeCut.html b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllSTEdgeCut.html index 40aac8f5ec..feab2c792c 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllSTEdgeCut.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutAllSTEdgeCut.html @@ -2,10 +2,10 @@ - + MinimumVertexCutAllSTEdgeCut (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutGlobal.html b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutGlobal.html index 8338ddc3ca..11590eefe5 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutGlobal.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutGlobal.html @@ -2,10 +2,10 @@ - + MinimumVertexCutGlobal (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutGlobalAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutGlobalAbstract.html index 349904927c..17f680599f 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutGlobalAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutGlobalAbstract.html @@ -2,10 +2,10 @@ - + MinimumVertexCutGlobalAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutGlobalEsfahanianHakimi.html b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutGlobalEsfahanianHakimi.html index 03d100128a..42a178d6c9 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutGlobalEsfahanianHakimi.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutGlobalEsfahanianHakimi.html @@ -2,10 +2,10 @@ - + MinimumVertexCutGlobalEsfahanianHakimi (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutST.html b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutST.html index 1a63ec8a83..2f9cc4cc09 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutST.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutST.html @@ -2,10 +2,10 @@ - + MinimumVertexCutST (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutSTAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutSTAbstract.html index 4c723d7ea7..95764c3f31 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutSTAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutSTAbstract.html @@ -2,10 +2,10 @@ - + MinimumVertexCutSTAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutSTEdgeCut.html b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutSTEdgeCut.html index 1a7628aa3a..d4858abd4b 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutSTEdgeCut.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/MinimumVertexCutSTEdgeCut.html @@ -2,10 +2,10 @@ - + MinimumVertexCutSTEdgeCut (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/StronglyConnectedComponentsAlgo.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/connect/StronglyConnectedComponentsAlgo.Builder.html index 86527de606..55ec944631 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/StronglyConnectedComponentsAlgo.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/StronglyConnectedComponentsAlgo.Builder.html @@ -2,10 +2,10 @@ - + StronglyConnectedComponentsAlgo.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/StronglyConnectedComponentsAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/connect/StronglyConnectedComponentsAlgo.html index aab285d8bd..f5a449b777 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/StronglyConnectedComponentsAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/StronglyConnectedComponentsAlgo.html @@ -2,10 +2,10 @@ - + StronglyConnectedComponentsAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/StronglyConnectedComponentsAlgoAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/StronglyConnectedComponentsAlgoAbstract.html index aafc47285f..162fad3cee 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/StronglyConnectedComponentsAlgoAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/StronglyConnectedComponentsAlgoAbstract.html @@ -2,10 +2,10 @@ - + StronglyConnectedComponentsAlgoAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/StronglyConnectedComponentsPathBasedDfs.html b/0.4.1-snapshot/com/jgalgo/alg/connect/StronglyConnectedComponentsPathBasedDfs.html index c2a8229a3e..feb0bb58a5 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/StronglyConnectedComponentsPathBasedDfs.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/StronglyConnectedComponentsPathBasedDfs.html @@ -2,10 +2,10 @@ - + StronglyConnectedComponentsPathBasedDfs (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/StronglyConnectedComponentsTarjan.html b/0.4.1-snapshot/com/jgalgo/alg/connect/StronglyConnectedComponentsTarjan.html index e940616b77..72f4fddf13 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/StronglyConnectedComponentsTarjan.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/StronglyConnectedComponentsTarjan.html @@ -2,10 +2,10 @@ - + StronglyConnectedComponentsTarjan (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/WeaklyConnectedComponentsAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/connect/WeaklyConnectedComponentsAlgo.html index 2a8509ba1a..63336f77a5 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/WeaklyConnectedComponentsAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/WeaklyConnectedComponentsAlgo.html @@ -2,10 +2,10 @@ - + WeaklyConnectedComponentsAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/WeaklyConnectedComponentsAlgoAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/WeaklyConnectedComponentsAlgoAbstract.html index 055bd2df59..7d172b8060 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/WeaklyConnectedComponentsAlgoAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/WeaklyConnectedComponentsAlgoAbstract.html @@ -2,10 +2,10 @@ - + WeaklyConnectedComponentsAlgoAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/WeaklyConnectedComponentsAlgoImpl.html b/0.4.1-snapshot/com/jgalgo/alg/connect/WeaklyConnectedComponentsAlgoImpl.html index 180fe57930..bce768ee69 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/WeaklyConnectedComponentsAlgoImpl.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/WeaklyConnectedComponentsAlgoImpl.html @@ -2,10 +2,10 @@ - + WeaklyConnectedComponentsAlgoImpl (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -28,12 +28,6 @@ catch(err) { } //--> -var data = {"i0":10}; -var tabs = {65535:["t0","All Methods"],2:["t2","Instance Methods"],8:["t4","Concrete Methods"]}; -var altColor = "altColor"; -var rowColor = "rowColor"; -var tableTab = "tableTab"; -var activeTableTab = "activeTableTab"; var pathtoroot = "../../../../"; var useModuleDirectories = true; loadScripts(document, 'script'); @@ -100,7 +94,7 @@
  • Detail: 
  • Field | 
  • Constr | 
  • -
  • Method
  • +
  • Method
  • @@ -189,19 +183,6 @@

    Constructor Summary

    Method Summary

    - - - - - - - - - - - - -
    All Methods Instance Methods Concrete Methods 
    Modifier and TypeMethodDescription
    IVertexPartitionfindWeaklyConnectedComponents​(IndexGraph g) 
    - -
    - -
    @@ -327,7 +289,7 @@

    findWeaklyConnectedComponents

  • Detail: 
  • Field | 
  • Constr | 
  • -
  • Method
  • +
  • Method
  • diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/BiConnectedComponentsAlgo.IResult.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/BiConnectedComponentsAlgo.IResult.html index 52646ddfa3..c37e74c417 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/BiConnectedComponentsAlgo.IResult.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/BiConnectedComponentsAlgo.IResult.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.connect.BiConnectedComponentsAlgo.IResult (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/BiConnectedComponentsAlgo.Result.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/BiConnectedComponentsAlgo.Result.html index e2b49ca0b9..0f819f5ac4 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/BiConnectedComponentsAlgo.Result.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/BiConnectedComponentsAlgo.Result.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.connect.BiConnectedComponentsAlgo.Result (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/BiConnectedComponentsAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/BiConnectedComponentsAlgo.html index d9320f3a26..185752252f 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/BiConnectedComponentsAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/BiConnectedComponentsAlgo.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.connect.BiConnectedComponentsAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/BiConnectedComponentsAlgoAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/BiConnectedComponentsAlgoAbstract.html index 3c7672932f..6ca9420bf1 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/BiConnectedComponentsAlgoAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/BiConnectedComponentsAlgoAbstract.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.BiConnectedComponentsAlgoAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/BiConnectedComponentsAlgoHopcroftTarjan.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/BiConnectedComponentsAlgoHopcroftTarjan.html index addac79365..e5a0b2ed68 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/BiConnectedComponentsAlgoHopcroftTarjan.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/BiConnectedComponentsAlgoHopcroftTarjan.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.BiConnectedComponentsAlgoHopcroftTarjan (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KEdgeConnectedComponentsAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KEdgeConnectedComponentsAlgo.html index b980dd1719..8134db7a5c 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KEdgeConnectedComponentsAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KEdgeConnectedComponentsAlgo.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.connect.KEdgeConnectedComponentsAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KEdgeConnectedComponentsAlgoAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KEdgeConnectedComponentsAlgoAbstract.html index f8c8647350..9b96f5611e 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KEdgeConnectedComponentsAlgoAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KEdgeConnectedComponentsAlgoAbstract.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.KEdgeConnectedComponentsAlgoAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KEdgeConnectedComponentsWang.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KEdgeConnectedComponentsWang.html index d26ff1b854..470ef7c2ca 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KEdgeConnectedComponentsWang.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KEdgeConnectedComponentsWang.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.KEdgeConnectedComponentsWang (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KVertexConnectedComponentsAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KVertexConnectedComponentsAlgo.html index 674b25c6bc..3f87968ba9 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KVertexConnectedComponentsAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KVertexConnectedComponentsAlgo.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.connect.KVertexConnectedComponentsAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KVertexConnectedComponentsAlgoAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KVertexConnectedComponentsAlgoAbstract.html index 1ab54c557e..9390bddf35 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KVertexConnectedComponentsAlgoAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KVertexConnectedComponentsAlgoAbstract.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.KVertexConnectedComponentsAlgoAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KVertexConnectedComponentsWhiteMoody.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KVertexConnectedComponentsWhiteMoody.html index 367fda1a49..d07d27980a 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KVertexConnectedComponentsWhiteMoody.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/KVertexConnectedComponentsWhiteMoody.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.KVertexConnectedComponentsWhiteMoody (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutAllST.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutAllST.html index 936f2a8b81..3048c33e56 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutAllST.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutAllST.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.connect.MinimumEdgeCutAllST (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutAllSTAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutAllSTAbstract.html index 521dd2fa97..00b42c3c33 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutAllSTAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutAllSTAbstract.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.MinimumEdgeCutAllSTAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutAllSTPicardQueyranne.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutAllSTPicardQueyranne.html index 9801cb1f12..e5f62db49b 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutAllSTPicardQueyranne.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutAllSTPicardQueyranne.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.MinimumEdgeCutAllSTPicardQueyranne (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutGlobal.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutGlobal.html index 5bd2521827..189d0e6787 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutGlobal.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutGlobal.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.connect.MinimumEdgeCutGlobal (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutGlobalAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutGlobalAbstract.html index afa51b098b..143290bc50 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutGlobalAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutGlobalAbstract.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.MinimumEdgeCutGlobalAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutGlobalStoerWagner.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutGlobalStoerWagner.html index e488d853cf..85f55fef0f 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutGlobalStoerWagner.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutGlobalStoerWagner.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.MinimumEdgeCutGlobalStoerWagner (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutST.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutST.html index f02fe52b36..715b71d07c 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutST.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutST.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.connect.MinimumEdgeCutST (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutSTAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutSTAbstract.html index d086c366b6..aca4c57467 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutSTAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumEdgeCutSTAbstract.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.MinimumEdgeCutSTAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllGlobal.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllGlobal.html index 62af4b11c7..747300dc29 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllGlobal.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllGlobal.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.connect.MinimumVertexCutAllGlobal (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllGlobalAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllGlobalAbstract.html index 5921e0cbae..a34c1ae01c 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllGlobalAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllGlobalAbstract.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.MinimumVertexCutAllGlobalAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllGlobalKanevsky.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllGlobalKanevsky.html index 4a45d3ef41..b02c3b89c7 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllGlobalKanevsky.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllGlobalKanevsky.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.MinimumVertexCutAllGlobalKanevsky (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllST.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllST.html index 9852d1a5dd..31ee9668a9 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllST.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllST.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.connect.MinimumVertexCutAllST (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllSTAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllSTAbstract.html index 106a10da7f..95b09d6834 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllSTAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllSTAbstract.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.MinimumVertexCutAllSTAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllSTEdgeCut.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllSTEdgeCut.html index 649efe9107..1e3c3e8342 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllSTEdgeCut.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutAllSTEdgeCut.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.MinimumVertexCutAllSTEdgeCut (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutGlobal.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutGlobal.html index 4b2dcd7886..0ec8bcc4ce 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutGlobal.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutGlobal.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.connect.MinimumVertexCutGlobal (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutGlobalAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutGlobalAbstract.html index 842b45baf4..48788969ef 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutGlobalAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutGlobalAbstract.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.MinimumVertexCutGlobalAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutGlobalEsfahanianHakimi.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutGlobalEsfahanianHakimi.html index 3435b6e303..259c516960 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutGlobalEsfahanianHakimi.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutGlobalEsfahanianHakimi.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.MinimumVertexCutGlobalEsfahanianHakimi (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutST.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutST.html index c8c8df7a93..b42397c9d0 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutST.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutST.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.connect.MinimumVertexCutST (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutSTAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutSTAbstract.html index a66b467178..395271ce13 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutSTAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutSTAbstract.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.MinimumVertexCutSTAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutSTEdgeCut.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutSTEdgeCut.html index 8351f5bc24..5edb0b5ce2 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutSTEdgeCut.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/MinimumVertexCutSTEdgeCut.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.MinimumVertexCutSTEdgeCut (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/StronglyConnectedComponentsAlgo.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/StronglyConnectedComponentsAlgo.Builder.html index 1f4ede5fde..a445f59c12 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/StronglyConnectedComponentsAlgo.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/StronglyConnectedComponentsAlgo.Builder.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.connect.StronglyConnectedComponentsAlgo.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/StronglyConnectedComponentsAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/StronglyConnectedComponentsAlgo.html index dc9599c159..bc7595d5a0 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/StronglyConnectedComponentsAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/StronglyConnectedComponentsAlgo.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.connect.StronglyConnectedComponentsAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/StronglyConnectedComponentsAlgoAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/StronglyConnectedComponentsAlgoAbstract.html index 3b2c7e0b38..3203daadc5 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/StronglyConnectedComponentsAlgoAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/StronglyConnectedComponentsAlgoAbstract.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.StronglyConnectedComponentsAlgoAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/StronglyConnectedComponentsPathBasedDfs.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/StronglyConnectedComponentsPathBasedDfs.html index 3f42d2e199..31a69c48be 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/StronglyConnectedComponentsPathBasedDfs.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/StronglyConnectedComponentsPathBasedDfs.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.StronglyConnectedComponentsPathBasedDfs (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/StronglyConnectedComponentsTarjan.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/StronglyConnectedComponentsTarjan.html index 9730ea4bec..36a7ead7e6 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/StronglyConnectedComponentsTarjan.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/StronglyConnectedComponentsTarjan.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.StronglyConnectedComponentsTarjan (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/WeaklyConnectedComponentsAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/WeaklyConnectedComponentsAlgo.html index b8d42aaacd..5c2e09e9a7 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/WeaklyConnectedComponentsAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/WeaklyConnectedComponentsAlgo.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.connect.WeaklyConnectedComponentsAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/WeaklyConnectedComponentsAlgoAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/WeaklyConnectedComponentsAlgoAbstract.html index 5cbef5af44..ad3291e672 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/WeaklyConnectedComponentsAlgoAbstract.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/WeaklyConnectedComponentsAlgoAbstract.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.WeaklyConnectedComponentsAlgoAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/WeaklyConnectedComponentsAlgoImpl.html b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/WeaklyConnectedComponentsAlgoImpl.html index af4d657b70..704e8f0121 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/WeaklyConnectedComponentsAlgoImpl.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/class-use/WeaklyConnectedComponentsAlgoImpl.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.connect.WeaklyConnectedComponentsAlgoImpl (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/package-summary.html b/0.4.1-snapshot/com/jgalgo/alg/connect/package-summary.html index d48f378d90..d8d63049e3 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.connect (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/package-tree.html b/0.4.1-snapshot/com/jgalgo/alg/connect/package-tree.html index 4c7c7dce0a..3cbf826bb1 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.connect Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/connect/package-use.html b/0.4.1-snapshot/com/jgalgo/alg/connect/package-use.html index c6af11240e..9a0d9cac3d 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/connect/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/alg/connect/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.alg.connect (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cores/CoresAlgo.IResult.html b/0.4.1-snapshot/com/jgalgo/alg/cores/CoresAlgo.IResult.html index 751e4c2679..c2f2fd9b5a 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cores/CoresAlgo.IResult.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cores/CoresAlgo.IResult.html @@ -2,10 +2,10 @@ - + CoresAlgo.IResult (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cores/CoresAlgo.Result.html b/0.4.1-snapshot/com/jgalgo/alg/cores/CoresAlgo.Result.html index c20f2b09c7..01308c4dd1 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cores/CoresAlgo.Result.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cores/CoresAlgo.Result.html @@ -2,10 +2,10 @@ - + CoresAlgo.Result (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cores/CoresAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/cores/CoresAlgo.html index 1aeda3c318..9156b56f40 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cores/CoresAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cores/CoresAlgo.html @@ -2,10 +2,10 @@ - + CoresAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -125,6 +125,10 @@

    Interface CoresAlgo

    • +
      +
      All Known Implementing Classes:
      +
      CoresAlgoAbstract, CoresAlgoImpl
      +

      public interface CoresAlgo
      Cores computing algorithm. diff --git a/0.4.1-snapshot/com/jgalgo/alg/cores/CoresAlgoAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/cores/CoresAlgoAbstract.html new file mode 100644 index 0000000000..e570206a7e --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cores/CoresAlgoAbstract.html @@ -0,0 +1,383 @@ + + + + + +CoresAlgoAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
      + +
      + +
      +
      + +

      Class CoresAlgoAbstract

      +
      +
      + +
      +
        +
      • +
        +
        All Implemented Interfaces:
        +
        CoresAlgo
        +
        +
        +
        Direct Known Subclasses:
        +
        CoresAlgoImpl
        +
        +
        +
        public abstract class CoresAlgoAbstract
        +extends Object
        +implements CoresAlgo
        +
        Abstract class for computing the cores of a graph. + +

        + The class implements the interface by solving the problem on the index graph and then maps the results back to the + original graph. The implementation for the index graph is abstract and left to the subclasses.

        +
        +
        Author:
        +
        Barak Ugav
        +
        +
      • +
      +
      +
      + +
      +
      +
        +
      • + +
        +
          +
        • + + +

          Constructor Detail

          + + + +
            +
          • +

            CoresAlgoAbstract

            +
            public CoresAlgoAbstract()
            +
            Default constructor.
            +
          • +
          +
        • +
        +
        + +
        +
          +
        • + + +

          Method Detail

          + + + +
            +
          • +

            computeCores

            +
            public <V,​E> CoresAlgo.Result<V,​E> computeCores​(Graph<V,​E> g,
            +                                                            EdgeDirection degreeType)
            +
            Description copied from interface: CoresAlgo
            +
            Compute the cores of the graph with respect the given degree type. + +

            + Cores are defined with respect to either the out edges, in edges, or both. For undirected graphs the degree type + is ignored. + +

            + If g is IntGraph, the returned object is CoresAlgo.IResult. + +

            + For a detail description of the cores definition, see the interface documentation CoresAlgo.

            +
            +
            Specified by:
            +
            computeCores in interface CoresAlgo
            +
            Type Parameters:
            +
            V - the vertices type
            +
            E - the edges type
            +
            Parameters:
            +
            g - a graph
            +
            degreeType - the degree type the cores are computed with respect to
            +
            Returns:
            +
            the cores of the graph
            +
            +
          • +
          +
        • +
        +
        +
      • +
      +
      +
      +
      + + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cores/CoresAlgoImpl.html b/0.4.1-snapshot/com/jgalgo/alg/cores/CoresAlgoImpl.html new file mode 100644 index 0000000000..f2dcb6570e --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cores/CoresAlgoImpl.html @@ -0,0 +1,334 @@ + + + + + +CoresAlgoImpl (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
      + +
      + +
      +
      + +

      Class CoresAlgoImpl

      +
      +
      + +
      +
        +
      • +
        +
        All Implemented Interfaces:
        +
        CoresAlgo
        +
        +
        +
        public class CoresAlgoImpl
        +extends CoresAlgoAbstract
        +
        Linear cores computing algorithm. + +

        + The algorithm compute the core number of each vertex by computing the 0-core, than the 1-core, 2-core, ect. It does + so by removing all vertices with degree less than the current core number. + +

        + The algorithm runs in linear time. + +

        + Based on 'An O(m) Algorithm for Cores Decomposition of Networks' by Batagelj, V. and Zaversnik, M.

        +
        +
        Author:
        +
        Barak Ugav
        +
        +
      • +
      +
      +
      + +
      +
      +
        +
      • + +
        +
          +
        • + + +

          Constructor Detail

          + + + +
            +
          • +

            CoresAlgoImpl

            +
            public CoresAlgoImpl()
            +
            Create a new cores computing algorithm object. + +

            + Please prefer using CoresAlgo.newInstance() to get a default implementation for the CoresAlgo + interface.

            +
          • +
          +
        • +
        +
        +
      • +
      +
      +
      +
      + +
      + +

      Copyright © 2024. All rights reserved.

      +
      + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cores/class-use/CoresAlgo.IResult.html b/0.4.1-snapshot/com/jgalgo/alg/cores/class-use/CoresAlgo.IResult.html index f82a394dd5..32d8e8a50f 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cores/class-use/CoresAlgo.IResult.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cores/class-use/CoresAlgo.IResult.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.cores.CoresAlgo.IResult (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cores/class-use/CoresAlgo.Result.html b/0.4.1-snapshot/com/jgalgo/alg/cores/class-use/CoresAlgo.Result.html index 5168467d35..d836d1b33e 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cores/class-use/CoresAlgo.Result.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cores/class-use/CoresAlgo.Result.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.cores.CoresAlgo.Result (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -164,6 +164,12 @@

      Uses of Compute the cores of the graph with respect the given degree type.

      + +<V,​E>
      CoresAlgo.Result<V,​E> +CoresAlgoAbstract.computeCores​(Graph<V,​E> g, + EdgeDirection degreeType) +  + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cores/class-use/CoresAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/cores/class-use/CoresAlgo.html index 10d5220360..7f083309ef 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cores/class-use/CoresAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cores/class-use/CoresAlgo.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.cores.CoresAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -125,6 +125,30 @@

      Uses

      Uses of CoresAlgo in com.jgalgo.alg.cores

      + + + + + + + + + + + + + + + + + + +
      Classes in com.jgalgo.alg.cores that implement CoresAlgo 
      Modifier and TypeClassDescription
      class CoresAlgoAbstract +
      Abstract class for computing the cores of a graph.
      +
      class CoresAlgoImpl +
      Linear cores computing algorithm.
      +
      + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cores/class-use/CoresAlgoAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/cores/class-use/CoresAlgoAbstract.html new file mode 100644 index 0000000000..6666c867de --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cores/class-use/CoresAlgoAbstract.html @@ -0,0 +1,200 @@ + + + + + +Uses of Class com.jgalgo.alg.cores.CoresAlgoAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
      + +
      +
      +
      +

      Uses of Class
      com.jgalgo.alg.cores.CoresAlgoAbstract

      +
      +
      +
        +
      • +
      Methods in com.jgalgo.alg.cores that return CoresAlgo 
      Modifier and Type
      + + + + + + + + + + + +
      Packages that use CoresAlgoAbstract 
      PackageDescription
      com.jgalgo.alg.cores +
      Algorithms for computing the cores of graphs.
      +
      +
    • +
    • + +
    • +
    +
    + + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cores/class-use/CoresAlgoImpl.html b/0.4.1-snapshot/com/jgalgo/alg/cores/class-use/CoresAlgoImpl.html new file mode 100644 index 0000000000..397f6d38ac --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cores/class-use/CoresAlgoImpl.html @@ -0,0 +1,152 @@ + + + + + +Uses of Class com.jgalgo.alg.cores.CoresAlgoImpl (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
    + +
    +
    +
    +

    Uses of Class
    com.jgalgo.alg.cores.CoresAlgoImpl

    +
    +
    No usage of com.jgalgo.alg.cores.CoresAlgoImpl
    +
    + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cores/package-summary.html b/0.4.1-snapshot/com/jgalgo/alg/cores/package-summary.html index d4898f39fe..34cfee8912 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cores/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cores/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.cores (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -134,6 +134,29 @@

    Package com.jgalgo.alg.cores

    +
  • + + + + + + + + + + + + + + + + +
    Class Summary 
    ClassDescription
    CoresAlgoAbstract +
    Abstract class for computing the cores of a graph.
    +
    CoresAlgoImpl +
    Linear cores computing algorithm.
    +
    +
  • diff --git a/0.4.1-snapshot/com/jgalgo/alg/cores/package-tree.html b/0.4.1-snapshot/com/jgalgo/alg/cores/package-tree.html index fbae2528bc..7c9c7a3e03 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cores/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cores/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.cores Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -104,6 +104,20 @@

    Hierarchy For Package com.jgalgo.alg.cores

    +

    Class Hierarchy

    + +
    +

    Interface Hierarchy

    • com.jgalgo.alg.cores.CoresAlgo
    • diff --git a/0.4.1-snapshot/com/jgalgo/alg/cores/package-use.html b/0.4.1-snapshot/com/jgalgo/alg/cores/package-use.html index b006837f9e..475615dc24 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cores/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cores/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.alg.cores (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -139,6 +139,12 @@

      Uses of PackageThe result of the cores computation.

    + +CoresAlgoAbstract + +
    Abstract class for computing the cores of a graph.
    + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/DominatingSetAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/cover/DominatingSetAlgo.html index 7fb4bcb3a6..f2388342c8 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cover/DominatingSetAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/DominatingSetAlgo.html @@ -2,10 +2,10 @@ - + DominatingSetAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -125,6 +125,10 @@

    Interface DominatingSetAlg
    • +
      +
      All Known Implementing Classes:
      +
      DominatingSetAlgoAbstract, DominatingSetAlgoGreedy
      +

      public interface DominatingSetAlgo
      An algorithm for computing a minimum dominating set. diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/DominatingSetAlgoAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/cover/DominatingSetAlgoAbstract.html new file mode 100644 index 0000000000..f2c7d95acd --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/DominatingSetAlgoAbstract.html @@ -0,0 +1,359 @@ + + + + + +DominatingSetAlgoAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
      + +
      + +
      +
      + +

      Class DominatingSetAlgoAbstract

      +
      +
      + +
      +
        +
      • +
        +
        All Implemented Interfaces:
        +
        DominatingSetAlgo
        +
        +
        +
        Direct Known Subclasses:
        +
        DominatingSetAlgoGreedy
        +
        +
        +
        public abstract class DominatingSetAlgoAbstract
        +extends Object
        +implements DominatingSetAlgo
        +
        Abstract class for computing a minimum dominating set. + +

        + The class implements the interface by solving the problem on the index graph and then maps the results back to the + original graph. The implementation for the index graph is abstract and left to the subclasses.

        +
        +
        Author:
        +
        Barak Ugav
        +
        +
      • +
      +
      +
      + +
      +
      +
        +
      • + +
        +
          +
        • + + +

          Constructor Detail

          + + + +
            +
          • +

            DominatingSetAlgoAbstract

            +
            public DominatingSetAlgoAbstract()
            +
            Default constructor.
            +
          • +
          +
        • +
        +
        + +
        +
          +
        • + + +

          Method Detail

          + + + +
            +
          • +

            computeMinimumDominationSet

            +
            public <V,​E> Set<V> computeMinimumDominationSet​(Graph<V,​E> g,
            +                                                      WeightFunction<V> w,
            +                                                      EdgeDirection dominanceDirection)
            +
            Description copied from interface: DominatingSetAlgo
            +
            Compute a minimum dominating set of the graph with respect to the given edges direction.
            +
            +
            Specified by:
            +
            computeMinimumDominationSet in interface DominatingSetAlgo
            +
            Type Parameters:
            +
            V - the vertices type
            +
            E - the edges type
            +
            Parameters:
            +
            g - a graph
            +
            w - a vertex weight function
            +
            dominanceDirection - the direction of the edges to consider
            +
            Returns:
            +
            a minimum dominating set of the graph
            +
            +
          • +
          +
        • +
        +
        +
      • +
      +
      +
      +
      + +
      + +

      Copyright © 2024. All rights reserved.

      +
      + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/DominatingSetAlgoGreedy.html b/0.4.1-snapshot/com/jgalgo/alg/cover/DominatingSetAlgoGreedy.html new file mode 100644 index 0000000000..62057da72b --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/DominatingSetAlgoGreedy.html @@ -0,0 +1,364 @@ + + + + + +DominatingSetAlgoGreedy (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
      + +
      + +
      +
      + +

      Class DominatingSetAlgoGreedy

      +
      +
      + +
      +
        +
      • +
        +
        All Implemented Interfaces:
        +
        DominatingSetAlgo, RandomizedAlgorithm
        +
        +
        +
        public class DominatingSetAlgoGreedy
        +extends DominatingSetAlgoAbstract
        +implements RandomizedAlgorithm
        +
        A greedy algorithm for computing a minimum dominating set. + +

        + The algorithm is randomized algorithm that adds vertices to the dominating set one by one. In each iteration, a + random vertex is sampled with probability proportional to the number of vertices it will dominate.

        +
        +
        Author:
        +
        Barak Ugav
        +
        +
      • +
      +
      +
      + +
      +
      +
        +
      • + +
        +
          +
        • + + +

          Constructor Detail

          + + + +
            +
          • +

            DominatingSetAlgoGreedy

            +
            public DominatingSetAlgoGreedy()
            +
            Create a new greedy dominating set algorithm object. + +

            + Please prefer using DominatingSetAlgo.newInstance() to get a default implementation for the + DominatingSetAlgo interface.

            +
          • +
          +
        • +
        +
        + +
        +
          +
        • + + +

          Method Detail

          + + + +
            +
          • +

            setSeed

            +
            public void setSeed​(long seed)
            +
            Description copied from interface: RandomizedAlgorithm
            +
            Sets the seed for the random number generator. + +

            + The algorithm will use the same seed for the random number generator, in order to perform deterministically. Note + that if methods of the algorithm are called multiple times, the seed should be set before each call.

            +
            +
            Specified by:
            +
            setSeed in interface RandomizedAlgorithm
            +
            Parameters:
            +
            seed - the seed for the random number generator.
            +
            +
          • +
          +
        • +
        +
        +
      • +
      +
      +
      +
      + +
      + +

      Copyright © 2024. All rights reserved.

      +
      + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/EdgeCover.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/cover/EdgeCover.Builder.html index fac2878f20..bf5ea54a6a 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cover/EdgeCover.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/EdgeCover.Builder.html @@ -2,10 +2,10 @@ - + EdgeCover.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/EdgeCover.html b/0.4.1-snapshot/com/jgalgo/alg/cover/EdgeCover.html index a0932765fe..810a92096d 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cover/EdgeCover.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/EdgeCover.html @@ -2,10 +2,10 @@ - + EdgeCover (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -125,6 +125,10 @@

      Interface EdgeCover

      • +
        +
        All Known Implementing Classes:
        +
        EdgeCoverAbstract, EdgeCoverCardinality, EdgeCoverWeighted
        +

        public interface EdgeCover
        Minimum edge vertex cover algorithm. diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/EdgeCoverAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/cover/EdgeCoverAbstract.html new file mode 100644 index 0000000000..ba8ecaa384 --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/EdgeCoverAbstract.html @@ -0,0 +1,370 @@ + + + + + +EdgeCoverAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
        + +
        + +
        +
        + +

        Class EdgeCoverAbstract

        +
        +
        + +
        +
          +
        • +
          +
          All Implemented Interfaces:
          +
          EdgeCover
          +
          +
          +
          Direct Known Subclasses:
          +
          EdgeCoverCardinality, EdgeCoverWeighted
          +
          +
          +
          public abstract class EdgeCoverAbstract
          +extends Object
          +implements EdgeCover
          +
          Abstract class for computing a minimum edge cover. + +

          + The class implements the interface by solving the problem on the index graph and then maps the results back to the + original graph. The implementation for the index graph is abstract and left to the subclasses.

          +
          +
          Author:
          +
          Barak Ugav
          +
          +
        • +
        +
        +
        + +
        +
        +
          +
        • + +
          +
            +
          • + + +

            Constructor Detail

            + + + +
              +
            • +

              EdgeCoverAbstract

              +
              public EdgeCoverAbstract()
              +
              Default constructor.
              +
            • +
            +
          • +
          +
          + +
          +
            +
          • + + +

            Method Detail

            + + + +
              +
            • +

              computeMinimumEdgeCover

              +
              public <V,​E> Set<E> computeMinimumEdgeCover​(Graph<V,​E> g,
              +                                                  WeightFunction<E> w)
              +
              Description copied from interface: EdgeCover
              +
              Compute a minimum edge cover of a graph with respect to an edge weight function. + +

              + If g is IntGraph, the returned object is IntSet. If g is IntGraph, prefer + to pass IWeightFunction for best performance.

              +
              +
              Specified by:
              +
              computeMinimumEdgeCover in interface EdgeCover
              +
              Type Parameters:
              +
              V - the vertices type
              +
              E - the edges type
              +
              Parameters:
              +
              g - a graph
              +
              w - an edge weight function
              +
              Returns:
              +
              a minimum edge cover
              +
              +
            • +
            +
          • +
          +
          +
        • +
        +
        +
        +
        + + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/EdgeCoverCardinality.html b/0.4.1-snapshot/com/jgalgo/alg/cover/EdgeCoverCardinality.html new file mode 100644 index 0000000000..f9caacfaf0 --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/EdgeCoverCardinality.html @@ -0,0 +1,327 @@ + + + + + +EdgeCoverCardinality (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
        + +
        + +
        +
        + +

        Class EdgeCoverCardinality

        +
        +
        + +
        +
          +
        • +
          +
          All Implemented Interfaces:
          +
          EdgeCover
          +
          +
          +
          public class EdgeCoverCardinality
          +extends EdgeCoverAbstract
          +
          A simply algorithm for computing a minimum edge cover using a maximum matching algorithm. + +

          + The algorithm compute a maximum cardinality matching and adds the matching edges to the cover, and then adds more + edges greedily until the cover is complete. This algorithm achieves the optimal solution for both directed and + undirected graphs. For directed graph, the algorithm treat use the undirected + view of the graph. + +

          + The algorithm running time is dominated by the maximum matching algorithm. Other than that, the algorithm use linear + time and space.

          +
          +
          Author:
          +
          Barak Ugav
          +
          +
        • +
        +
        +
        + +
        +
        +
          +
        • + +
          +
            +
          • + + +

            Constructor Detail

            + + + +
              +
            • +

              EdgeCoverCardinality

              +
              public EdgeCoverCardinality()
              +
              Create a new edge cover algorithm object for unweighted graphs. + +

              + Please prefer using EdgeCover.newInstance() to get a default implementation for the EdgeCover + interface.

              +
            • +
            +
          • +
          +
          +
        • +
        +
        +
        +
        + +
        + +

        Copyright © 2024. All rights reserved.

        +
        + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/EdgeCoverWeighted.html b/0.4.1-snapshot/com/jgalgo/alg/cover/EdgeCoverWeighted.html new file mode 100644 index 0000000000..3dcbd2ffa9 --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/EdgeCoverWeighted.html @@ -0,0 +1,329 @@ + + + + + +EdgeCoverWeighted (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
        + +
        + +
        +
        + +

        Class EdgeCoverWeighted

        +
        +
        + +
        +
          +
        • +
          +
          All Implemented Interfaces:
          +
          EdgeCover
          +
          +
          +
          public class EdgeCoverWeighted
          +extends EdgeCoverAbstract
          +
          A simply algorithm for computing a minimum weighted edge cover using a minimum weighted perfect matching algorithm. + +

          + The algorithm uses a reduction to a minimum weighted perfect matching problem: a graph \(G'\) is constructed, by + duplicating the graph \(G\), namely duplicating each vertex \(v\) to two vertices \(v_0\) and \(v_1\) and adding an + edge between \(u_0\) and \(v_0\) and between \(u_1\) and \(v_1\) for each edge \((u, v)\) in \(G\). In addition, + between each pair of vertices \(v_0\) and \(v_1\) in \(G'\) an edge is added with weight equal to the minimum weight + of an edge incident to \(v\) in \(G\). The minimum weighted perfect matching in \(G'\) is computed and the edges + corresponding to the matching are added to the edge cover. + +

          + The algorithm running time and space are dominated by the minimum weighted perfect matching algorithm used. Other + than that, the algorithm use linear space and time.

          +
          +
          Author:
          +
          Barak Ugav
          +
          +
        • +
        +
        +
        + +
        +
        +
          +
        • + +
          +
            +
          • + + +

            Constructor Detail

            + + + +
              +
            • +

              EdgeCoverWeighted

              +
              public EdgeCoverWeighted()
              +
              Create a new weighted edge cover algorithm object. + +

              + Please prefer using EdgeCover.newInstance() to get a default implementation for the EdgeCover + interface.

              +
            • +
            +
          • +
          +
          +
        • +
        +
        +
        +
        + +
        + +

        Copyright © 2024. All rights reserved.

        +
        + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/VertexCover.html b/0.4.1-snapshot/com/jgalgo/alg/cover/VertexCover.html index cd76a6bd0b..0a73997f65 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cover/VertexCover.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/VertexCover.html @@ -2,10 +2,10 @@ - + VertexCover (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -125,6 +125,10 @@

        Interface VertexCover

        • +
          +
          All Known Implementing Classes:
          +
          VertexCoverAbstract, VertexCoverBarYehuda
          +

          public interface VertexCover
          Minimum weighted vertex cover algorithm. diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/VertexCoverAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/cover/VertexCoverAbstract.html new file mode 100644 index 0000000000..578c148cdc --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/VertexCoverAbstract.html @@ -0,0 +1,357 @@ + + + + + +VertexCoverAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
          + +
          + +
          +
          + +

          Class VertexCoverAbstract

          +
          +
          + +
          +
            +
          • +
            +
            All Implemented Interfaces:
            +
            VertexCover
            +
            +
            +
            Direct Known Subclasses:
            +
            VertexCoverBarYehuda
            +
            +
            +
            public abstract class VertexCoverAbstract
            +extends Object
            +implements VertexCover
            +
            Abstract class for computing a minimum vertex cover. + +

            + The class implements the interface by solving the problem on the index graph and then maps the results back to the + original graph. The implementation for the index graph is abstract and left to the subclasses.

            +
            +
            Author:
            +
            Barak Ugav
            +
            +
          • +
          +
          +
          + +
          +
          +
            +
          • + +
            +
              +
            • + + +

              Constructor Detail

              + + + +
                +
              • +

                VertexCoverAbstract

                +
                public VertexCoverAbstract()
                +
                Default constructor.
                +
              • +
              +
            • +
            +
            + +
            +
              +
            • + + +

              Method Detail

              + + + +
                +
              • +

                computeMinimumVertexCover

                +
                public <V,​E> Set<V> computeMinimumVertexCover​(Graph<V,​E> g,
                +                                                    WeightFunction<V> w)
                +
                Description copied from interface: VertexCover
                +
                Compute a minimum vertex cover of a graph with respect to a vertex weight function. + +

                + Note that finding the minimum vertex cover is an NP-hard problem, therefore the result of this function is an + approximation of the optimal solution. + +

                + If g is IntGraph, the returned object is IntSet. If g is IntGraph, prefer + to pass IWeightFunction as w to avoid boxing/unboxing.

                +
                +
                Specified by:
                +
                computeMinimumVertexCover in interface VertexCover
                +
                Type Parameters:
                +
                V - the vertices type
                +
                E - the edges type
                +
                Parameters:
                +
                g - a graph
                +
                w - a vertex weight function
                +
                Returns:
                +
                a minimum vertex cover
                +
                +
              • +
              +
            • +
            +
            +
          • +
          +
          +
          +
          + +
          + +

          Copyright © 2024. All rights reserved.

          +
          + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/VertexCoverBarYehuda.html b/0.4.1-snapshot/com/jgalgo/alg/cover/VertexCoverBarYehuda.html new file mode 100644 index 0000000000..e5d4220a98 --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/VertexCoverBarYehuda.html @@ -0,0 +1,306 @@ + + + + + +VertexCoverBarYehuda (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
          + +
          + +
          +
          + +

          Class VertexCoverBarYehuda

          +
          +
          + +
          +
            +
          • +
            +
            All Implemented Interfaces:
            +
            VertexCover
            +
            +
            +
            public class VertexCoverBarYehuda
            +extends VertexCoverAbstract
            +
            Bar Yehuda's vertex cover algorithm. + +

            + Runs in linear time. + +

            + Based on 'A linear-time approximation algorithm for the weighted vertex cover problem' by R Bar-Yehuda.

            +
            +
            Author:
            +
            Barak Ugav
            +
            +
          • +
          +
          +
          + +
          +
          +
            +
          • + +
            +
              +
            • + + +

              Constructor Detail

              + + + +
                +
              • +

                VertexCoverBarYehuda

                +
                public VertexCoverBarYehuda()
                +
                Create a new Bar Yehuda's vertex cover algorithm object. + +

                + Please prefer using VertexCover.newInstance() to get a default implementation for the VertexCover + interface.

                +
              • +
              +
            • +
            +
            +
          • +
          +
          +
          +
          + +
          + +

          Copyright © 2024. All rights reserved.

          +
          + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/DominatingSetAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/DominatingSetAlgo.html index 2e9c3d1cf9..5ef19d29ff 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/DominatingSetAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/DominatingSetAlgo.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.cover.DominatingSetAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -125,6 +125,30 @@

          DominatingSetAlgo in com.jgalgo.alg.cover

          + + + + + + + + + + + + + + + + + + +
          Classes in com.jgalgo.alg.cover that implement DominatingSetAlgo 
          Modifier and TypeClassDescription
          class DominatingSetAlgoAbstract +
          Abstract class for computing a minimum dominating set.
          +
          class DominatingSetAlgoGreedy +
          A greedy algorithm for computing a minimum dominating set.
          +
          + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/DominatingSetAlgoAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/DominatingSetAlgoAbstract.html new file mode 100644 index 0000000000..3ca598d186 --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/DominatingSetAlgoAbstract.html @@ -0,0 +1,200 @@ + + + + + +Uses of Class com.jgalgo.alg.cover.DominatingSetAlgoAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
          + +
          +
          +
          +

          Uses of Class
          com.jgalgo.alg.cover.DominatingSetAlgoAbstract

          +
          +
          +
            +
          • +
          Methods in com.jgalgo.alg.cover that return DominatingSetAlgo 
          Modifier and Type
          + + + + + + + + + + + +
          Packages that use DominatingSetAlgoAbstract 
          PackageDescription
          com.jgalgo.alg.cover +
          Algorithms for solving set cover problems, such as minimum vertex/edge cover, dominating set, etc.
          +
          +
        • +
        • + +
        • +
        +
        + + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/DominatingSetAlgoGreedy.html b/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/DominatingSetAlgoGreedy.html new file mode 100644 index 0000000000..87603152ce --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/DominatingSetAlgoGreedy.html @@ -0,0 +1,152 @@ + + + + + +Uses of Class com.jgalgo.alg.cover.DominatingSetAlgoGreedy (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
        + +
        +
        +
        +

        Uses of Class
        com.jgalgo.alg.cover.DominatingSetAlgoGreedy

        +
        +
        No usage of com.jgalgo.alg.cover.DominatingSetAlgoGreedy
        +
        + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/EdgeCover.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/EdgeCover.Builder.html index bac26c3b04..98525af999 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/EdgeCover.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/EdgeCover.Builder.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.cover.EdgeCover.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/EdgeCover.html b/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/EdgeCover.html index b817b915f7..181ecd7a9d 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/EdgeCover.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/EdgeCover.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.cover.EdgeCover (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -125,6 +125,37 @@

        Uses

        Uses of EdgeCover in com.jgalgo.alg.cover

        + + + + + + + + + + + + + + + + + + + + + + + +
        Classes in com.jgalgo.alg.cover that implement EdgeCover 
        Modifier and TypeClassDescription
        class EdgeCoverAbstract +
        Abstract class for computing a minimum edge cover.
        +
        class EdgeCoverCardinality +
        A simply algorithm for computing a minimum edge cover using a maximum matching algorithm.
        +
        class EdgeCoverWeighted +
        A simply algorithm for computing a minimum weighted edge cover using a minimum weighted perfect matching algorithm.
        +
        + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/EdgeCoverAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/EdgeCoverAbstract.html new file mode 100644 index 0000000000..a25cd23f62 --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/EdgeCoverAbstract.html @@ -0,0 +1,207 @@ + + + + + +Uses of Class com.jgalgo.alg.cover.EdgeCoverAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
        + +
        +
        +
        +

        Uses of Class
        com.jgalgo.alg.cover.EdgeCoverAbstract

        +
        +
        +
          +
        • +
        Methods in com.jgalgo.alg.cover that return EdgeCover 
        Modifier and Type
        + + + + + + + + + + + +
        Packages that use EdgeCoverAbstract 
        PackageDescription
        com.jgalgo.alg.cover +
        Algorithms for solving set cover problems, such as minimum vertex/edge cover, dominating set, etc.
        +
        +
      • +
      • + +
      • +
      +
      + + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/EdgeCoverCardinality.html b/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/EdgeCoverCardinality.html new file mode 100644 index 0000000000..c4e591b15a --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/EdgeCoverCardinality.html @@ -0,0 +1,152 @@ + + + + + +Uses of Class com.jgalgo.alg.cover.EdgeCoverCardinality (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
      + +
      +
      +
      +

      Uses of Class
      com.jgalgo.alg.cover.EdgeCoverCardinality

      +
      +
      No usage of com.jgalgo.alg.cover.EdgeCoverCardinality
      +
      + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/EdgeCoverWeighted.html b/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/EdgeCoverWeighted.html new file mode 100644 index 0000000000..b16105678a --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/EdgeCoverWeighted.html @@ -0,0 +1,152 @@ + + + + + +Uses of Class com.jgalgo.alg.cover.EdgeCoverWeighted (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
      + +
      +
      +
      +

      Uses of Class
      com.jgalgo.alg.cover.EdgeCoverWeighted

      +
      +
      No usage of com.jgalgo.alg.cover.EdgeCoverWeighted
      +
      + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/VertexCover.html b/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/VertexCover.html index 2b71d18609..39678b7903 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/VertexCover.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/VertexCover.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.cover.VertexCover (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -125,6 +125,30 @@

      Use

      Uses of VertexCover in com.jgalgo.alg.cover

      + + + + + + + + + + + + + + + + + + +
      Classes in com.jgalgo.alg.cover that implement VertexCover 
      Modifier and TypeClassDescription
      class VertexCoverAbstract +
      Abstract class for computing a minimum vertex cover.
      +
      class VertexCoverBarYehuda +
      Bar Yehuda's vertex cover algorithm.
      +
      + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/VertexCoverAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/VertexCoverAbstract.html new file mode 100644 index 0000000000..a2bd061fbe --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/VertexCoverAbstract.html @@ -0,0 +1,200 @@ + + + + + +Uses of Class com.jgalgo.alg.cover.VertexCoverAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
      + +
      +
      +
      +

      Uses of Class
      com.jgalgo.alg.cover.VertexCoverAbstract

      +
      +
      +
        +
      • +
      Methods in com.jgalgo.alg.cover that return VertexCover 
      Modifier and Type
      + + + + + + + + + + + +
      Packages that use VertexCoverAbstract 
      PackageDescription
      com.jgalgo.alg.cover +
      Algorithms for solving set cover problems, such as minimum vertex/edge cover, dominating set, etc.
      +
      +
    • +
    • + +
    • +
    +
    + + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/VertexCoverBarYehuda.html b/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/VertexCoverBarYehuda.html new file mode 100644 index 0000000000..e3f981fdd9 --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/class-use/VertexCoverBarYehuda.html @@ -0,0 +1,152 @@ + + + + + +Uses of Class com.jgalgo.alg.cover.VertexCoverBarYehuda (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
    + +
    +
    +
    +

    Uses of Class
    com.jgalgo.alg.cover.VertexCoverBarYehuda

    +
    +
    No usage of com.jgalgo.alg.cover.VertexCoverBarYehuda
    +
    + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/package-summary.html b/0.4.1-snapshot/com/jgalgo/alg/cover/package-summary.html index 04950f9221..32b30c38b0 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cover/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.cover (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -140,6 +140,59 @@

    Package com.jgalgo.alg.cover

    +
  • + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Class Summary 
    ClassDescription
    DominatingSetAlgoAbstract +
    Abstract class for computing a minimum dominating set.
    +
    DominatingSetAlgoGreedy +
    A greedy algorithm for computing a minimum dominating set.
    +
    EdgeCoverAbstract +
    Abstract class for computing a minimum edge cover.
    +
    EdgeCoverCardinality +
    A simply algorithm for computing a minimum edge cover using a maximum matching algorithm.
    +
    EdgeCoverWeighted +
    A simply algorithm for computing a minimum weighted edge cover using a minimum weighted perfect matching algorithm.
    +
    VertexCoverAbstract +
    Abstract class for computing a minimum vertex cover.
    +
    VertexCoverBarYehuda +
    Bar Yehuda's vertex cover algorithm.
    +
    +
  • diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/package-tree.html b/0.4.1-snapshot/com/jgalgo/alg/cover/package-tree.html index 337691d517..0420284931 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cover/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.cover Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -104,6 +104,31 @@

    Hierarchy For Package com.jgalgo.alg.cover

    +

    Class Hierarchy

    + +
    +

    Interface Hierarchy

    • com.jgalgo.alg.AlgorithmBuilderBase diff --git a/0.4.1-snapshot/com/jgalgo/alg/cover/package-use.html b/0.4.1-snapshot/com/jgalgo/alg/cover/package-use.html index 62a37fbea7..684c323ec2 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cover/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cover/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.alg.cover (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -134,23 +134,41 @@

      Uses of Package +DominatingSetAlgoAbstract + +
      Abstract class for computing a minimum dominating set.
      + + + EdgeCover
      Minimum edge vertex cover algorithm.
      - + EdgeCover.Builder
      A builder for EdgeCover algorithms.
      + +EdgeCoverAbstract + +
      Abstract class for computing a minimum edge cover.
      + + VertexCover
      Minimum weighted vertex cover algorithm.
      + +VertexCoverAbstract + +
      Abstract class for computing a minimum vertex cover.
      + +

    • diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/ChinesePostman.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/ChinesePostman.html index f605865139..87a41c97bd 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cycle/ChinesePostman.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/ChinesePostman.html @@ -2,10 +2,10 @@ - + ChinesePostman (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -28,8 +28,8 @@ catch(err) { } //--> -var data = {"i0":6,"i1":1}; -var tabs = {65535:["t0","All Methods"],1:["t1","Static Methods"],2:["t2","Instance Methods"],4:["t3","Abstract Methods"]}; +var data = {"i0":18,"i1":6,"i2":1}; +var tabs = {65535:["t0","All Methods"],1:["t1","Static Methods"],2:["t2","Instance Methods"],4:["t3","Abstract Methods"],16:["t5","Default Methods"]}; var altColor = "altColor"; var rowColor = "rowColor"; var tableTab = "tableTab"; @@ -125,6 +125,10 @@

      Interface ChinesePostman

      • +
        +
        All Known Implementing Classes:
        +
        ChinesePostmanAbstract, ChinesePostmanImpl
        +

        public interface ChinesePostman
        An algorithm for the chinese postman problem. @@ -156,14 +160,14 @@

        Interface ChinesePostman

        Method Summary

        - + - + + + + + + + + + + - + + + + + + + + +
        All Methods Static Methods Instance Methods Abstract Methods All Methods Static Methods Instance Methods Abstract Methods Default Methods 
        Modifier and Type Method Description
        <V,​E>
        Path<V,​E>
        default <V,​E>
        Path<V,​E>
        computeShortestEdgeVisitorCircle​(Graph<V,​E> g, WeightFunction<E> w) @@ -171,6 +175,14 @@

        Method Summary

        <V,​E>
        Optional<Path<V,​E>>
        computeShortestEdgeVisitorCircleIfExist​(Graph<V,​E> g, + WeightFunction<E> w) +
        Compute the shortest circuit that visits all edges in the graph at least once, if it exist.
        +
        static ChinesePostman newInstance() @@ -200,8 +212,8 @@

        Method Detail

        • computeShortestEdgeVisitorCircle

          -
          <V,​E> Path<V,​E> computeShortestEdgeVisitorCircle​(Graph<V,​E> g,
          -                                                             WeightFunction<E> w)
          +
          default <V,​E> Path<V,​E> computeShortestEdgeVisitorCircle​(Graph<V,​E> g,
          +                                                                     WeightFunction<E> w)
          Compute the shortest circuit that visits all edges in the graph at least once.

          @@ -215,8 +227,37 @@

          computeShortestEdgeVisitorCircle

          g - a graph
          w - an edge weight function
          Returns:
          -
          a closed path that visits all edges in the graph, with minimum weight sum with respect to the given - edge weight function
          +
          a closed path that visits all edges in the graph, with minimum weight sum with + respect to the given edge weight function
          +
          Throws:
          +
          IllegalArgumentException - if no solution exists, that is if the graph is not strongly connected
          + +
        • +
        + + + +
          +
        • +

          computeShortestEdgeVisitorCircleIfExist

          +
          <V,​E> Optional<Path<V,​E>> computeShortestEdgeVisitorCircleIfExist​(Graph<V,​E> g,
          +                                                                              WeightFunction<E> w)
          +
          Compute the shortest circuit that visits all edges in the graph at least once, if it exist. + +

          + If g is IntGraph, the returned object is an optional of IPath. If g is + IntGraph, prefer to pass IWeightFunction for best performance.

          +
          +
          Type Parameters:
          +
          V - the vertices type
          +
          E - the edges type
          +
          Parameters:
          +
          g - a graph
          +
          w - an edge weight function
          +
          Returns:
          +
          an optional of closed path that visits all edges in the graph, with minimum weight sum with respect + to the given edge weight function, or empty if no solution exists (the graph is not strongly + connected)
        diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/ChinesePostmanAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/ChinesePostmanAbstract.html new file mode 100644 index 0000000000..361da364b5 --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/ChinesePostmanAbstract.html @@ -0,0 +1,362 @@ + + + + + +ChinesePostmanAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
        + +
        + +
        +
        + +

        Class ChinesePostmanAbstract

        +
        +
        + +
        +
          +
        • +
          +
          All Implemented Interfaces:
          +
          ChinesePostman
          +
          +
          +
          Direct Known Subclasses:
          +
          ChinesePostmanImpl
          +
          +
          +
          public abstract class ChinesePostmanAbstract
          +extends Object
          +implements ChinesePostman
          +
          Abstract class for computing a shortest edge visitor circle in a graph. + +

          + The class implements the interface by solving the problem on the index graph and then maps the results back to the + original graph. The implementation for the index graph is abstract and left to the subclasses.

          +
          +
          Author:
          +
          Barak Ugav
          +
          +
        • +
        +
        +
        + +
        +
        +
          +
        • + +
          +
            +
          • + + +

            Constructor Detail

            + + + +
              +
            • +

              ChinesePostmanAbstract

              +
              public ChinesePostmanAbstract()
              +
              Default constructor.
              +
            • +
            +
          • +
          +
          + +
          +
            +
          • + + +

            Method Detail

            + + + +
              +
            • +

              computeShortestEdgeVisitorCircleIfExist

              +
              public <V,​E> Optional<Path<V,​E>> computeShortestEdgeVisitorCircleIfExist​(Graph<V,​E> g,
              +                                                                                     WeightFunction<E> w)
              +
              Description copied from interface: ChinesePostman
              +
              Compute the shortest circuit that visits all edges in the graph at least once, if it exist. + +

              + If g is IntGraph, the returned object is an optional of IPath. If g is + IntGraph, prefer to pass IWeightFunction for best performance.

              +
              +
              Specified by:
              +
              computeShortestEdgeVisitorCircleIfExist in interface ChinesePostman
              +
              Type Parameters:
              +
              V - the vertices type
              +
              E - the edges type
              +
              Parameters:
              +
              g - a graph
              +
              w - an edge weight function
              +
              Returns:
              +
              an optional of closed path that visits all edges in the graph, with minimum weight sum with respect + to the given edge weight function, or empty if no solution exists (the graph is not strongly + connected)
              +
              +
            • +
            +
          • +
          +
          +
        • +
        +
        +
        +
        + +
        + +

        Copyright © 2024. All rights reserved.

        +
        + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/ChinesePostmanImpl.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/ChinesePostmanImpl.html new file mode 100644 index 0000000000..1c2f4ff787 --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/ChinesePostmanImpl.html @@ -0,0 +1,326 @@ + + + + + +ChinesePostmanImpl (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
        + +
        + +
        +
        + +

        Class ChinesePostmanImpl

        +
        +
        + +
        +
          +
        • +
          +
          All Implemented Interfaces:
          +
          ChinesePostman
          +
          +
          +
          public class ChinesePostmanImpl
          +extends ChinesePostmanAbstract
          +
          An algorithm for the chinese postman problem using minimum weighted perfect matching and Eulerian tour. + +

          + The chinese postman problem is to find a closed path that visits all edges in the graph at least once, with minimum + weight sum with respect to a given edge weight function. The algorithm uses the following steps: +

            +
          1. Find all vertices with odd degree. If all vertices have even degree, an Eulerian tour should exists (if the graph + is connected).
          2. +
          3. Create a complete graph of the odd vertices, with edges weighted by the shortest paths between each pair.
          4. +
          5. Compute a minimum weighted perfect matching between the odd vertices.
          6. +
          7. Create a graph with the original vertices and edges, and for each edge resulted from the perfect matching, add an + edge between the two vertices in the original graph.
          8. +
          9. Compute an Eulerian tour in the new graph.
          10. +
          11. Construct the full result path by replacing each artificial edge connecting two odd vertices with the shortest + path between them.
          12. +
          + +

          + The running time and space are dominated by the shortest path all pairs and minimum perfect matching algorithms. + Other than that, the algorithm use linear time and space.

          +
          +
          Author:
          +
          Barak Ugav
          +
          +
        • +
        +
        +
        + +
        +
        +
          +
        • + +
          +
            +
          • + + +

            Constructor Detail

            + + + +
              +
            • +

              ChinesePostmanImpl

              +
              public ChinesePostmanImpl()
              +
              Create a new instance of the Chinese postman algorithm. + +

              + Please prefer using ChinesePostman.newInstance() to get a default implementation for the + ChinesePostman interface.

              +
            • +
            +
          • +
          +
          +
        • +
        +
        +
        +
        + +
        + +

        Copyright © 2024. All rights reserved.

        +
        + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/CyclesEnumerator.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/CyclesEnumerator.Builder.html index 81b3965e09..7d774e8e9f 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cycle/CyclesEnumerator.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/CyclesEnumerator.Builder.html @@ -2,10 +2,10 @@ - + CyclesEnumerator.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/CyclesEnumerator.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/CyclesEnumerator.html index 4105860590..adc9a96519 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cycle/CyclesEnumerator.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/CyclesEnumerator.html @@ -2,10 +2,10 @@ - + CyclesEnumerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -28,8 +28,8 @@ catch(err) { } //--> -var data = {"i0":18,"i1":1,"i2":6,"i3":1}; -var tabs = {65535:["t0","All Methods"],1:["t1","Static Methods"],2:["t2","Instance Methods"],4:["t3","Abstract Methods"],16:["t5","Default Methods"]}; +var data = {"i0":1,"i1":6,"i2":1}; +var tabs = {65535:["t0","All Methods"],1:["t1","Static Methods"],2:["t2","Instance Methods"],4:["t3","Abstract Methods"]}; var altColor = "altColor"; var rowColor = "rowColor"; var tableTab = "tableTab"; @@ -125,6 +125,10 @@

        Interface CyclesEnumerator<
        • +
          +
          All Known Implementing Classes:
          +
          CyclesEnumeratorAbstract, CyclesEnumeratorJohnson, CyclesEnumeratorTarjan
          +

          public interface CyclesEnumerator
          An algorithm that enumerate all cycles in a graph. @@ -180,34 +184,27 @@

          Nested Class Summary

          Method Summary

          - + - - - - - - + - +
          All Methods Static Methods Instance Methods Abstract Methods Default Methods All Methods Static Methods Instance Methods Abstract Methods 
          Modifier and Type Method Description
          default <V,​E>
          List<Path<V,​E>>
          allCycles​(Graph<V,​E> g) -
          Find all cycles in the given graph.
          -
          static CyclesEnumerator.Builder builder()
          Create a new cycles enumeration algorithm builder.
          <V,​E>
          Iterator<Path<V,​E>>
          cyclesIter​(Graph<V,​E> g)
          Iterate over all cycles in the given graph.
          static CyclesEnumerator newInstance() @@ -253,32 +250,6 @@

          cyclesIter

          - - - -
            -
          • -

            allCycles

            -
            default <V,​E> List<Path<V,​E>> allCycles​(Graph<V,​E> g)
            -
            Find all cycles in the given graph. - -

            - The number of cycles may be large, and its recommend to use cyclesIter(Graph) to avoid storing all the - cycles in memory at once. - -

            - If g is IntGraph, the returned list will contain IPath objects.

            -
            -
            Type Parameters:
            -
            V - the vertices type
            -
            E - the edges type
            -
            Parameters:
            -
            g - a graph
            -
            Returns:
            -
            a list of all cycles in the graph
            -
            -
          • -
          diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/CyclesEnumeratorAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/CyclesEnumeratorAbstract.html new file mode 100644 index 0000000000..bdccc4bedf --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/CyclesEnumeratorAbstract.html @@ -0,0 +1,366 @@ + + + + + +CyclesEnumeratorAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
          + +
          + +
          +
          + +

          Class CyclesEnumeratorAbstract

          +
          +
          + +
          +
            +
          • +
            +
            All Implemented Interfaces:
            +
            CyclesEnumerator
            +
            +
            +
            Direct Known Subclasses:
            +
            CyclesEnumeratorJohnson, CyclesEnumeratorTarjan
            +
            +
            +
            public abstract class CyclesEnumeratorAbstract
            +extends Object
            +implements CyclesEnumerator
            +
            Abstract class for enumerating all simple cycles in a graph. + +

            + The class implements the interface by solving the problem on the index graph and then maps the results back to the + original graph. The implementation for the index graph is abstract and left to the subclasses.

            +
            +
            Author:
            +
            Barak Ugav
            +
            +
          • +
          +
          +
          + +
          +
          +
            +
          • + +
            +
              +
            • + + +

              Constructor Detail

              + + + +
                +
              • +

                CyclesEnumeratorAbstract

                +
                public CyclesEnumeratorAbstract()
                +
                Default constructor.
                +
              • +
              +
            • +
            +
            + +
            +
              +
            • + + +

              Method Detail

              + + + +
                +
              • +

                cyclesIter

                +
                public <V,​E> Iterator<Path<V,​E>> cyclesIter​(Graph<V,​E> g)
                +
                Description copied from interface: CyclesEnumerator
                +
                Iterate over all cycles in the given graph. + +

                + If g is IntGraph, the returned iterator will iterate over IPath objects.

                +
                +
                Specified by:
                +
                cyclesIter in interface CyclesEnumerator
                +
                Type Parameters:
                +
                V - the vertices type
                +
                E - the edges type
                +
                Parameters:
                +
                g - a graph
                +
                Returns:
                +
                an iterator that iteration over all cycles in the graph
                +
                +
              • +
              +
            • +
            +
            +
          • +
          +
          +
          +
          + + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/CyclesEnumeratorJohnson.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/CyclesEnumeratorJohnson.html new file mode 100644 index 0000000000..869620bb3c --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/CyclesEnumeratorJohnson.html @@ -0,0 +1,324 @@ + + + + + +CyclesEnumeratorJohnson (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
          + +
          + +
          +
          + +

          Class CyclesEnumeratorJohnson

          +
          +
          + +
          +
            +
          • +
            +
            All Implemented Interfaces:
            +
            CyclesEnumerator
            +
            +
            +
            public class CyclesEnumeratorJohnson
            +extends CyclesEnumeratorAbstract
            +
            Johnson's algorithm for finding all cycles in a directed graph. + +

            + The algorithm runs in \(O((n+m)(c+1))\) time and \(O(n + m)\) space where \(c\) is the number of simple cycles in the + graph. + +

            + Based on the paper 'finding all the elementary circuits of a directed graph' by Donald b. Johnson.

            +
            +
            Author:
            +
            Barak Ugav
            +
            +
          • +
          +
          +
          + +
          +
          +
            +
          • + +
            +
              +
            • + + +

              Constructor Detail

              + + + +
                +
              • +

                CyclesEnumeratorJohnson

                +
                public CyclesEnumeratorJohnson()
                +
                Create a new cycles finder algorithm object. + +

                + Please prefer using CyclesEnumerator.newInstance() to get a default implementation for the + CyclesEnumerator interface.

                +
              • +
              +
            • +
            +
            +
          • +
          +
          +
          +
          + +
          + +

          Copyright © 2024. All rights reserved.

          +
          + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/CyclesEnumeratorTarjan.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/CyclesEnumeratorTarjan.html new file mode 100644 index 0000000000..1ebf75c9bb --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/CyclesEnumeratorTarjan.html @@ -0,0 +1,324 @@ + + + + + +CyclesEnumeratorTarjan (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
          + +
          + +
          +
          + +

          Class CyclesEnumeratorTarjan

          +
          +
          + +
          +
            +
          • +
            +
            All Implemented Interfaces:
            +
            CyclesEnumerator
            +
            +
            +
            public class CyclesEnumeratorTarjan
            +extends CyclesEnumeratorAbstract
            +
            Tarjan's algorithm for enumeration all cycles in a directed graph. + +

            + The algorithm runs in \(O((n+m)(c+1))\) time and \(O(n)\) space where \(c\) is the number of simple cycles in the + graph. + +

            + Based on the paper 'Enumeration of the elementary circuits of a directed graph' by Robert Tarjan.

            +
            +
            Author:
            +
            Barak Ugav
            +
            +
          • +
          +
          +
          + +
          +
          +
            +
          • + +
            +
              +
            • + + +

              Constructor Detail

              + + + +
                +
              • +

                CyclesEnumeratorTarjan

                +
                public CyclesEnumeratorTarjan()
                +
                Create a new cycles enumeration algorithm object. + +

                + Please prefer using CyclesEnumerator.newInstance() to get a default implementation for the + CyclesEnumerator interface.

                +
              • +
              +
            • +
            +
            +
          • +
          +
          +
          +
          + +
          + +

          Copyright © 2024. All rights reserved.

          +
          + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/MinimumMeanCycle.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/MinimumMeanCycle.Builder.html index 4cdd69a6d1..bfb95059db 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cycle/MinimumMeanCycle.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/MinimumMeanCycle.Builder.html @@ -2,10 +2,10 @@ - + MinimumMeanCycle.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/MinimumMeanCycle.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/MinimumMeanCycle.html index 82c15002d7..8fffea36f7 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cycle/MinimumMeanCycle.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/MinimumMeanCycle.html @@ -2,10 +2,10 @@ - + MinimumMeanCycle (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -125,6 +125,10 @@

          Interface MinimumMeanCycle<
          • +
            +
            All Known Implementing Classes:
            +
            MinimumMeanCycleAbstract, MinimumMeanCycleDasdanGupta, MinimumMeanCycleHoward
            +

            public interface MinimumMeanCycle
            Algorithm that find the cycle with the minimum mean weight. diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/MinimumMeanCycleAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/MinimumMeanCycleAbstract.html new file mode 100644 index 0000000000..90f6aa5d8f --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/MinimumMeanCycleAbstract.html @@ -0,0 +1,370 @@ + + + + + +MinimumMeanCycleAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
            + +
            + +
            +
            + +

            Class MinimumMeanCycleAbstract

            +
            +
            + +
            +
              +
            • +
              +
              All Implemented Interfaces:
              +
              MinimumMeanCycle
              +
              +
              +
              Direct Known Subclasses:
              +
              MinimumMeanCycleDasdanGupta, MinimumMeanCycleHoward
              +
              +
              +
              public abstract class MinimumMeanCycleAbstract
              +extends Object
              +implements MinimumMeanCycle
              +
              Abstract class for computing the cycle with minimum mean weight in a graph. + +

              + The class implements the interface by solving the problem on the index graph and then maps the results back to the + original graph. The implementation for the index graph is abstract and left to the subclasses.

              +
              +
              Author:
              +
              Barak Ugav
              +
              +
            • +
            +
            +
            + +
            +
            +
              +
            • + +
              +
                +
              • + + +

                Constructor Detail

                + + + +
                  +
                • +

                  MinimumMeanCycleAbstract

                  +
                  public MinimumMeanCycleAbstract()
                  +
                  Default constructor.
                  +
                • +
                +
              • +
              +
              + +
              +
                +
              • + + +

                Method Detail

                + + + +
                  +
                • +

                  computeMinimumMeanCycle

                  +
                  public <V,​E> Path<V,​E> computeMinimumMeanCycle​(Graph<V,​E> g,
                  +                                                           WeightFunction<E> w)
                  +
                  Description copied from interface: MinimumMeanCycle
                  +
                  Compute the minimum mean cycle in a graph. + +

                  + If g is an IntGraph, a IPath object will be returned. In that case, its better to pass a + IWeightFunction as w to avoid boxing/unboxing.

                  +
                  +
                  Specified by:
                  +
                  computeMinimumMeanCycle in interface MinimumMeanCycle
                  +
                  Type Parameters:
                  +
                  V - the vertices type
                  +
                  E - the edges type
                  +
                  Parameters:
                  +
                  g - a graph
                  +
                  w - an edge weight function
                  +
                  Returns:
                  +
                  the cycle with the minimum mean weight in the graph, or null if no cycles were found
                  +
                  +
                • +
                +
              • +
              +
              +
            • +
            +
            +
            +
            + + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/MinimumMeanCycleDasdanGupta.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/MinimumMeanCycleDasdanGupta.html new file mode 100644 index 0000000000..93f61c8162 --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/MinimumMeanCycleDasdanGupta.html @@ -0,0 +1,325 @@ + + + + + +MinimumMeanCycleDasdanGupta (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
            + +
            + +
            +
            + +

            Class MinimumMeanCycleDasdanGupta

            +
            +
            + +
            +
              +
            • +
              +
              All Implemented Interfaces:
              +
              MinimumMeanCycle
              +
              +
              +
              public class MinimumMeanCycleDasdanGupta
              +extends MinimumMeanCycleAbstract
              +
              Dasdan and Gupta algorithm for minimum mean cycle. + +

              + The algorithm runs in \(O(n m)\) time and uses \(O(n^2)\) space. Although this algorithm have a strong polynomial + bound, MinimumMeanCycleHoward is usually faster. + +

              + Based on 'Faster Maximum and Minimum Mean Cycle Algorithms for System Performance Analysis' by Ali Dasdan, Rajesh K. + Gupta (1997).

              +
              +
              Author:
              +
              Barak Ugav
              +
              +
            • +
            +
            +
            + +
            +
            +
              +
            • + +
              +
                +
              • + + +

                Constructor Detail

                + + + +
                  +
                • +

                  MinimumMeanCycleDasdanGupta

                  +
                  public MinimumMeanCycleDasdanGupta()
                  +
                  Create a new minimum mean cycle algorithm. + +

                  + Please prefer using MinimumMeanCycle.newInstance() to get a default implementation for the + MinimumMeanCycle interface.

                  +
                • +
                +
              • +
              +
              +
            • +
            +
            +
            +
            + +
            + +

            Copyright © 2024. All rights reserved.

            +
            + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/MinimumMeanCycleHoward.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/MinimumMeanCycleHoward.html new file mode 100644 index 0000000000..ae3aed30b3 --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/MinimumMeanCycleHoward.html @@ -0,0 +1,328 @@ + + + + + +MinimumMeanCycleHoward (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
            + +
            + +
            +
            + +

            Class MinimumMeanCycleHoward

            +
            +
            + +
            +
              +
            • +
              +
              All Implemented Interfaces:
              +
              MinimumMeanCycle
              +
              +
              +
              public class MinimumMeanCycleHoward
              +extends MinimumMeanCycleAbstract
              +
              Howard's algorithm for minimum mean cycle detection. + +

              + The algorithm runs in \(O(m N)\) and uses linear space, where \(N\) is product of the out-degrees of all the vertices + in the graph. Although this bound is not polynomial, this algorithm perform well in practice. There are other bounds + on the time such as \(O(n m \alpha)\) where \(\alpha\) is the number of simple cycles in the graph, or \(O(n^2 m + (MaxW-MinW)/\epsilon)\) where \(MaxW,MinW\) are the maximum and minimum edge weight in the graph, and \(\epsilon\) is + the precision of the algorithm. + +

              + Based on 'Efficient Algorithms for Optimal Cycle Mean and Optimum Cost to Time Ratio Problems' by Ali Dasdan, Sandy + S. Irani, Rajesh K. Gupta (1999).

              +
              +
              Author:
              +
              Barak Ugav
              +
              +
            • +
            +
            +
            + +
            +
            +
              +
            • + +
              +
                +
              • + + +

                Constructor Detail

                + + + +
                  +
                • +

                  MinimumMeanCycleHoward

                  +
                  public MinimumMeanCycleHoward()
                  +
                  Create a new minimum mean cycle algorithm. + +

                  + Please prefer using MinimumMeanCycle.newInstance() to get a default implementation for the + MinimumMeanCycle interface.

                  +
                • +
                +
              • +
              +
              +
            • +
            +
            +
            +
            + +
            + +

            Copyright © 2024. All rights reserved.

            +
            + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/ChinesePostman.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/ChinesePostman.html index 43ee55d849..75c3aac879 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/ChinesePostman.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/ChinesePostman.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.cycle.ChinesePostman (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -126,6 +126,30 @@

            Uses of ChinesePostman in com.jgalgo.alg.cycle

            + + + + + + + + + + + + + + + + + + +
            Classes in com.jgalgo.alg.cycle that implement ChinesePostman 
            Modifier and TypeClassDescription
            class ChinesePostmanAbstract +
            Abstract class for computing a shortest edge visitor circle in a graph.
            +
            class ChinesePostmanImpl +
            An algorithm for the chinese postman problem using minimum weighted perfect matching and Eulerian tour.
            +
            + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/ChinesePostmanAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/ChinesePostmanAbstract.html new file mode 100644 index 0000000000..1d8fea4e6e --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/ChinesePostmanAbstract.html @@ -0,0 +1,201 @@ + + + + + +Uses of Class com.jgalgo.alg.cycle.ChinesePostmanAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
            + +
            +
            +
            +

            Uses of Class
            com.jgalgo.alg.cycle.ChinesePostmanAbstract

            +
            +
            +
              +
            • +
            Methods in com.jgalgo.alg.cycle that return ChinesePostman 
            Modifier and Type
            + + + + + + + + + + + +
            Packages that use ChinesePostmanAbstract 
            PackageDescription
            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.
            +
            +
          • +
          • + +
          • +
          +
          + + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/ChinesePostmanImpl.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/ChinesePostmanImpl.html new file mode 100644 index 0000000000..380407a41d --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/ChinesePostmanImpl.html @@ -0,0 +1,152 @@ + + + + + +Uses of Class com.jgalgo.alg.cycle.ChinesePostmanImpl (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
          + +
          +
          +
          +

          Uses of Class
          com.jgalgo.alg.cycle.ChinesePostmanImpl

          +
          +
          No usage of com.jgalgo.alg.cycle.ChinesePostmanImpl
          +
          + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/CyclesEnumerator.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/CyclesEnumerator.Builder.html index 588127824f..a90485c791 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/CyclesEnumerator.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/CyclesEnumerator.Builder.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.cycle.CyclesEnumerator.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/CyclesEnumerator.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/CyclesEnumerator.html index ec91ccaad4..aed0411588 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/CyclesEnumerator.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/CyclesEnumerator.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.cycle.CyclesEnumerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -126,6 +126,37 @@

          CyclesEnumerator in com.jgalgo.alg.cycle

          + + + + + + + + + + + + + + + + + + + + + + + +
          Classes in com.jgalgo.alg.cycle that implement CyclesEnumerator 
          Modifier and TypeClassDescription
          class CyclesEnumeratorAbstract +
          Abstract class for enumerating all simple cycles in a graph.
          +
          class CyclesEnumeratorJohnson +
          Johnson's algorithm for finding all cycles in a directed graph.
          +
          class CyclesEnumeratorTarjan +
          Tarjan's algorithm for enumeration all cycles in a directed graph.
          +
          + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/CyclesEnumeratorAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/CyclesEnumeratorAbstract.html new file mode 100644 index 0000000000..18c6e6e18e --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/CyclesEnumeratorAbstract.html @@ -0,0 +1,208 @@ + + + + + +Uses of Class com.jgalgo.alg.cycle.CyclesEnumeratorAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
          + +
          +
          +
          +

          Uses of Class
          com.jgalgo.alg.cycle.CyclesEnumeratorAbstract

          +
          +
          +
            +
          • +
          Methods in com.jgalgo.alg.cycle that return CyclesEnumerator 
          Modifier and Type
          + + + + + + + + + + + +
          Packages that use CyclesEnumeratorAbstract 
          PackageDescription
          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.
          +
          + +
        • + +
        • + + + + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/CyclesEnumeratorJohnson.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/CyclesEnumeratorJohnson.html new file mode 100644 index 0000000000..1e6a44d42d --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/CyclesEnumeratorJohnson.html @@ -0,0 +1,152 @@ + + + + + +Uses of Class com.jgalgo.alg.cycle.CyclesEnumeratorJohnson (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
          + +
          +
          +
          +

          Uses of Class
          com.jgalgo.alg.cycle.CyclesEnumeratorJohnson

          +
          +
          No usage of com.jgalgo.alg.cycle.CyclesEnumeratorJohnson
          +
          + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/CyclesEnumeratorTarjan.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/CyclesEnumeratorTarjan.html new file mode 100644 index 0000000000..f716253ac2 --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/CyclesEnumeratorTarjan.html @@ -0,0 +1,152 @@ + + + + + +Uses of Class com.jgalgo.alg.cycle.CyclesEnumeratorTarjan (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
          + +
          +
          +
          +

          Uses of Class
          com.jgalgo.alg.cycle.CyclesEnumeratorTarjan

          +
          +
          No usage of com.jgalgo.alg.cycle.CyclesEnumeratorTarjan
          +
          + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/MinimumMeanCycle.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/MinimumMeanCycle.Builder.html index dfe0ce286a..3d15e16e1e 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/MinimumMeanCycle.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/MinimumMeanCycle.Builder.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.cycle.MinimumMeanCycle.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/MinimumMeanCycle.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/MinimumMeanCycle.html index e1980b4d56..fc4500dd1d 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/MinimumMeanCycle.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/MinimumMeanCycle.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.cycle.MinimumMeanCycle (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -126,6 +126,37 @@

          MinimumMeanCycle in com.jgalgo.alg.cycle

          + + + + + + + + + + + + + + + + + + + + + + + +
          Classes in com.jgalgo.alg.cycle that implement MinimumMeanCycle 
          Modifier and TypeClassDescription
          class MinimumMeanCycleAbstract +
          Abstract class for computing the cycle with minimum mean weight in a graph.
          +
          class MinimumMeanCycleDasdanGupta +
          Dasdan and Gupta algorithm for minimum mean cycle.
          +
          class MinimumMeanCycleHoward +
          Howard's algorithm for minimum mean cycle detection.
          +
          + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/MinimumMeanCycleAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/MinimumMeanCycleAbstract.html new file mode 100644 index 0000000000..f0d61c2f15 --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/MinimumMeanCycleAbstract.html @@ -0,0 +1,208 @@ + + + + + +Uses of Class com.jgalgo.alg.cycle.MinimumMeanCycleAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
          + +
          +
          +
          +

          Uses of Class
          com.jgalgo.alg.cycle.MinimumMeanCycleAbstract

          +
          +
          +
            +
          • +
          Methods in com.jgalgo.alg.cycle that return MinimumMeanCycle 
          Modifier and Type
          + + + + + + + + + + + +
          Packages that use MinimumMeanCycleAbstract 
          PackageDescription
          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.
          +
          + +
        • + +
        • + + + + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/MinimumMeanCycleDasdanGupta.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/MinimumMeanCycleDasdanGupta.html new file mode 100644 index 0000000000..1a59bfa1f8 --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/MinimumMeanCycleDasdanGupta.html @@ -0,0 +1,152 @@ + + + + + +Uses of Class com.jgalgo.alg.cycle.MinimumMeanCycleDasdanGupta (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
          + +
          +
          +
          +

          Uses of Class
          com.jgalgo.alg.cycle.MinimumMeanCycleDasdanGupta

          +
          +
          No usage of com.jgalgo.alg.cycle.MinimumMeanCycleDasdanGupta
          +
          + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/MinimumMeanCycleHoward.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/MinimumMeanCycleHoward.html new file mode 100644 index 0000000000..d341aea2fc --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/class-use/MinimumMeanCycleHoward.html @@ -0,0 +1,152 @@ + + + + + +Uses of Class com.jgalgo.alg.cycle.MinimumMeanCycleHoward (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
          + +
          +
          +
          +

          Uses of Class
          com.jgalgo.alg.cycle.MinimumMeanCycleHoward

          +
          +
          No usage of com.jgalgo.alg.cycle.MinimumMeanCycleHoward
          +
          + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/package-summary.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/package-summary.html index 09fce35269..24f1ae9fd6 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cycle/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.cycle (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -147,6 +147,65 @@

          Package com.jgalgo.alg.cycle

        • +
        • + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
          Class Summary 
          ClassDescription
          ChinesePostmanAbstract +
          Abstract class for computing a shortest edge visitor circle in a graph.
          +
          ChinesePostmanImpl +
          An algorithm for the chinese postman problem using minimum weighted perfect matching and Eulerian tour.
          +
          CyclesEnumeratorAbstract +
          Abstract class for enumerating all simple cycles in a graph.
          +
          CyclesEnumeratorJohnson +
          Johnson's algorithm for finding all cycles in a directed graph.
          +
          CyclesEnumeratorTarjan +
          Tarjan's algorithm for enumeration all cycles in a directed graph.
          +
          MinimumMeanCycleAbstract +
          Abstract class for computing the cycle with minimum mean weight in a graph.
          +
          MinimumMeanCycleDasdanGupta +
          Dasdan and Gupta algorithm for minimum mean cycle.
          +
          MinimumMeanCycleHoward +
          Howard's algorithm for minimum mean cycle detection.
          +
          +
        diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/package-tree.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/package-tree.html index ab8dbe17ec..e2ab38ee2f 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cycle/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.cycle Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -104,6 +104,32 @@

        Hierarchy For Package com.jgalgo.alg.cycle

        +

        Class Hierarchy

        + +
        +

        Interface Hierarchy

        • com.jgalgo.alg.AlgorithmBuilderBase diff --git a/0.4.1-snapshot/com/jgalgo/alg/cycle/package-use.html b/0.4.1-snapshot/com/jgalgo/alg/cycle/package-use.html index 7ff6b2c613..623f63da6b 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/cycle/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/alg/cycle/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.alg.cycle (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -135,17 +135,29 @@

          Uses of Package

        ChinesePostmanAbstract +
        Abstract class for computing a shortest edge visitor circle in a graph.
        +
        CyclesEnumerator
        An algorithm that enumerate all cycles in a graph.
        CyclesEnumerator.Builder
        A builder for CyclesEnumerator objects.
        CyclesEnumeratorAbstract +
        Abstract class for enumerating all simple cycles in a graph.
        +
        MinimumMeanCycle @@ -158,6 +170,12 @@

        Uses of PackageA builder for MinimumMeanCycle objects.

        MinimumMeanCycleAbstract +
        Abstract class for computing the cycle with minimum mean weight in a graph.
        +
      • diff --git a/0.4.1-snapshot/com/jgalgo/alg/dag/TopologicalOrderAlgo.IResult.html b/0.4.1-snapshot/com/jgalgo/alg/dag/TopologicalOrderAlgo.IResult.html index db661ac5b0..6702d51da7 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/dag/TopologicalOrderAlgo.IResult.html +++ b/0.4.1-snapshot/com/jgalgo/alg/dag/TopologicalOrderAlgo.IResult.html @@ -2,10 +2,10 @@ - + TopologicalOrderAlgo.IResult (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/dag/TopologicalOrderAlgo.Result.html b/0.4.1-snapshot/com/jgalgo/alg/dag/TopologicalOrderAlgo.Result.html index 9a4848f41e..63ea648a20 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/dag/TopologicalOrderAlgo.Result.html +++ b/0.4.1-snapshot/com/jgalgo/alg/dag/TopologicalOrderAlgo.Result.html @@ -2,10 +2,10 @@ - + TopologicalOrderAlgo.Result (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/dag/TopologicalOrderAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/dag/TopologicalOrderAlgo.html index 96d995c7d0..cbc987e55e 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/dag/TopologicalOrderAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/dag/TopologicalOrderAlgo.html @@ -2,10 +2,10 @@ - + TopologicalOrderAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -28,8 +28,8 @@ catch(err) { } //--> -var data = {"i0":6,"i1":1}; -var tabs = {65535:["t0","All Methods"],1:["t1","Static Methods"],2:["t2","Instance Methods"],4:["t3","Abstract Methods"]}; +var data = {"i0":18,"i1":6,"i2":1}; +var tabs = {65535:["t0","All Methods"],1:["t1","Static Methods"],2:["t2","Instance Methods"],4:["t3","Abstract Methods"],16:["t5","Default Methods"]}; var altColor = "altColor"; var rowColor = "rowColor"; var tableTab = "tableTab"; @@ -125,6 +125,10 @@

        Interface TopologicalOr
        • +
          +
          All Known Implementing Classes:
          +
          TopologicalOrderAlgoAbstract, TopologicalOrderAlgoImpl
          +

          public interface TopologicalOrderAlgo
          Algorithm that calculate a topological order of graph vertices. @@ -191,20 +195,27 @@

          Nested Class Summary

          Method Summary

          - + - + + + + + + +
          All Methods Static Methods Instance Methods Abstract Methods All Methods Static Methods Instance Methods Abstract Methods Default Methods 
          Modifier and Type Method Description
          <V,​E>
          TopologicalOrderAlgo.Result<V,​E>
          default <V,​E>
          TopologicalOrderAlgo.Result<V,​E>
          computeTopologicalSorting​(Graph<V,​E> g) -
          Compute the topological order of a DAG vertices.
          +
          Compute the topological order of the vertices in a DAG graph.
          <V,​E>
          Optional<TopologicalOrderAlgo.Result<V,​E>>
          computeTopologicalSortingIfExist​(Graph<V,​E> g) +
          Compute the topological order of the vertices, if the graph is DAG.
          +
          static TopologicalOrderAlgo newInstance() @@ -234,8 +245,8 @@

          Method Detail

          + + + +
            +
          • +

            computeTopologicalSortingIfExist

            +
            <V,​E> Optional<TopologicalOrderAlgo.Result<V,​E>> computeTopologicalSortingIfExist​(Graph<V,​E> g)
            +
            Compute the topological order of the vertices, if the graph is DAG. + +

            + If g is IntGraph, the returned optional will contain is TopologicalOrderAlgo.IResult.

            +
            +
            Type Parameters:
            +
            V - the vertices type
            +
            E - the edges type
            +
            Parameters:
            +
            g - a directed graph
            +
            Returns:
            +
            an optional of a result object containing the computed order, or an empty optional if the graph is + not DAG
            +
            +
          • +
          diff --git a/0.4.1-snapshot/com/jgalgo/alg/dag/TopologicalOrderAlgoAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/dag/TopologicalOrderAlgoAbstract.html new file mode 100644 index 0000000000..fb70aeb24c --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/dag/TopologicalOrderAlgoAbstract.html @@ -0,0 +1,374 @@ + + + + + +TopologicalOrderAlgoAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
          + +
          + +
          +
          + +

          Class TopologicalOrderAlgoAbstract

          +
          +
          + +
          +
            +
          • +
            +
            All Implemented Interfaces:
            +
            TopologicalOrderAlgo
            +
            +
            +
            Direct Known Subclasses:
            +
            TopologicalOrderAlgoImpl
            +
            +
            +
            public abstract class TopologicalOrderAlgoAbstract
            +extends Object
            +implements TopologicalOrderAlgo
            +
            Abstract class for computing a topological order in a DAG graph. + +

            + The class implements the interface by solving the problem on the index graph and then maps the results back to the + original graph. The implementation for the index graph is abstract and left to the subclasses.

            +
            +
            Author:
            +
            Barak Ugav
            +
            +
          • +
          +
          +
          + +
          +
          +
            +
          • + +
            +
              +
            • + + +

              Constructor Detail

              + + + +
                +
              • +

                TopologicalOrderAlgoAbstract

                +
                public TopologicalOrderAlgoAbstract()
                +
                Default constructor.
                +
              • +
              +
            • +
            +
            + +
            + +
            +
          • +
          +
          +
          +
          + + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/dag/TopologicalOrderAlgoImpl.html b/0.4.1-snapshot/com/jgalgo/alg/dag/TopologicalOrderAlgoImpl.html new file mode 100644 index 0000000000..7478c31b57 --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/dag/TopologicalOrderAlgoImpl.html @@ -0,0 +1,334 @@ + + + + + +TopologicalOrderAlgoImpl (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
          + +
          + +
          +
          + +

          Class TopologicalOrderAlgoImpl

          +
          +
          + +
          +
            +
          • +
            +
            All Implemented Interfaces:
            +
            TopologicalOrderAlgo
            +
            +
            +
            public class TopologicalOrderAlgoImpl
            +extends TopologicalOrderAlgoAbstract
            +
            A simple algorithm that compute a topological order in a DAG graph. + +

            + The algorithm perform iterations while maintaining the in-degree of each vertex. At each iteration, a vertex \(u\) + with in-degree zero is added as the next vertex in the result topological order, and the vertex is 'removed' from the + graph conceptually, practically the algorithm decrease the in-degree of each vertex reachable by one of \(u\)'s out + going edges. If there is no vertex with zero in-degree before all vertices were added to the topological sort, there + is a cycle and no topological order exists. + +

            + The algorithm is linear in both space and running time.

            +
            +
            Author:
            +
            Barak Ugav
            +
            +
          • +
          +
          +
          + +
          +
          + +
          +
          +
          + +
          + +

          Copyright © 2024. All rights reserved.

          +
          + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/dag/class-use/TopologicalOrderAlgo.IResult.html b/0.4.1-snapshot/com/jgalgo/alg/dag/class-use/TopologicalOrderAlgo.IResult.html index 0ca9611898..af98130bd8 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/dag/class-use/TopologicalOrderAlgo.IResult.html +++ b/0.4.1-snapshot/com/jgalgo/alg/dag/class-use/TopologicalOrderAlgo.IResult.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.dag.TopologicalOrderAlgo.IResult (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/dag/class-use/TopologicalOrderAlgo.Result.html b/0.4.1-snapshot/com/jgalgo/alg/dag/class-use/TopologicalOrderAlgo.Result.html index babc619967..55194a7314 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/dag/class-use/TopologicalOrderAlgo.Result.html +++ b/0.4.1-snapshot/com/jgalgo/alg/dag/class-use/TopologicalOrderAlgo.Result.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.dag.TopologicalOrderAlgo.Result (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -150,14 +150,36 @@

          Uses of -

          <V,​E>
          TopologicalOrderAlgo.Result<V,​E>
          default <V,​E>
          TopologicalOrderAlgo.Result<V,​E>
          TopologicalOrderAlgo.computeTopologicalSorting​(Graph<V,​E> g) -
          Compute the topological order of a DAG vertices.
          +
          Compute the topological order of the vertices in a DAG graph.
          + + + + + + + + + + + + + + + + + + + +
          Methods in com.jgalgo.alg.dag that return types with arguments of type TopologicalOrderAlgo.Result 
          Modifier and TypeMethodDescription
          <V,​E>
          Optional<TopologicalOrderAlgo.Result<V,​E>>
          TopologicalOrderAlgo.computeTopologicalSortingIfExist​(Graph<V,​E> g) +
          Compute the topological order of the vertices, if the graph is DAG.
          +
          <V,​E>
          Optional<TopologicalOrderAlgo.Result<V,​E>>
          TopologicalOrderAlgoAbstract.computeTopologicalSortingIfExist​(Graph<V,​E> g) 

    diff --git a/0.4.1-snapshot/com/jgalgo/alg/dag/class-use/TopologicalOrderAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/dag/class-use/TopologicalOrderAlgo.html index 8e39d11e24..172870da05 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/dag/class-use/TopologicalOrderAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/dag/class-use/TopologicalOrderAlgo.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.dag.TopologicalOrderAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -125,6 +125,30 @@

    TopologicalOrderAlgo in com.jgalgo.alg.dag

    + + + + + + + + + + + + + + + + + + +
    Classes in com.jgalgo.alg.dag that implement TopologicalOrderAlgo 
    Modifier and TypeClassDescription
    class TopologicalOrderAlgoAbstract +
    Abstract class for computing a topological order in a DAG graph.
    +
    class TopologicalOrderAlgoImpl +
    A simple algorithm that compute a topological order in a DAG graph.
    +
    + diff --git a/0.4.1-snapshot/com/jgalgo/alg/dag/class-use/TopologicalOrderAlgoAbstract.html b/0.4.1-snapshot/com/jgalgo/alg/dag/class-use/TopologicalOrderAlgoAbstract.html new file mode 100644 index 0000000000..76b9e1b95b --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/dag/class-use/TopologicalOrderAlgoAbstract.html @@ -0,0 +1,200 @@ + + + + + +Uses of Class com.jgalgo.alg.dag.TopologicalOrderAlgoAbstract (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
    + +
    +
    +
    +

    Uses of Class
    com.jgalgo.alg.dag.TopologicalOrderAlgoAbstract

    +
    +
    +
      +
    • +
    Methods in com.jgalgo.alg.dag that return TopologicalOrderAlgo 
    Modifier and Type
    + + + + + + + + + + + +
    Packages that use TopologicalOrderAlgoAbstract 
    PackageDescription
    com.jgalgo.alg.dag +
    Algorithms specifically designed for directed acyclic graphs (DAGs).
    +
    + +
  • + +
  • + +
    + + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/dag/class-use/TopologicalOrderAlgoImpl.html b/0.4.1-snapshot/com/jgalgo/alg/dag/class-use/TopologicalOrderAlgoImpl.html new file mode 100644 index 0000000000..b40e26709c --- /dev/null +++ b/0.4.1-snapshot/com/jgalgo/alg/dag/class-use/TopologicalOrderAlgoImpl.html @@ -0,0 +1,152 @@ + + + + + +Uses of Class com.jgalgo.alg.dag.TopologicalOrderAlgoImpl (JGAlgo - Parent 0.4.1-SNAPSHOT API) + + + + + + + + + + + + + + + +
    + +
    +
    +
    +

    Uses of Class
    com.jgalgo.alg.dag.TopologicalOrderAlgoImpl

    +
    +
    No usage of com.jgalgo.alg.dag.TopologicalOrderAlgoImpl
    +
    + + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/dag/package-summary.html b/0.4.1-snapshot/com/jgalgo/alg/dag/package-summary.html index 421155dd30..2f413b10ff 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/dag/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/alg/dag/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.dag (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -134,6 +134,29 @@

    Package com.jgalgo.alg.dag

    +
  • + + + + + + + + + + + + + + + + +
    Class Summary 
    ClassDescription
    TopologicalOrderAlgoAbstract +
    Abstract class for computing a topological order in a DAG graph.
    +
    TopologicalOrderAlgoImpl +
    A simple algorithm that compute a topological order in a DAG graph.
    +
    +
  • diff --git a/0.4.1-snapshot/com/jgalgo/alg/dag/package-tree.html b/0.4.1-snapshot/com/jgalgo/alg/dag/package-tree.html index 284c6a0b40..396e113ac3 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/dag/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/dag/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.dag Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -104,6 +104,20 @@

    Hierarchy For Package com.jgalgo.alg.dag

    +

    Class Hierarchy

    + +
    +

    Interface Hierarchy

    • com.jgalgo.alg.dag.TopologicalOrderAlgo
    • diff --git a/0.4.1-snapshot/com/jgalgo/alg/dag/package-use.html b/0.4.1-snapshot/com/jgalgo/alg/dag/package-use.html index e8b574a0c5..775f4c8909 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/dag/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/alg/dag/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.alg.dag (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -139,6 +139,12 @@

      Uses of Package
      A result object of a TopologicalOrderAlgo algorithm.
      + +TopologicalOrderAlgoAbstract + +
      Abstract class for computing a topological order in a DAG graph.
      + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/DistanceMeasures.html b/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/DistanceMeasures.html index f405cbb576..ecbba7530a 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/DistanceMeasures.html +++ b/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/DistanceMeasures.html @@ -2,10 +2,10 @@ - + DistanceMeasures (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/IDistanceMeasures.html b/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/IDistanceMeasures.html index 2c31244be4..55c7806134 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/IDistanceMeasures.html +++ b/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/IDistanceMeasures.html @@ -2,10 +2,10 @@ - + IDistanceMeasures (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/class-use/DistanceMeasures.html b/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/class-use/DistanceMeasures.html index 14839ac9c8..230e551abf 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/class-use/DistanceMeasures.html +++ b/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/class-use/DistanceMeasures.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.distancemeasures.DistanceMeasures (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/class-use/IDistanceMeasures.html b/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/class-use/IDistanceMeasures.html index 3408c1503b..0aac778f38 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/class-use/IDistanceMeasures.html +++ b/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/class-use/IDistanceMeasures.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.distancemeasures.IDistanceMeasures (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/package-summary.html b/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/package-summary.html index df367ee558..24b5aaedfb 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.distancemeasures (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/package-tree.html b/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/package-tree.html index aa88dab1e1..c423ce523d 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.distancemeasures Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/package-use.html b/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/package-use.html index 3a0956ea7b..3bb28ce7af 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/alg/distancemeasures/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.alg.distancemeasures (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/euler/EulerianTourAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/euler/EulerianTourAlgo.html index a3134634e4..45019e4728 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/euler/EulerianTourAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/euler/EulerianTourAlgo.html @@ -2,10 +2,10 @@ - + EulerianTourAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/euler/class-use/EulerianTourAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/euler/class-use/EulerianTourAlgo.html index 99c234046b..293c60a1d9 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/euler/class-use/EulerianTourAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/euler/class-use/EulerianTourAlgo.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.euler.EulerianTourAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/euler/package-summary.html b/0.4.1-snapshot/com/jgalgo/alg/euler/package-summary.html index 61b721ee91..c73c592339 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/euler/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/alg/euler/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.euler (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/euler/package-tree.html b/0.4.1-snapshot/com/jgalgo/alg/euler/package-tree.html index 99755de9c6..84a962027b 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/euler/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/euler/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.euler Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/euler/package-use.html b/0.4.1-snapshot/com/jgalgo/alg/euler/package-use.html index d30009122e..df389da9e4 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/euler/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/alg/euler/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.alg.euler (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/flow/Flow.html b/0.4.1-snapshot/com/jgalgo/alg/flow/Flow.html index 5c746bacd5..4e11a0e485 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/flow/Flow.html +++ b/0.4.1-snapshot/com/jgalgo/alg/flow/Flow.html @@ -2,10 +2,10 @@ - + Flow (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/flow/IFlow.html b/0.4.1-snapshot/com/jgalgo/alg/flow/IFlow.html index fa2a63e211..747590052c 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/flow/IFlow.html +++ b/0.4.1-snapshot/com/jgalgo/alg/flow/IFlow.html @@ -2,10 +2,10 @@ - + IFlow (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/flow/MaximumFlow.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/flow/MaximumFlow.Builder.html index d1ab813349..c2d24775f4 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/flow/MaximumFlow.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/flow/MaximumFlow.Builder.html @@ -2,10 +2,10 @@ - + MaximumFlow.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/flow/MaximumFlow.html b/0.4.1-snapshot/com/jgalgo/alg/flow/MaximumFlow.html index 54488b61ba..18f63f5aa9 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/flow/MaximumFlow.html +++ b/0.4.1-snapshot/com/jgalgo/alg/flow/MaximumFlow.html @@ -2,10 +2,10 @@ - + MaximumFlow (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/flow/MinimumCostFlow.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/flow/MinimumCostFlow.Builder.html index 83515e3e6e..bdda954020 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/flow/MinimumCostFlow.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/flow/MinimumCostFlow.Builder.html @@ -2,10 +2,10 @@ - + MinimumCostFlow.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/flow/MinimumCostFlow.html b/0.4.1-snapshot/com/jgalgo/alg/flow/MinimumCostFlow.html index f72371e3ee..77d735b2f3 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/flow/MinimumCostFlow.html +++ b/0.4.1-snapshot/com/jgalgo/alg/flow/MinimumCostFlow.html @@ -2,10 +2,10 @@ - + MinimumCostFlow (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/Flow.html b/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/Flow.html index 76ccfb8832..46209e0a4b 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/Flow.html +++ b/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/Flow.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.flow.Flow (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/IFlow.html b/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/IFlow.html index 1bc6b2e74d..31c7b5345d 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/IFlow.html +++ b/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/IFlow.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.flow.IFlow (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/MaximumFlow.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/MaximumFlow.Builder.html index b67a7324a0..1ec0b50daa 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/MaximumFlow.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/MaximumFlow.Builder.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.flow.MaximumFlow.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/MaximumFlow.html b/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/MaximumFlow.html index 64e9e2c63a..c52abd2340 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/MaximumFlow.html +++ b/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/MaximumFlow.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.flow.MaximumFlow (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/MinimumCostFlow.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/MinimumCostFlow.Builder.html index 4545471558..8dbaaf8135 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/MinimumCostFlow.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/MinimumCostFlow.Builder.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.flow.MinimumCostFlow.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/MinimumCostFlow.html b/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/MinimumCostFlow.html index 1480c27b23..5028d5227e 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/MinimumCostFlow.html +++ b/0.4.1-snapshot/com/jgalgo/alg/flow/class-use/MinimumCostFlow.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.flow.MinimumCostFlow (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/flow/package-summary.html b/0.4.1-snapshot/com/jgalgo/alg/flow/package-summary.html index 58c9edd400..1afd5ef69b 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/flow/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/alg/flow/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.flow (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/flow/package-tree.html b/0.4.1-snapshot/com/jgalgo/alg/flow/package-tree.html index b89a7075ce..8d4a62845e 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/flow/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/flow/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.flow Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/flow/package-use.html b/0.4.1-snapshot/com/jgalgo/alg/flow/package-use.html index 281e7d9363..4f6ca26663 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/flow/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/alg/flow/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.alg.flow (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/hamilton/HamiltonianPathAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/hamilton/HamiltonianPathAlgo.html index 150bcaab9a..1416764d9f 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/hamilton/HamiltonianPathAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/hamilton/HamiltonianPathAlgo.html @@ -2,10 +2,10 @@ - + HamiltonianPathAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/hamilton/class-use/HamiltonianPathAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/hamilton/class-use/HamiltonianPathAlgo.html index 2ca2292f0a..0a9442dc59 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/hamilton/class-use/HamiltonianPathAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/hamilton/class-use/HamiltonianPathAlgo.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.hamilton.HamiltonianPathAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/hamilton/package-summary.html b/0.4.1-snapshot/com/jgalgo/alg/hamilton/package-summary.html index 7ae28b0d6a..4733e12844 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/hamilton/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/alg/hamilton/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.hamilton (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/hamilton/package-tree.html b/0.4.1-snapshot/com/jgalgo/alg/hamilton/package-tree.html index 15fe995428..8736fde810 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/hamilton/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/hamilton/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.hamilton Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/hamilton/package-use.html b/0.4.1-snapshot/com/jgalgo/alg/hamilton/package-use.html index e73e652713..c48445029a 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/hamilton/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/alg/hamilton/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.alg.hamilton (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/isomorphism/IsomorphismIMapping.html b/0.4.1-snapshot/com/jgalgo/alg/isomorphism/IsomorphismIMapping.html index dca381a886..02596f2765 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/isomorphism/IsomorphismIMapping.html +++ b/0.4.1-snapshot/com/jgalgo/alg/isomorphism/IsomorphismIMapping.html @@ -2,10 +2,10 @@ - + IsomorphismIMapping (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/isomorphism/IsomorphismMapping.html b/0.4.1-snapshot/com/jgalgo/alg/isomorphism/IsomorphismMapping.html index 7a2a330fe2..e400ee0278 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/isomorphism/IsomorphismMapping.html +++ b/0.4.1-snapshot/com/jgalgo/alg/isomorphism/IsomorphismMapping.html @@ -2,10 +2,10 @@ - + IsomorphismMapping (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/isomorphism/IsomorphismTester.html b/0.4.1-snapshot/com/jgalgo/alg/isomorphism/IsomorphismTester.html index 02ba145bf5..20cd5c5f3e 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/isomorphism/IsomorphismTester.html +++ b/0.4.1-snapshot/com/jgalgo/alg/isomorphism/IsomorphismTester.html @@ -2,10 +2,10 @@ - + IsomorphismTester (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/isomorphism/class-use/IsomorphismIMapping.html b/0.4.1-snapshot/com/jgalgo/alg/isomorphism/class-use/IsomorphismIMapping.html index 9ec68945b1..cc489fd097 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/isomorphism/class-use/IsomorphismIMapping.html +++ b/0.4.1-snapshot/com/jgalgo/alg/isomorphism/class-use/IsomorphismIMapping.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.isomorphism.IsomorphismIMapping (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/isomorphism/class-use/IsomorphismMapping.html b/0.4.1-snapshot/com/jgalgo/alg/isomorphism/class-use/IsomorphismMapping.html index 8871196e81..fb3248e5f8 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/isomorphism/class-use/IsomorphismMapping.html +++ b/0.4.1-snapshot/com/jgalgo/alg/isomorphism/class-use/IsomorphismMapping.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.isomorphism.IsomorphismMapping (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/isomorphism/class-use/IsomorphismTester.html b/0.4.1-snapshot/com/jgalgo/alg/isomorphism/class-use/IsomorphismTester.html index 8c788c5389..3cd322541c 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/isomorphism/class-use/IsomorphismTester.html +++ b/0.4.1-snapshot/com/jgalgo/alg/isomorphism/class-use/IsomorphismTester.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.isomorphism.IsomorphismTester (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/isomorphism/package-summary.html b/0.4.1-snapshot/com/jgalgo/alg/isomorphism/package-summary.html index 4a4f18a8b2..3636e8aab2 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/isomorphism/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/alg/isomorphism/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.isomorphism (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/isomorphism/package-tree.html b/0.4.1-snapshot/com/jgalgo/alg/isomorphism/package-tree.html index abf2775578..74695d640a 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/isomorphism/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/isomorphism/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.isomorphism Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/isomorphism/package-use.html b/0.4.1-snapshot/com/jgalgo/alg/isomorphism/package-use.html index 193791f776..7a10850846 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/isomorphism/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/alg/isomorphism/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.alg.isomorphism (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/match/IMatching.html b/0.4.1-snapshot/com/jgalgo/alg/match/IMatching.html index 2c6d6ffcdd..6de530f382 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/match/IMatching.html +++ b/0.4.1-snapshot/com/jgalgo/alg/match/IMatching.html @@ -2,10 +2,10 @@ - + IMatching (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/match/Matching.html b/0.4.1-snapshot/com/jgalgo/alg/match/Matching.html index 7530c5f8a3..fde0e13270 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/match/Matching.html +++ b/0.4.1-snapshot/com/jgalgo/alg/match/Matching.html @@ -2,10 +2,10 @@ - + Matching (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/match/MatchingAlgo.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/match/MatchingAlgo.Builder.html index a29a30625e..3e522baf77 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/match/MatchingAlgo.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/match/MatchingAlgo.Builder.html @@ -2,10 +2,10 @@ - + MatchingAlgo.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/match/MatchingAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/match/MatchingAlgo.html index 5fc44ddd72..6ce54a857a 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/match/MatchingAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/match/MatchingAlgo.html @@ -2,10 +2,10 @@ - + MatchingAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/match/class-use/IMatching.html b/0.4.1-snapshot/com/jgalgo/alg/match/class-use/IMatching.html index 138bdea788..0f904f3274 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/match/class-use/IMatching.html +++ b/0.4.1-snapshot/com/jgalgo/alg/match/class-use/IMatching.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.match.IMatching (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/match/class-use/Matching.html b/0.4.1-snapshot/com/jgalgo/alg/match/class-use/Matching.html index 690015b166..9f32a2e3aa 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/match/class-use/Matching.html +++ b/0.4.1-snapshot/com/jgalgo/alg/match/class-use/Matching.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.match.Matching (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/match/class-use/MatchingAlgo.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/match/class-use/MatchingAlgo.Builder.html index cfdb837189..2a1e1aa13e 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/match/class-use/MatchingAlgo.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/match/class-use/MatchingAlgo.Builder.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.match.MatchingAlgo.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/match/class-use/MatchingAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/match/class-use/MatchingAlgo.html index 82bd5f39c9..b65ddf8be4 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/match/class-use/MatchingAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/match/class-use/MatchingAlgo.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.match.MatchingAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/match/package-summary.html b/0.4.1-snapshot/com/jgalgo/alg/match/package-summary.html index def92a1e83..ce32cfd8ae 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/match/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/alg/match/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.match (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/match/package-tree.html b/0.4.1-snapshot/com/jgalgo/alg/match/package-tree.html index c2a535e3bf..a88c5579a6 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/match/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/match/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.match Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/match/package-use.html b/0.4.1-snapshot/com/jgalgo/alg/match/package-use.html index 80dab19de1..adddf775da 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/match/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/alg/match/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.alg.match (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/package-summary.html b/0.4.1-snapshot/com/jgalgo/alg/package-summary.html index 7f5b2d7e3e..b4034cb5d0 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/alg/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/package-tree.html b/0.4.1-snapshot/com/jgalgo/alg/package-tree.html index 0e83feb209..eae640b5d1 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/package-use.html b/0.4.1-snapshot/com/jgalgo/alg/package-use.html index f41ca545a6..9a2431ed57 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/alg/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.alg (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -334,24 +334,18 @@

      Uses of Package
      com. -IVertexPartition - -
      A partition of the vertices of an int graph.
      - - - RandomizedAlgorithm
      Randomized algorithm interface.
      - + VertexBiPartition
      A partition of the vertices of a graph into two blocks.
      - + VertexPartition
      A partition of the vertices of a graph.
      @@ -401,6 +395,12 @@

      Uses of Package
      com.
      The direction type of an edge with respect to a vertex.
      + +RandomizedAlgorithm + +
      Randomized algorithm interface.
      + + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/IPath.html b/0.4.1-snapshot/com/jgalgo/alg/path/IPath.html index f67aa9addb..01177742e1 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/IPath.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/IPath.html @@ -2,10 +2,10 @@ - + IPath (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/KShortestPathsST.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/path/KShortestPathsST.Builder.html index 0799778ccb..f4f3c3e5dd 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/KShortestPathsST.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/KShortestPathsST.Builder.html @@ -2,10 +2,10 @@ - + KShortestPathsST.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/KShortestPathsST.html b/0.4.1-snapshot/com/jgalgo/alg/path/KShortestPathsST.html index 9788400ead..8fe9be8ea1 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/KShortestPathsST.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/KShortestPathsST.html @@ -2,10 +2,10 @@ - + KShortestPathsST (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/NegativeCycleException.html b/0.4.1-snapshot/com/jgalgo/alg/path/NegativeCycleException.html index 6739d0b210..35fdceb6e9 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/NegativeCycleException.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/NegativeCycleException.html @@ -2,10 +2,10 @@ - + NegativeCycleException (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/Path.html b/0.4.1-snapshot/com/jgalgo/alg/path/Path.html index f7886e0ed3..5c8bee9599 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/Path.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/Path.html @@ -2,10 +2,10 @@ - + Path (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathAllPairs.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathAllPairs.Builder.html index 8269ec25ac..86f2279a77 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathAllPairs.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathAllPairs.Builder.html @@ -2,10 +2,10 @@ - + ShortestPathAllPairs.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathAllPairs.IResult.html b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathAllPairs.IResult.html index 9d33b6e96b..4e217c7741 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathAllPairs.IResult.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathAllPairs.IResult.html @@ -2,10 +2,10 @@ - + ShortestPathAllPairs.IResult (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathAllPairs.Result.html b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathAllPairs.Result.html index 1284253913..bc9915d341 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathAllPairs.Result.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathAllPairs.Result.html @@ -2,10 +2,10 @@ - + ShortestPathAllPairs.Result (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathAllPairs.html b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathAllPairs.html index 243f77e41a..bc1cd96bdb 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathAllPairs.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathAllPairs.html @@ -2,10 +2,10 @@ - + ShortestPathAllPairs (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathHeuristicST.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathHeuristicST.Builder.html index a49a9e6c94..7eb51362a4 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathHeuristicST.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathHeuristicST.Builder.html @@ -2,10 +2,10 @@ - + ShortestPathHeuristicST.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathHeuristicST.html b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathHeuristicST.html index 51e59d23f6..1b1233ab83 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathHeuristicST.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathHeuristicST.html @@ -2,10 +2,10 @@ - + ShortestPathHeuristicST (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathST.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathST.Builder.html index cab3933faf..eb5f84cacd 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathST.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathST.Builder.html @@ -2,10 +2,10 @@ - + ShortestPathST.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathST.html b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathST.html index bdc1f4ad1c..14693bd8d7 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathST.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathST.html @@ -2,10 +2,10 @@ - + ShortestPathST (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathSingleSource.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathSingleSource.Builder.html index 4822e74ab5..c25d69d14e 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathSingleSource.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathSingleSource.Builder.html @@ -2,10 +2,10 @@ - + ShortestPathSingleSource.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathSingleSource.IResult.html b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathSingleSource.IResult.html index 881abe5a5a..e47cdb1dc9 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathSingleSource.IResult.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathSingleSource.IResult.html @@ -2,10 +2,10 @@ - + ShortestPathSingleSource.IResult (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathSingleSource.Result.html b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathSingleSource.Result.html index 772c0b693c..c4a44dc66c 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathSingleSource.Result.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathSingleSource.Result.html @@ -2,10 +2,10 @@ - + ShortestPathSingleSource.Result (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathSingleSource.html b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathSingleSource.html index cdc0e7c1b2..eb32759595 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathSingleSource.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/ShortestPathSingleSource.html @@ -2,10 +2,10 @@ - + ShortestPathSingleSource (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/SimplePathsEnumerator.html b/0.4.1-snapshot/com/jgalgo/alg/path/SimplePathsEnumerator.html index 8be2df5832..ca0d3fcc9a 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/SimplePathsEnumerator.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/SimplePathsEnumerator.html @@ -2,10 +2,10 @@ - + SimplePathsEnumerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/TspMetric.html b/0.4.1-snapshot/com/jgalgo/alg/path/TspMetric.html index 7a1c4671a9..c719bacf3a 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/TspMetric.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/TspMetric.html @@ -2,10 +2,10 @@ - + TspMetric (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/TspMetricMSTAppx.html b/0.4.1-snapshot/com/jgalgo/alg/path/TspMetricMSTAppx.html index 776c5b9e36..1b7589c0d1 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/TspMetricMSTAppx.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/TspMetricMSTAppx.html @@ -2,10 +2,10 @@ - + TspMetricMSTAppx (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/TspMetricMatchingAppx.html b/0.4.1-snapshot/com/jgalgo/alg/path/TspMetricMatchingAppx.html index 2df90f739d..33fb06d51c 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/TspMetricMatchingAppx.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/TspMetricMatchingAppx.html @@ -2,10 +2,10 @@ - + TspMetricMatchingAppx (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/VoronoiAlgo.IResult.html b/0.4.1-snapshot/com/jgalgo/alg/path/VoronoiAlgo.IResult.html index d3db12123c..367116544d 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/VoronoiAlgo.IResult.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/VoronoiAlgo.IResult.html @@ -2,10 +2,10 @@ - + VoronoiAlgo.IResult (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/VoronoiAlgo.Result.html b/0.4.1-snapshot/com/jgalgo/alg/path/VoronoiAlgo.Result.html index dd8fe0c1f1..810b4afe99 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/VoronoiAlgo.Result.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/VoronoiAlgo.Result.html @@ -2,10 +2,10 @@ - + VoronoiAlgo.Result (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/VoronoiAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/path/VoronoiAlgo.html index 9751567f20..afe0ecff36 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/VoronoiAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/VoronoiAlgo.html @@ -2,10 +2,10 @@ - + VoronoiAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/IPath.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/IPath.html index 5d1d194885..9f035f1b8a 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/IPath.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/IPath.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.path.IPath (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/KShortestPathsST.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/KShortestPathsST.Builder.html index 3c5abb5214..842b8b3dc0 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/KShortestPathsST.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/KShortestPathsST.Builder.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.path.KShortestPathsST.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/KShortestPathsST.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/KShortestPathsST.html index defb5707bc..ffb575ad55 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/KShortestPathsST.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/KShortestPathsST.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.path.KShortestPathsST (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/NegativeCycleException.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/NegativeCycleException.html index 8d726bbf2b..6537fa3e0c 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/NegativeCycleException.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/NegativeCycleException.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.path.NegativeCycleException (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/Path.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/Path.html index ffe58cf858..720dd60d12 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/Path.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/Path.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.path.Path (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -162,6 +162,12 @@

      Uses of Path <V,​E>
      Path<V,​E> +MinimumMeanCycleAbstract.computeMinimumMeanCycle​(Graph<V,​E> g, + WeightFunction<E> w) +  + + +default <V,​E>
      Path<V,​E>
      ChinesePostman.computeShortestEdgeVisitorCircle​(Graph<V,​E> g, WeightFunction<E> w) @@ -179,19 +185,31 @@

      Uses of Path -default <V,​E>
      List<Path<V,​E>> -CyclesEnumerator.allCycles​(Graph<V,​E> g) +<V,​E>
      Optional<Path<V,​E>>
      +ChinesePostman.computeShortestEdgeVisitorCircleIfExist​(Graph<V,​E> g, + WeightFunction<E> w) -
      Find all cycles in the given graph.
      +
      Compute the shortest circuit that visits all edges in the graph at least once, if it exist.
      +<V,​E>
      Optional<Path<V,​E>>
      +ChinesePostmanAbstract.computeShortestEdgeVisitorCircleIfExist​(Graph<V,​E> g, + WeightFunction<E> w) +  + + <V,​E>
      Iterator<Path<V,​E>>
      CyclesEnumerator.cyclesIter​(Graph<V,​E> g)
      Iterate over all cycles in the given graph.
      + +<V,​E>
      Iterator<Path<V,​E>>
      +CyclesEnumeratorAbstract.cyclesIter​(Graph<V,​E> g) +  +

    diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathAllPairs.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathAllPairs.Builder.html index 04f1c1aa24..3df9406867 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathAllPairs.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathAllPairs.Builder.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.path.ShortestPathAllPairs.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathAllPairs.IResult.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathAllPairs.IResult.html index a11e129fd9..4de974b969 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathAllPairs.IResult.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathAllPairs.IResult.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.path.ShortestPathAllPairs.IResult (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathAllPairs.Result.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathAllPairs.Result.html index a44e6cebb7..9cdbc60c7a 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathAllPairs.Result.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathAllPairs.Result.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.path.ShortestPathAllPairs.Result (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathAllPairs.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathAllPairs.html index 27134915d7..934ecba4e6 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathAllPairs.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathAllPairs.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.path.ShortestPathAllPairs (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathHeuristicST.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathHeuristicST.Builder.html index c04c0b3706..dc82eeb112 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathHeuristicST.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathHeuristicST.Builder.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.path.ShortestPathHeuristicST.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathHeuristicST.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathHeuristicST.html index 95e8dd6dff..45a28381c0 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathHeuristicST.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathHeuristicST.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.path.ShortestPathHeuristicST (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathST.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathST.Builder.html index 86790fe5f4..4b2319eef5 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathST.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathST.Builder.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.path.ShortestPathST.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathST.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathST.html index 90b7b10629..077030c052 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathST.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathST.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.path.ShortestPathST (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathSingleSource.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathSingleSource.Builder.html index 6863f6a44b..7b11b772ca 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathSingleSource.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathSingleSource.Builder.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.path.ShortestPathSingleSource.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathSingleSource.IResult.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathSingleSource.IResult.html index 10e803c2bc..77393f71cf 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathSingleSource.IResult.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathSingleSource.IResult.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.path.ShortestPathSingleSource.IResult (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathSingleSource.Result.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathSingleSource.Result.html index 7036084837..c2642ba6bb 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathSingleSource.Result.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathSingleSource.Result.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.path.ShortestPathSingleSource.Result (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathSingleSource.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathSingleSource.html index 81655b781c..a29e027ff5 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathSingleSource.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/ShortestPathSingleSource.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.path.ShortestPathSingleSource (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/SimplePathsEnumerator.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/SimplePathsEnumerator.html index 0d2b7570a7..2a80a341bd 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/SimplePathsEnumerator.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/SimplePathsEnumerator.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.path.SimplePathsEnumerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/TspMetric.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/TspMetric.html index 894f82bbbb..56fb87bf3d 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/TspMetric.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/TspMetric.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.path.TspMetric (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/TspMetricMSTAppx.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/TspMetricMSTAppx.html index de1154bf84..c3d4f64395 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/TspMetricMSTAppx.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/TspMetricMSTAppx.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.path.TspMetricMSTAppx (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/TspMetricMatchingAppx.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/TspMetricMatchingAppx.html index a74dc1b2f3..f20de08ec6 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/TspMetricMatchingAppx.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/TspMetricMatchingAppx.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.path.TspMetricMatchingAppx (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/VoronoiAlgo.IResult.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/VoronoiAlgo.IResult.html index 42441857bd..c324865b15 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/VoronoiAlgo.IResult.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/VoronoiAlgo.IResult.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.path.VoronoiAlgo.IResult (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/VoronoiAlgo.Result.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/VoronoiAlgo.Result.html index b7eda9771a..e6dc37ff13 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/VoronoiAlgo.Result.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/VoronoiAlgo.Result.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.path.VoronoiAlgo.Result (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/VoronoiAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/VoronoiAlgo.html index ff4cd6eb8a..14d15e12e1 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/class-use/VoronoiAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/class-use/VoronoiAlgo.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.path.VoronoiAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/package-summary.html b/0.4.1-snapshot/com/jgalgo/alg/path/package-summary.html index 0c4dbf68e0..584bdbfa7f 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.path (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/package-tree.html b/0.4.1-snapshot/com/jgalgo/alg/path/package-tree.html index bb1fa45082..9edbc2bbe6 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.path Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/path/package-use.html b/0.4.1-snapshot/com/jgalgo/alg/path/package-use.html index 521d6baf87..d1881d4e01 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/path/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/alg/path/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.alg.path (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/span/MinimumDirectedSpanningTree.html b/0.4.1-snapshot/com/jgalgo/alg/span/MinimumDirectedSpanningTree.html index 800d29f24c..91e4df571b 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/span/MinimumDirectedSpanningTree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/span/MinimumDirectedSpanningTree.html @@ -2,10 +2,10 @@ - + MinimumDirectedSpanningTree (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/span/MinimumSpanningTree.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/span/MinimumSpanningTree.Builder.html index f460eb1ffa..0b2e568b3d 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/span/MinimumSpanningTree.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/span/MinimumSpanningTree.Builder.html @@ -2,10 +2,10 @@ - + MinimumSpanningTree.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/span/MinimumSpanningTree.IResult.html b/0.4.1-snapshot/com/jgalgo/alg/span/MinimumSpanningTree.IResult.html index ff5084a80d..edd8e52351 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/span/MinimumSpanningTree.IResult.html +++ b/0.4.1-snapshot/com/jgalgo/alg/span/MinimumSpanningTree.IResult.html @@ -2,10 +2,10 @@ - + MinimumSpanningTree.IResult (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/span/MinimumSpanningTree.Result.html b/0.4.1-snapshot/com/jgalgo/alg/span/MinimumSpanningTree.Result.html index 78b8d80b9e..f12f42a93e 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/span/MinimumSpanningTree.Result.html +++ b/0.4.1-snapshot/com/jgalgo/alg/span/MinimumSpanningTree.Result.html @@ -2,10 +2,10 @@ - + MinimumSpanningTree.Result (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/span/MinimumSpanningTree.html b/0.4.1-snapshot/com/jgalgo/alg/span/MinimumSpanningTree.html index 3a5d83469f..bb0684d264 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/span/MinimumSpanningTree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/span/MinimumSpanningTree.html @@ -2,10 +2,10 @@ - + MinimumSpanningTree (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/span/SteinerTreeAlgo.IResult.html b/0.4.1-snapshot/com/jgalgo/alg/span/SteinerTreeAlgo.IResult.html index 3283662ef3..036f2666d2 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/span/SteinerTreeAlgo.IResult.html +++ b/0.4.1-snapshot/com/jgalgo/alg/span/SteinerTreeAlgo.IResult.html @@ -2,10 +2,10 @@ - + SteinerTreeAlgo.IResult (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/span/SteinerTreeAlgo.Result.html b/0.4.1-snapshot/com/jgalgo/alg/span/SteinerTreeAlgo.Result.html index a22f3d8f0f..9d910aa599 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/span/SteinerTreeAlgo.Result.html +++ b/0.4.1-snapshot/com/jgalgo/alg/span/SteinerTreeAlgo.Result.html @@ -2,10 +2,10 @@ - + SteinerTreeAlgo.Result (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/span/SteinerTreeAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/span/SteinerTreeAlgo.html index 37bb4b1294..32af32f75e 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/span/SteinerTreeAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/span/SteinerTreeAlgo.html @@ -2,10 +2,10 @@ - + SteinerTreeAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/span/class-use/MinimumDirectedSpanningTree.html b/0.4.1-snapshot/com/jgalgo/alg/span/class-use/MinimumDirectedSpanningTree.html index 22baa90168..ee2d8bb4a3 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/span/class-use/MinimumDirectedSpanningTree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/span/class-use/MinimumDirectedSpanningTree.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.span.MinimumDirectedSpanningTree (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/span/class-use/MinimumSpanningTree.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/span/class-use/MinimumSpanningTree.Builder.html index 2b052166a6..b403f50052 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/span/class-use/MinimumSpanningTree.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/span/class-use/MinimumSpanningTree.Builder.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.span.MinimumSpanningTree.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/span/class-use/MinimumSpanningTree.IResult.html b/0.4.1-snapshot/com/jgalgo/alg/span/class-use/MinimumSpanningTree.IResult.html index fc430bd075..da6edaa4e4 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/span/class-use/MinimumSpanningTree.IResult.html +++ b/0.4.1-snapshot/com/jgalgo/alg/span/class-use/MinimumSpanningTree.IResult.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.span.MinimumSpanningTree.IResult (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/span/class-use/MinimumSpanningTree.Result.html b/0.4.1-snapshot/com/jgalgo/alg/span/class-use/MinimumSpanningTree.Result.html index 5ee335b37d..34d955ad94 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/span/class-use/MinimumSpanningTree.Result.html +++ b/0.4.1-snapshot/com/jgalgo/alg/span/class-use/MinimumSpanningTree.Result.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.span.MinimumSpanningTree.Result (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/span/class-use/MinimumSpanningTree.html b/0.4.1-snapshot/com/jgalgo/alg/span/class-use/MinimumSpanningTree.html index ce7694b7a0..45949ee262 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/span/class-use/MinimumSpanningTree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/span/class-use/MinimumSpanningTree.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.span.MinimumSpanningTree (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/span/class-use/SteinerTreeAlgo.IResult.html b/0.4.1-snapshot/com/jgalgo/alg/span/class-use/SteinerTreeAlgo.IResult.html index b24e685dfe..420373885e 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/span/class-use/SteinerTreeAlgo.IResult.html +++ b/0.4.1-snapshot/com/jgalgo/alg/span/class-use/SteinerTreeAlgo.IResult.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.span.SteinerTreeAlgo.IResult (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/span/class-use/SteinerTreeAlgo.Result.html b/0.4.1-snapshot/com/jgalgo/alg/span/class-use/SteinerTreeAlgo.Result.html index f3cd857f0d..1a82cd679e 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/span/class-use/SteinerTreeAlgo.Result.html +++ b/0.4.1-snapshot/com/jgalgo/alg/span/class-use/SteinerTreeAlgo.Result.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.span.SteinerTreeAlgo.Result (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/span/class-use/SteinerTreeAlgo.html b/0.4.1-snapshot/com/jgalgo/alg/span/class-use/SteinerTreeAlgo.html index 03833d9165..ea7925240f 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/span/class-use/SteinerTreeAlgo.html +++ b/0.4.1-snapshot/com/jgalgo/alg/span/class-use/SteinerTreeAlgo.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.span.SteinerTreeAlgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/span/package-summary.html b/0.4.1-snapshot/com/jgalgo/alg/span/package-summary.html index c24eb51ead..662be39993 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/span/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/alg/span/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.span (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/span/package-tree.html b/0.4.1-snapshot/com/jgalgo/alg/span/package-tree.html index d173481ee1..d0d8602fb9 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/span/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/span/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.span Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/span/package-use.html b/0.4.1-snapshot/com/jgalgo/alg/span/package-use.html index ec1e22ab85..8178975496 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/span/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/alg/span/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.alg.span (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/traversal/BfsIter.Int.html b/0.4.1-snapshot/com/jgalgo/alg/traversal/BfsIter.Int.html index 5ed09ee099..516064a242 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/traversal/BfsIter.Int.html +++ b/0.4.1-snapshot/com/jgalgo/alg/traversal/BfsIter.Int.html @@ -2,10 +2,10 @@ - + BfsIter.Int (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/traversal/BfsIter.html b/0.4.1-snapshot/com/jgalgo/alg/traversal/BfsIter.html index edc28395d6..98d166024c 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/traversal/BfsIter.html +++ b/0.4.1-snapshot/com/jgalgo/alg/traversal/BfsIter.html @@ -2,10 +2,10 @@ - + BfsIter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/traversal/DfsIter.Int.html b/0.4.1-snapshot/com/jgalgo/alg/traversal/DfsIter.Int.html index 0e5d95c238..767f4da678 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/traversal/DfsIter.Int.html +++ b/0.4.1-snapshot/com/jgalgo/alg/traversal/DfsIter.Int.html @@ -2,10 +2,10 @@ - + DfsIter.Int (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/traversal/DfsIter.html b/0.4.1-snapshot/com/jgalgo/alg/traversal/DfsIter.html index 49bcdff993..153f277773 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/traversal/DfsIter.html +++ b/0.4.1-snapshot/com/jgalgo/alg/traversal/DfsIter.html @@ -2,10 +2,10 @@ - + DfsIter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/traversal/RandomWalkIter.Int.html b/0.4.1-snapshot/com/jgalgo/alg/traversal/RandomWalkIter.Int.html index 8626e5c341..2fe4b4e05d 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/traversal/RandomWalkIter.Int.html +++ b/0.4.1-snapshot/com/jgalgo/alg/traversal/RandomWalkIter.Int.html @@ -2,10 +2,10 @@ - + RandomWalkIter.Int (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/traversal/RandomWalkIter.html b/0.4.1-snapshot/com/jgalgo/alg/traversal/RandomWalkIter.html index cc767e09e0..d11201f5b4 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/traversal/RandomWalkIter.html +++ b/0.4.1-snapshot/com/jgalgo/alg/traversal/RandomWalkIter.html @@ -2,10 +2,10 @@ - + RandomWalkIter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/BfsIter.Int.html b/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/BfsIter.Int.html index 6955490346..b6056bf300 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/BfsIter.Int.html +++ b/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/BfsIter.Int.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.traversal.BfsIter.Int (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/BfsIter.html b/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/BfsIter.html index 5241175f5a..aa4737e62e 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/BfsIter.html +++ b/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/BfsIter.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.traversal.BfsIter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/DfsIter.Int.html b/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/DfsIter.Int.html index 2827944af5..6b38bfd394 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/DfsIter.Int.html +++ b/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/DfsIter.Int.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.traversal.DfsIter.Int (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/DfsIter.html b/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/DfsIter.html index 677262e1da..c16a77e816 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/DfsIter.html +++ b/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/DfsIter.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.traversal.DfsIter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/RandomWalkIter.Int.html b/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/RandomWalkIter.Int.html index 4f71cd5385..44600678e7 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/RandomWalkIter.Int.html +++ b/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/RandomWalkIter.Int.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.traversal.RandomWalkIter.Int (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/RandomWalkIter.html b/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/RandomWalkIter.html index 689bd1d974..5ee3e1561e 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/RandomWalkIter.html +++ b/0.4.1-snapshot/com/jgalgo/alg/traversal/class-use/RandomWalkIter.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.traversal.RandomWalkIter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/traversal/package-summary.html b/0.4.1-snapshot/com/jgalgo/alg/traversal/package-summary.html index bd59691f29..6ca5fa1529 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/traversal/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/alg/traversal/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.traversal (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/traversal/package-tree.html b/0.4.1-snapshot/com/jgalgo/alg/traversal/package-tree.html index 3f79174b2e..780c35b4f5 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/traversal/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/traversal/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.traversal Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/traversal/package-use.html b/0.4.1-snapshot/com/jgalgo/alg/traversal/package-use.html index 52ac0e89e8..4226f08512 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/traversal/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/alg/traversal/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.alg.traversal (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorDynamic.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorDynamic.Builder.html index d3c0fd39e2..818b9be127 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorDynamic.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorDynamic.Builder.html @@ -2,10 +2,10 @@ - + LowestCommonAncestorDynamic.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorDynamic.Vertex.html b/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorDynamic.Vertex.html index 1b7a67b48b..9e731d0ea2 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorDynamic.Vertex.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorDynamic.Vertex.html @@ -2,10 +2,10 @@ - + LowestCommonAncestorDynamic.Vertex (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorDynamic.html b/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorDynamic.html index 188b16974b..05e2c06225 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorDynamic.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorDynamic.html @@ -2,10 +2,10 @@ - + LowestCommonAncestorDynamic (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorOffline.IQueries.html b/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorOffline.IQueries.html index 4cee857f16..41ee9833f7 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorOffline.IQueries.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorOffline.IQueries.html @@ -2,10 +2,10 @@ - + LowestCommonAncestorOffline.IQueries (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorOffline.IResult.html b/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorOffline.IResult.html index 371f267f89..2ac1668479 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorOffline.IResult.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorOffline.IResult.html @@ -2,10 +2,10 @@ - + LowestCommonAncestorOffline.IResult (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorOffline.Queries.html b/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorOffline.Queries.html index 59a980c1cb..984b04efb7 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorOffline.Queries.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorOffline.Queries.html @@ -2,10 +2,10 @@ - + LowestCommonAncestorOffline.Queries (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorOffline.Result.html b/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorOffline.Result.html index cd76c31247..77c49c85d4 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorOffline.Result.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorOffline.Result.html @@ -2,10 +2,10 @@ - + LowestCommonAncestorOffline.Result (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorOffline.html b/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorOffline.html index ebbe419395..c0d689d52d 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorOffline.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorOffline.html @@ -2,10 +2,10 @@ - + LowestCommonAncestorOffline (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorStatic.DataStructure.html b/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorStatic.DataStructure.html index 955796ddb3..ffc460d550 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorStatic.DataStructure.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorStatic.DataStructure.html @@ -2,10 +2,10 @@ - + LowestCommonAncestorStatic.DataStructure (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorStatic.IDataStructure.html b/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorStatic.IDataStructure.html index aad606e9cc..f9ad306c88 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorStatic.IDataStructure.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorStatic.IDataStructure.html @@ -2,10 +2,10 @@ - + LowestCommonAncestorStatic.IDataStructure (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorStatic.html b/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorStatic.html index 0805e0d765..dd6bd575c5 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorStatic.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/LowestCommonAncestorStatic.html @@ -2,10 +2,10 @@ - + LowestCommonAncestorStatic (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.Builder.html index c82cd25834..d8a5a8fc07 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.Builder.html @@ -2,10 +2,10 @@ - + TreePathMaxima.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.IQueries.html b/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.IQueries.html index b08710a8b5..cff064e10a 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.IQueries.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.IQueries.html @@ -2,10 +2,10 @@ - + TreePathMaxima.IQueries (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.IResult.html b/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.IResult.html index 39cfc3edc9..0773cdbdcf 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.IResult.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.IResult.html @@ -2,10 +2,10 @@ - + TreePathMaxima.IResult (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.Queries.html b/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.Queries.html index 9f2f13bcdf..fcf9d15670 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.Queries.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.Queries.html @@ -2,10 +2,10 @@ - + TreePathMaxima.Queries (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.Result.html b/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.Result.html index 7f4642e0ac..7c83af4c16 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.Result.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.Result.html @@ -2,10 +2,10 @@ - + TreePathMaxima.Result (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.html b/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.html index e55e1b8a07..6e8ff8dd64 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/TreePathMaxima.html @@ -2,10 +2,10 @@ - + TreePathMaxima (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/Trees.html b/0.4.1-snapshot/com/jgalgo/alg/tree/Trees.html index 81386a3d7f..d2c8daa568 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/Trees.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/Trees.html @@ -2,10 +2,10 @@ - + Trees (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorDynamic.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorDynamic.Builder.html index c31a9c4264..a986e1a7d6 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorDynamic.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorDynamic.Builder.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.tree.LowestCommonAncestorDynamic.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorDynamic.Vertex.html b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorDynamic.Vertex.html index cb63adae74..14398c8ec6 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorDynamic.Vertex.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorDynamic.Vertex.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.tree.LowestCommonAncestorDynamic.Vertex (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorDynamic.html b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorDynamic.html index 8276d37e47..55f8a04567 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorDynamic.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorDynamic.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.tree.LowestCommonAncestorDynamic (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorOffline.IQueries.html b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorOffline.IQueries.html index a7bf1739bd..77801176d8 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorOffline.IQueries.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorOffline.IQueries.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.tree.LowestCommonAncestorOffline.IQueries (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorOffline.IResult.html b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorOffline.IResult.html index 2e279c86ea..32fbb4aa5c 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorOffline.IResult.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorOffline.IResult.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.tree.LowestCommonAncestorOffline.IResult (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorOffline.Queries.html b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorOffline.Queries.html index 69d80f17f8..c5b31bc00b 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorOffline.Queries.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorOffline.Queries.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.tree.LowestCommonAncestorOffline.Queries (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorOffline.Result.html b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorOffline.Result.html index ea11407687..6f7cc0a3f9 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorOffline.Result.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorOffline.Result.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.tree.LowestCommonAncestorOffline.Result (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorOffline.html b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorOffline.html index deaca4ffec..e09832a059 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorOffline.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorOffline.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.tree.LowestCommonAncestorOffline (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorStatic.DataStructure.html b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorStatic.DataStructure.html index 3ed813380a..8aa5659438 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorStatic.DataStructure.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorStatic.DataStructure.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.tree.LowestCommonAncestorStatic.DataStructure (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorStatic.IDataStructure.html b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorStatic.IDataStructure.html index d7140f25bf..53ece882d9 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorStatic.IDataStructure.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorStatic.IDataStructure.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.tree.LowestCommonAncestorStatic.IDataStructure (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorStatic.html b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorStatic.html index 80ccfd7859..e57ed8a684 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorStatic.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/LowestCommonAncestorStatic.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.tree.LowestCommonAncestorStatic (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.Builder.html b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.Builder.html index 97814a0438..d435801886 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.Builder.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.Builder.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.tree.TreePathMaxima.Builder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.IQueries.html b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.IQueries.html index 2bc38873c5..ebfa6e303b 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.IQueries.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.IQueries.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.tree.TreePathMaxima.IQueries (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.IResult.html b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.IResult.html index 5e1e49d262..501e43b2cd 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.IResult.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.IResult.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.tree.TreePathMaxima.IResult (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.Queries.html b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.Queries.html index c5343b8f28..1d1efdbd8e 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.Queries.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.Queries.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.tree.TreePathMaxima.Queries (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.Result.html b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.Result.html index 7c5216308a..cea7979f29 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.Result.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.Result.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.tree.TreePathMaxima.Result (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.html b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.html index 70c7096d36..17f6253034 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/TreePathMaxima.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.alg.tree.TreePathMaxima (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/Trees.html b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/Trees.html index 8f2fa4b685..6e1a52b444 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/Trees.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/class-use/Trees.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.alg.tree.Trees (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/package-summary.html b/0.4.1-snapshot/com/jgalgo/alg/tree/package-summary.html index 55bf86c4eb..ed6b2aaaa3 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.tree (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/package-tree.html b/0.4.1-snapshot/com/jgalgo/alg/tree/package-tree.html index c037961129..6d44255505 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.alg.tree Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/alg/tree/package-use.html b/0.4.1-snapshot/com/jgalgo/alg/tree/package-use.html index 28dc1ea8ce..bbee9fea68 100644 --- a/0.4.1-snapshot/com/jgalgo/alg/tree/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/alg/tree/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.alg.tree (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/class-use/JGAlgoConfig.html b/0.4.1-snapshot/com/jgalgo/class-use/JGAlgoConfig.html index 341dd97962..547ebbccd0 100644 --- a/0.4.1-snapshot/com/jgalgo/class-use/JGAlgoConfig.html +++ b/0.4.1-snapshot/com/jgalgo/class-use/JGAlgoConfig.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.JGAlgoConfig (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/example/BfsDfsExample.html b/0.4.1-snapshot/com/jgalgo/example/BfsDfsExample.html index 39a7172d92..ef3bd2ed85 100644 --- a/0.4.1-snapshot/com/jgalgo/example/BfsDfsExample.html +++ b/0.4.1-snapshot/com/jgalgo/example/BfsDfsExample.html @@ -2,10 +2,10 @@ - + BfsDfsExample (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/example/ColoringExample.html b/0.4.1-snapshot/com/jgalgo/example/ColoringExample.html index 2240c9fab0..879a4fffdb 100644 --- a/0.4.1-snapshot/com/jgalgo/example/ColoringExample.html +++ b/0.4.1-snapshot/com/jgalgo/example/ColoringExample.html @@ -2,10 +2,10 @@ - + ColoringExample (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/example/EdgeIterationExample.html b/0.4.1-snapshot/com/jgalgo/example/EdgeIterationExample.html index 78d45023a5..8c86caa44f 100644 --- a/0.4.1-snapshot/com/jgalgo/example/EdgeIterationExample.html +++ b/0.4.1-snapshot/com/jgalgo/example/EdgeIterationExample.html @@ -2,10 +2,10 @@ - + EdgeIterationExample (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/example/LowestCommonAncestorExample.html b/0.4.1-snapshot/com/jgalgo/example/LowestCommonAncestorExample.html index 93f3953704..715f7d52d9 100644 --- a/0.4.1-snapshot/com/jgalgo/example/LowestCommonAncestorExample.html +++ b/0.4.1-snapshot/com/jgalgo/example/LowestCommonAncestorExample.html @@ -2,10 +2,10 @@ - + LowestCommonAncestorExample (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/example/MaximumMatchingExample.html b/0.4.1-snapshot/com/jgalgo/example/MaximumMatchingExample.html index 1def1cc673..ad54b81ed9 100644 --- a/0.4.1-snapshot/com/jgalgo/example/MaximumMatchingExample.html +++ b/0.4.1-snapshot/com/jgalgo/example/MaximumMatchingExample.html @@ -2,10 +2,10 @@ - + MaximumMatchingExample (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/example/MinimumSpanningTreeExample.html b/0.4.1-snapshot/com/jgalgo/example/MinimumSpanningTreeExample.html index a66e416edf..fd3387a524 100644 --- a/0.4.1-snapshot/com/jgalgo/example/MinimumSpanningTreeExample.html +++ b/0.4.1-snapshot/com/jgalgo/example/MinimumSpanningTreeExample.html @@ -2,10 +2,10 @@ - + MinimumSpanningTreeExample (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/example/ShortestPathExample.html b/0.4.1-snapshot/com/jgalgo/example/ShortestPathExample.html index f03be71565..de9093c8e2 100644 --- a/0.4.1-snapshot/com/jgalgo/example/ShortestPathExample.html +++ b/0.4.1-snapshot/com/jgalgo/example/ShortestPathExample.html @@ -2,10 +2,10 @@ - + ShortestPathExample (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/example/class-use/BfsDfsExample.html b/0.4.1-snapshot/com/jgalgo/example/class-use/BfsDfsExample.html index 1767c10fd7..a6cce883f6 100644 --- a/0.4.1-snapshot/com/jgalgo/example/class-use/BfsDfsExample.html +++ b/0.4.1-snapshot/com/jgalgo/example/class-use/BfsDfsExample.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.example.BfsDfsExample (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/example/class-use/ColoringExample.html b/0.4.1-snapshot/com/jgalgo/example/class-use/ColoringExample.html index 8f3cfd1915..2f7f1beda0 100644 --- a/0.4.1-snapshot/com/jgalgo/example/class-use/ColoringExample.html +++ b/0.4.1-snapshot/com/jgalgo/example/class-use/ColoringExample.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.example.ColoringExample (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/example/class-use/EdgeIterationExample.html b/0.4.1-snapshot/com/jgalgo/example/class-use/EdgeIterationExample.html index f6f3e1a1d1..d4a376319d 100644 --- a/0.4.1-snapshot/com/jgalgo/example/class-use/EdgeIterationExample.html +++ b/0.4.1-snapshot/com/jgalgo/example/class-use/EdgeIterationExample.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.example.EdgeIterationExample (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/example/class-use/LowestCommonAncestorExample.html b/0.4.1-snapshot/com/jgalgo/example/class-use/LowestCommonAncestorExample.html index a623cf44a7..eb92afeb61 100644 --- a/0.4.1-snapshot/com/jgalgo/example/class-use/LowestCommonAncestorExample.html +++ b/0.4.1-snapshot/com/jgalgo/example/class-use/LowestCommonAncestorExample.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.example.LowestCommonAncestorExample (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/example/class-use/MaximumMatchingExample.html b/0.4.1-snapshot/com/jgalgo/example/class-use/MaximumMatchingExample.html index 299e8d16f8..be67ce315b 100644 --- a/0.4.1-snapshot/com/jgalgo/example/class-use/MaximumMatchingExample.html +++ b/0.4.1-snapshot/com/jgalgo/example/class-use/MaximumMatchingExample.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.example.MaximumMatchingExample (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/example/class-use/MinimumSpanningTreeExample.html b/0.4.1-snapshot/com/jgalgo/example/class-use/MinimumSpanningTreeExample.html index 41bf2075a3..fc91aeeb90 100644 --- a/0.4.1-snapshot/com/jgalgo/example/class-use/MinimumSpanningTreeExample.html +++ b/0.4.1-snapshot/com/jgalgo/example/class-use/MinimumSpanningTreeExample.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.example.MinimumSpanningTreeExample (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/example/class-use/ShortestPathExample.html b/0.4.1-snapshot/com/jgalgo/example/class-use/ShortestPathExample.html index 9a04bd6f9b..9ef47c2a56 100644 --- a/0.4.1-snapshot/com/jgalgo/example/class-use/ShortestPathExample.html +++ b/0.4.1-snapshot/com/jgalgo/example/class-use/ShortestPathExample.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.example.ShortestPathExample (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/example/package-summary.html b/0.4.1-snapshot/com/jgalgo/example/package-summary.html index 9ea7f2d528..d6bdd3f6ed 100644 --- a/0.4.1-snapshot/com/jgalgo/example/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/example/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.example (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/example/package-tree.html b/0.4.1-snapshot/com/jgalgo/example/package-tree.html index 39ba4482d4..bf912be372 100644 --- a/0.4.1-snapshot/com/jgalgo/example/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/example/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.example Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/example/package-use.html b/0.4.1-snapshot/com/jgalgo/example/package-use.html index f621933587..b9cbe9e78a 100644 --- a/0.4.1-snapshot/com/jgalgo/example/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/example/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.example (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/BarabasiAlbertGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/BarabasiAlbertGraphGenerator.html index 7af9deb671..0a851f3b6d 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/BarabasiAlbertGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/BarabasiAlbertGraphGenerator.html @@ -2,10 +2,10 @@ - + BarabasiAlbertGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/ComplementGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/ComplementGraphGenerator.html index 554089c366..2a7168e8a3 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/ComplementGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/ComplementGraphGenerator.html @@ -2,10 +2,10 @@ - + ComplementGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/CompleteBipartiteGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/CompleteBipartiteGraphGenerator.html index e7102b6140..54d8d427d9 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/CompleteBipartiteGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/CompleteBipartiteGraphGenerator.html @@ -2,10 +2,10 @@ - + CompleteBipartiteGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/CompleteGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/CompleteGraphGenerator.html index 3afa67e510..dafd954c37 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/CompleteGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/CompleteGraphGenerator.html @@ -2,10 +2,10 @@ - + CompleteGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/DifferenceGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/DifferenceGraphGenerator.html index 9cf93eb325..2e96332be1 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/DifferenceGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/DifferenceGraphGenerator.html @@ -2,10 +2,10 @@ - + DifferenceGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/EmptyGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/EmptyGraphGenerator.html index 3e79aac5bf..9bf4420e94 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/EmptyGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/EmptyGraphGenerator.html @@ -2,10 +2,10 @@ - + EmptyGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/GnmBipartiteGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/GnmBipartiteGraphGenerator.html index 3b39ba2ff7..677c5929d6 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/GnmBipartiteGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/GnmBipartiteGraphGenerator.html @@ -2,10 +2,10 @@ - + GnmBipartiteGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/GnmGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/GnmGraphGenerator.html index 47a5687c03..c04cbbaae5 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/GnmGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/GnmGraphGenerator.html @@ -2,10 +2,10 @@ - + GnmGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/GnpBipartiteGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/GnpBipartiteGraphGenerator.html index b4ff9b6477..121425d34e 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/GnpBipartiteGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/GnpBipartiteGraphGenerator.html @@ -2,10 +2,10 @@ - + GnpBipartiteGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/GnpGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/GnpGraphGenerator.html index ad57b4b788..ed4c78e672 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/GnpGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/GnpGraphGenerator.html @@ -2,10 +2,10 @@ - + GnpGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/GraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/GraphGenerator.html index 9ac8306037..544001fdef 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/GraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/GraphGenerator.html @@ -2,10 +2,10 @@ - + GraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/IntersectionGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/IntersectionGraphGenerator.html index 709edff546..68cb783f37 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/IntersectionGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/IntersectionGraphGenerator.html @@ -2,10 +2,10 @@ - + IntersectionGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/LineGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/LineGraphGenerator.html index aec6fb8185..e4e63ef116 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/LineGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/LineGraphGenerator.html @@ -2,10 +2,10 @@ - + LineGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/RecursiveMatrixGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/RecursiveMatrixGraphGenerator.html index 2c0c450f8a..eaf1bcd338 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/RecursiveMatrixGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/RecursiveMatrixGraphGenerator.html @@ -2,10 +2,10 @@ - + RecursiveMatrixGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/SymmetricDifferenceGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/SymmetricDifferenceGraphGenerator.html index 75c2ba28fb..0dbfc8d601 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/SymmetricDifferenceGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/SymmetricDifferenceGraphGenerator.html @@ -2,10 +2,10 @@ - + SymmetricDifferenceGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/UniformTreeGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/UniformTreeGenerator.html index 03245b3cfe..8c0662cf4d 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/UniformTreeGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/UniformTreeGenerator.html @@ -2,10 +2,10 @@ - + UniformTreeGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/UnionGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/UnionGraphGenerator.html index 65737aa58c..e00871a1e9 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/UnionGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/UnionGraphGenerator.html @@ -2,10 +2,10 @@ - + UnionGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/class-use/BarabasiAlbertGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/class-use/BarabasiAlbertGraphGenerator.html index 1ac3d4e725..66503c7675 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/class-use/BarabasiAlbertGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/class-use/BarabasiAlbertGraphGenerator.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.gen.BarabasiAlbertGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/class-use/ComplementGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/class-use/ComplementGraphGenerator.html index 1afd981043..e71c7c8390 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/class-use/ComplementGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/class-use/ComplementGraphGenerator.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.gen.ComplementGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/class-use/CompleteBipartiteGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/class-use/CompleteBipartiteGraphGenerator.html index 2f82d8bbba..8cfcb11bd6 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/class-use/CompleteBipartiteGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/class-use/CompleteBipartiteGraphGenerator.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.gen.CompleteBipartiteGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/class-use/CompleteGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/class-use/CompleteGraphGenerator.html index b7e0f80eed..e294369ef6 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/class-use/CompleteGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/class-use/CompleteGraphGenerator.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.gen.CompleteGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/class-use/DifferenceGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/class-use/DifferenceGraphGenerator.html index 21029ec025..68622ba90d 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/class-use/DifferenceGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/class-use/DifferenceGraphGenerator.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.gen.DifferenceGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/class-use/EmptyGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/class-use/EmptyGraphGenerator.html index c5c9472513..56c6685c79 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/class-use/EmptyGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/class-use/EmptyGraphGenerator.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.gen.EmptyGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/class-use/GnmBipartiteGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/class-use/GnmBipartiteGraphGenerator.html index 3bcb7de738..dce7b68ce6 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/class-use/GnmBipartiteGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/class-use/GnmBipartiteGraphGenerator.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.gen.GnmBipartiteGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/class-use/GnmGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/class-use/GnmGraphGenerator.html index 2f4d73a372..b4559f2358 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/class-use/GnmGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/class-use/GnmGraphGenerator.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.gen.GnmGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/class-use/GnpBipartiteGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/class-use/GnpBipartiteGraphGenerator.html index 2dfcd0277b..a7a58a1f19 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/class-use/GnpBipartiteGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/class-use/GnpBipartiteGraphGenerator.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.gen.GnpBipartiteGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/class-use/GnpGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/class-use/GnpGraphGenerator.html index 0a86db630b..9521a07663 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/class-use/GnpGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/class-use/GnpGraphGenerator.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.gen.GnpGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/class-use/GraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/class-use/GraphGenerator.html index 7ae8b92de9..c2fbeb741f 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/class-use/GraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/class-use/GraphGenerator.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.gen.GraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/class-use/IntersectionGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/class-use/IntersectionGraphGenerator.html index 13fc431665..89439c71bc 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/class-use/IntersectionGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/class-use/IntersectionGraphGenerator.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.gen.IntersectionGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/class-use/LineGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/class-use/LineGraphGenerator.html index 818a34e2b4..7311472eb5 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/class-use/LineGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/class-use/LineGraphGenerator.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.gen.LineGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/class-use/RecursiveMatrixGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/class-use/RecursiveMatrixGraphGenerator.html index 16aa16bab7..c67b510eff 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/class-use/RecursiveMatrixGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/class-use/RecursiveMatrixGraphGenerator.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.gen.RecursiveMatrixGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/class-use/SymmetricDifferenceGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/class-use/SymmetricDifferenceGraphGenerator.html index 883b272703..53b0f1fa3b 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/class-use/SymmetricDifferenceGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/class-use/SymmetricDifferenceGraphGenerator.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.gen.SymmetricDifferenceGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/class-use/UniformTreeGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/class-use/UniformTreeGenerator.html index 94b80b2672..e263d61283 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/class-use/UniformTreeGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/class-use/UniformTreeGenerator.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.gen.UniformTreeGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/class-use/UnionGraphGenerator.html b/0.4.1-snapshot/com/jgalgo/gen/class-use/UnionGraphGenerator.html index 82c5a9afee..b1cb50be14 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/class-use/UnionGraphGenerator.html +++ b/0.4.1-snapshot/com/jgalgo/gen/class-use/UnionGraphGenerator.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.gen.UnionGraphGenerator (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/package-summary.html b/0.4.1-snapshot/com/jgalgo/gen/package-summary.html index 135650e6a8..c806cb7c39 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/gen/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.gen (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/package-tree.html b/0.4.1-snapshot/com/jgalgo/gen/package-tree.html index 3ee7ea92f1..66b14a2991 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/gen/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.gen Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/gen/package-use.html b/0.4.1-snapshot/com/jgalgo/gen/package-use.html index 71e5e5ce2e..5f765de8a0 100644 --- a/0.4.1-snapshot/com/jgalgo/gen/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/gen/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.gen (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/AbstractGraph.html b/0.4.1-snapshot/com/jgalgo/graph/AbstractGraph.html index cfa1b09602..1a5086e54a 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/AbstractGraph.html +++ b/0.4.1-snapshot/com/jgalgo/graph/AbstractGraph.html @@ -2,10 +2,10 @@ - + AbstractGraph (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/EdgeIter.html b/0.4.1-snapshot/com/jgalgo/graph/EdgeIter.html index d46a48bb26..de13df55e0 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/EdgeIter.html +++ b/0.4.1-snapshot/com/jgalgo/graph/EdgeIter.html @@ -2,10 +2,10 @@ - + EdgeIter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/EdgeSet.html b/0.4.1-snapshot/com/jgalgo/graph/EdgeSet.html index c0340f8efa..7482bf83c6 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/EdgeSet.html +++ b/0.4.1-snapshot/com/jgalgo/graph/EdgeSet.html @@ -2,10 +2,10 @@ - + EdgeSet (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/Graph.html b/0.4.1-snapshot/com/jgalgo/graph/Graph.html index d067ada4b3..3a77cf921e 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/Graph.html +++ b/0.4.1-snapshot/com/jgalgo/graph/Graph.html @@ -2,10 +2,10 @@ - + Graph (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/GraphBuilder.html b/0.4.1-snapshot/com/jgalgo/graph/GraphBuilder.html index dcbcff2a74..bca6216469 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/GraphBuilder.html +++ b/0.4.1-snapshot/com/jgalgo/graph/GraphBuilder.html @@ -2,10 +2,10 @@ - + GraphBuilder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/GraphFactory.Hint.html b/0.4.1-snapshot/com/jgalgo/graph/GraphFactory.Hint.html index bbf9a8f74e..aafce0f389 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/GraphFactory.Hint.html +++ b/0.4.1-snapshot/com/jgalgo/graph/GraphFactory.Hint.html @@ -2,10 +2,10 @@ - + GraphFactory.Hint (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/GraphFactory.html b/0.4.1-snapshot/com/jgalgo/graph/GraphFactory.html index 1f5a696cdd..e5a31578b8 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/GraphFactory.html +++ b/0.4.1-snapshot/com/jgalgo/graph/GraphFactory.html @@ -2,10 +2,10 @@ - + GraphFactory (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/Graphs.html b/0.4.1-snapshot/com/jgalgo/graph/Graphs.html index 101eb960e5..fdf7d36149 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/Graphs.html +++ b/0.4.1-snapshot/com/jgalgo/graph/Graphs.html @@ -2,10 +2,10 @@ - + Graphs (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IEdgeIter.html b/0.4.1-snapshot/com/jgalgo/graph/IEdgeIter.html index 26d0c4ab80..d928fa9cb6 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IEdgeIter.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IEdgeIter.html @@ -2,10 +2,10 @@ - + IEdgeIter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IEdgeSet.html b/0.4.1-snapshot/com/jgalgo/graph/IEdgeSet.html index 4bd93cc5c0..70300a6bad 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IEdgeSet.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IEdgeSet.html @@ -2,10 +2,10 @@ - + IEdgeSet (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IWeightFunction.html b/0.4.1-snapshot/com/jgalgo/graph/IWeightFunction.html index 5bcf3a3a32..e289da50d5 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IWeightFunction.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IWeightFunction.html @@ -2,10 +2,10 @@ - + IWeightFunction (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IWeightFunctionInt.html b/0.4.1-snapshot/com/jgalgo/graph/IWeightFunctionInt.html index d62aa51818..922a31c524 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IWeightFunctionInt.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IWeightFunctionInt.html @@ -2,10 +2,10 @@ - + IWeightFunctionInt (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IWeights.html b/0.4.1-snapshot/com/jgalgo/graph/IWeights.html index 1058d57af9..a7f5a45ccf 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IWeights.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IWeights.html @@ -2,10 +2,10 @@ - + IWeights (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IWeightsBool.html b/0.4.1-snapshot/com/jgalgo/graph/IWeightsBool.html index 8371d92d39..725131eea2 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IWeightsBool.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IWeightsBool.html @@ -2,10 +2,10 @@ - + IWeightsBool (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IWeightsByte.html b/0.4.1-snapshot/com/jgalgo/graph/IWeightsByte.html index c432108eeb..385a415cbb 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IWeightsByte.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IWeightsByte.html @@ -2,10 +2,10 @@ - + IWeightsByte (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IWeightsChar.html b/0.4.1-snapshot/com/jgalgo/graph/IWeightsChar.html index 68b811b100..b41c845a5b 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IWeightsChar.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IWeightsChar.html @@ -2,10 +2,10 @@ - + IWeightsChar (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IWeightsDouble.html b/0.4.1-snapshot/com/jgalgo/graph/IWeightsDouble.html index 7b544ec4b5..3f309dc831 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IWeightsDouble.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IWeightsDouble.html @@ -2,10 +2,10 @@ - + IWeightsDouble (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IWeightsFloat.html b/0.4.1-snapshot/com/jgalgo/graph/IWeightsFloat.html index 41d2edc358..a038565a9d 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IWeightsFloat.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IWeightsFloat.html @@ -2,10 +2,10 @@ - + IWeightsFloat (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IWeightsInt.html b/0.4.1-snapshot/com/jgalgo/graph/IWeightsInt.html index eacff40a97..e05459287e 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IWeightsInt.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IWeightsInt.html @@ -2,10 +2,10 @@ - + IWeightsInt (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IWeightsLong.html b/0.4.1-snapshot/com/jgalgo/graph/IWeightsLong.html index 4054d8e1ea..907904e61b 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IWeightsLong.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IWeightsLong.html @@ -2,10 +2,10 @@ - + IWeightsLong (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IWeightsObj.html b/0.4.1-snapshot/com/jgalgo/graph/IWeightsObj.html index f2cc3e15d5..522a58f29e 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IWeightsObj.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IWeightsObj.html @@ -2,10 +2,10 @@ - + IWeightsObj (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IWeightsShort.html b/0.4.1-snapshot/com/jgalgo/graph/IWeightsShort.html index 5102e3b9aa..f24571a63f 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IWeightsShort.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IWeightsShort.html @@ -2,10 +2,10 @@ - + IWeightsShort (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IdBuilder.html b/0.4.1-snapshot/com/jgalgo/graph/IdBuilder.html index 7a484575c9..d0c025bb74 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IdBuilder.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IdBuilder.html @@ -2,10 +2,10 @@ - + IdBuilder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IdBuilderInt.html b/0.4.1-snapshot/com/jgalgo/graph/IdBuilderInt.html index 960997b87e..4e5f398cd5 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IdBuilderInt.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IdBuilderInt.html @@ -2,10 +2,10 @@ - + IdBuilderInt (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IndexGraph.html b/0.4.1-snapshot/com/jgalgo/graph/IndexGraph.html index 6767d1ec49..bca89cb701 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IndexGraph.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IndexGraph.html @@ -2,10 +2,10 @@ - + IndexGraph (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IndexGraphBuilder.ReIndexedGraph.html b/0.4.1-snapshot/com/jgalgo/graph/IndexGraphBuilder.ReIndexedGraph.html index 72d3128dd0..9bbe767eb4 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IndexGraphBuilder.ReIndexedGraph.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IndexGraphBuilder.ReIndexedGraph.html @@ -2,10 +2,10 @@ - + IndexGraphBuilder.ReIndexedGraph (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IndexGraphBuilder.ReIndexingMap.html b/0.4.1-snapshot/com/jgalgo/graph/IndexGraphBuilder.ReIndexingMap.html index 330c991de9..c0b0dd5643 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IndexGraphBuilder.ReIndexingMap.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IndexGraphBuilder.ReIndexingMap.html @@ -2,10 +2,10 @@ - + IndexGraphBuilder.ReIndexingMap (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IndexGraphBuilder.html b/0.4.1-snapshot/com/jgalgo/graph/IndexGraphBuilder.html index 4b42bc1aff..be1fd07a46 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IndexGraphBuilder.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IndexGraphBuilder.html @@ -2,10 +2,10 @@ - + IndexGraphBuilder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IndexGraphFactory.html b/0.4.1-snapshot/com/jgalgo/graph/IndexGraphFactory.html index 249d65aed7..cdd6b458e8 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IndexGraphFactory.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IndexGraphFactory.html @@ -2,10 +2,10 @@ - + IndexGraphFactory (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IndexIdMap.html b/0.4.1-snapshot/com/jgalgo/graph/IndexIdMap.html index fa4a82a2c1..7d6a9686c8 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IndexIdMap.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IndexIdMap.html @@ -2,10 +2,10 @@ - + IndexIdMap (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IndexIdMaps.html b/0.4.1-snapshot/com/jgalgo/graph/IndexIdMaps.html index da24f91770..cbdb603e1f 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IndexIdMaps.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IndexIdMaps.html @@ -2,10 +2,10 @@ - + IndexIdMaps (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IndexIntIdMap.html b/0.4.1-snapshot/com/jgalgo/graph/IndexIntIdMap.html index e1c53dad0c..e0b4c5f765 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IndexIntIdMap.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IndexIntIdMap.html @@ -2,10 +2,10 @@ - + IndexIntIdMap (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IndexRemoveListener.html b/0.4.1-snapshot/com/jgalgo/graph/IndexRemoveListener.html index fcf4d99459..9fb232c2ff 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IndexRemoveListener.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IndexRemoveListener.html @@ -2,10 +2,10 @@ - + IndexRemoveListener (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IntGraph.html b/0.4.1-snapshot/com/jgalgo/graph/IntGraph.html index d1e11a98a3..a4723ae6db 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IntGraph.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IntGraph.html @@ -2,10 +2,10 @@ - + IntGraph (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IntGraphBuilder.html b/0.4.1-snapshot/com/jgalgo/graph/IntGraphBuilder.html index f01e951349..cfb1bb7f6c 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IntGraphBuilder.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IntGraphBuilder.html @@ -2,10 +2,10 @@ - + IntGraphBuilder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/IntGraphFactory.html b/0.4.1-snapshot/com/jgalgo/graph/IntGraphFactory.html index 96bd60d865..b8795296fd 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/IntGraphFactory.html +++ b/0.4.1-snapshot/com/jgalgo/graph/IntGraphFactory.html @@ -2,10 +2,10 @@ - + IntGraphFactory (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/NoSuchEdgeException.html b/0.4.1-snapshot/com/jgalgo/graph/NoSuchEdgeException.html index c29de5b8b0..40f742b7e1 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/NoSuchEdgeException.html +++ b/0.4.1-snapshot/com/jgalgo/graph/NoSuchEdgeException.html @@ -2,10 +2,10 @@ - + NoSuchEdgeException (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/NoSuchVertexException.html b/0.4.1-snapshot/com/jgalgo/graph/NoSuchVertexException.html index 069efc8227..09de32c26f 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/NoSuchVertexException.html +++ b/0.4.1-snapshot/com/jgalgo/graph/NoSuchVertexException.html @@ -2,10 +2,10 @@ - + NoSuchVertexException (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/WeightFunction.html b/0.4.1-snapshot/com/jgalgo/graph/WeightFunction.html index 529be577b2..ae7b010a15 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/WeightFunction.html +++ b/0.4.1-snapshot/com/jgalgo/graph/WeightFunction.html @@ -2,10 +2,10 @@ - + WeightFunction (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/WeightFunctionInt.html b/0.4.1-snapshot/com/jgalgo/graph/WeightFunctionInt.html index c8211ef07a..9eb80990b6 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/WeightFunctionInt.html +++ b/0.4.1-snapshot/com/jgalgo/graph/WeightFunctionInt.html @@ -2,10 +2,10 @@ - + WeightFunctionInt (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/WeightFunctions.html b/0.4.1-snapshot/com/jgalgo/graph/WeightFunctions.html index 02d272fc5e..0082e8afc7 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/WeightFunctions.html +++ b/0.4.1-snapshot/com/jgalgo/graph/WeightFunctions.html @@ -2,10 +2,10 @@ - + WeightFunctions (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/Weights.html b/0.4.1-snapshot/com/jgalgo/graph/Weights.html index 4751b9bb1f..84ad0ab778 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/Weights.html +++ b/0.4.1-snapshot/com/jgalgo/graph/Weights.html @@ -2,10 +2,10 @@ - + Weights (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/WeightsBool.html b/0.4.1-snapshot/com/jgalgo/graph/WeightsBool.html index 66f300a5e9..ee562c4a9c 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/WeightsBool.html +++ b/0.4.1-snapshot/com/jgalgo/graph/WeightsBool.html @@ -2,10 +2,10 @@ - + WeightsBool (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/WeightsByte.html b/0.4.1-snapshot/com/jgalgo/graph/WeightsByte.html index 1000026e6c..73270f87fa 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/WeightsByte.html +++ b/0.4.1-snapshot/com/jgalgo/graph/WeightsByte.html @@ -2,10 +2,10 @@ - + WeightsByte (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/WeightsChar.html b/0.4.1-snapshot/com/jgalgo/graph/WeightsChar.html index ef696c3bc0..d46fcb5036 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/WeightsChar.html +++ b/0.4.1-snapshot/com/jgalgo/graph/WeightsChar.html @@ -2,10 +2,10 @@ - + WeightsChar (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/WeightsDouble.html b/0.4.1-snapshot/com/jgalgo/graph/WeightsDouble.html index 4cbedd5b67..2a7de53aed 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/WeightsDouble.html +++ b/0.4.1-snapshot/com/jgalgo/graph/WeightsDouble.html @@ -2,10 +2,10 @@ - + WeightsDouble (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/WeightsFloat.html b/0.4.1-snapshot/com/jgalgo/graph/WeightsFloat.html index 247fedc370..d452ae8e67 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/WeightsFloat.html +++ b/0.4.1-snapshot/com/jgalgo/graph/WeightsFloat.html @@ -2,10 +2,10 @@ - + WeightsFloat (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/WeightsInt.html b/0.4.1-snapshot/com/jgalgo/graph/WeightsInt.html index 96755e3b4b..49f299fce5 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/WeightsInt.html +++ b/0.4.1-snapshot/com/jgalgo/graph/WeightsInt.html @@ -2,10 +2,10 @@ - + WeightsInt (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/WeightsLong.html b/0.4.1-snapshot/com/jgalgo/graph/WeightsLong.html index fa7999070b..155893ee41 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/WeightsLong.html +++ b/0.4.1-snapshot/com/jgalgo/graph/WeightsLong.html @@ -2,10 +2,10 @@ - + WeightsLong (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/WeightsObj.html b/0.4.1-snapshot/com/jgalgo/graph/WeightsObj.html index f23e49bd0f..bb4090b614 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/WeightsObj.html +++ b/0.4.1-snapshot/com/jgalgo/graph/WeightsObj.html @@ -2,10 +2,10 @@ - + WeightsObj (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/WeightsShort.html b/0.4.1-snapshot/com/jgalgo/graph/WeightsShort.html index 14c7bc0312..6a33b5d8ae 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/WeightsShort.html +++ b/0.4.1-snapshot/com/jgalgo/graph/WeightsShort.html @@ -2,10 +2,10 @@ - + WeightsShort (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/AbstractGraph.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/AbstractGraph.html index 455b4f3029..5407079384 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/AbstractGraph.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/AbstractGraph.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.graph.AbstractGraph (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/EdgeIter.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/EdgeIter.html index b5207d80ff..6cfb65ae59 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/EdgeIter.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/EdgeIter.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.EdgeIter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/EdgeSet.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/EdgeSet.html index e0f17f3abd..a74d713e99 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/EdgeSet.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/EdgeSet.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.EdgeSet (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/Graph.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/Graph.html index 7d0d74d42f..c427fada8d 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/Graph.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/Graph.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.Graph (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -993,6 +993,12 @@

    Uses of Graph<
    Compute the cores of the graph with respect the given degree type.
    + +<V,​E>
    CoresAlgo.Result<V,​E> +CoresAlgoAbstract.computeCores​(Graph<V,​E> g, + EdgeDirection degreeType) +  + @@ -1028,6 +1034,13 @@

    Uses of Graph< +<V,​E>
    Set<V> +DominatingSetAlgoAbstract.computeMinimumDominationSet​(Graph<V,​E> g, + WeightFunction<V> w, + EdgeDirection dominanceDirection) +  + + <V,​E>
    Set<E>
    EdgeCover.computeMinimumEdgeCover​(Graph<V,​E> g, WeightFunction<E> w) @@ -1035,6 +1048,12 @@

    Uses of Graph<
    Compute a minimum edge cover of a graph with respect to an edge weight function.
    + +<V,​E>
    Set<E> +EdgeCoverAbstract.computeMinimumEdgeCover​(Graph<V,​E> g, + WeightFunction<E> w) +  + <V,​E>
    Set<V>
    VertexCover.computeMinimumVertexCover​(Graph<V,​E> g, @@ -1044,6 +1063,12 @@

    Uses of Graph< +<V,​E>
    Set<V> +VertexCoverAbstract.computeMinimumVertexCover​(Graph<V,​E> g, + WeightFunction<V> w) +  + + static <V,​E>
    boolean
    EdgeCover.isCover​(Graph<V,​E> g, Collection<E> edges) @@ -1051,7 +1076,7 @@

    Uses of Graph<
    Check whether a set of edges is a edge cover of a graph.
    - + static <V,​E>
    boolean
    VertexCover.
    isCover​(Graph<V,​E> g, Collection<V> vertices) @@ -1059,7 +1084,7 @@

    Uses of Graph<
    Check whether a set of vertices is a vertex cover of a graph.
    - + static <V,​E>
    boolean
    DominatingSetAlgo.
    isDominatingSet​(Graph<V,​E> g, Collection<V> dominatingSet, @@ -1086,13 +1111,6 @@

    Uses of Graph< -default <V,​E>
    List<Path<V,​E>> -CyclesEnumerator.allCycles​(Graph<V,​E> g) - -
    Find all cycles in the given graph.
    - - - <V,​E>
    Path<V,​E>
    MinimumMeanCycle.computeMinimumMeanCycle​(Graph<V,​E> g, WeightFunction<E> w) @@ -1100,8 +1118,14 @@

    Uses of Graph<
    Compute the minimum mean cycle in a graph.
    - + <V,​E>
    Path<V,​E> +MinimumMeanCycleAbstract.computeMinimumMeanCycle​(Graph<V,​E> g, + WeightFunction<E> w) +  + + +default <V,​E>
    Path<V,​E>
    ChinesePostman.computeShortestEdgeVisitorCircle​(Graph<V,​E> g, WeightFunction<E> w) @@ -1109,12 +1133,31 @@

    Uses of Graph< +<V,​E>
    Optional<Path<V,​E>> +ChinesePostman.computeShortestEdgeVisitorCircleIfExist​(Graph<V,​E> g, + WeightFunction<E> w) + +
    Compute the shortest circuit that visits all edges in the graph at least once, if it exist.
    + + + +<V,​E>
    Optional<Path<V,​E>>
    +ChinesePostmanAbstract.computeShortestEdgeVisitorCircleIfExist​(Graph<V,​E> g, + WeightFunction<E> w) +  + + <V,​E>
    Iterator<Path<V,​E>>
    CyclesEnumerator.cyclesIter​(Graph<V,​E> g)
    Iterate over all cycles in the given graph.
    + +<V,​E>
    Iterator<Path<V,​E>>
    +CyclesEnumeratorAbstract.cyclesIter​(Graph<V,​E> g) +  + @@ -1133,12 +1176,24 @@

    Uses of Graph< -<V,​E>
    TopologicalOrderAlgo.Result<V,​E> +default <V,​E>
    TopologicalOrderAlgo.Result<V,​E>
    TopologicalOrderAlgo.computeTopologicalSorting​(Graph<V,​E> g) -
    Compute the topological order of a DAG vertices.
    +
    Compute the topological order of the vertices in a DAG graph.
    + +<V,​E>
    Optional<TopologicalOrderAlgo.Result<V,​E>>
    +TopologicalOrderAlgo.computeTopologicalSortingIfExist​(Graph<V,​E> g) + +
    Compute the topological order of the vertices, if the graph is DAG.
    + + + +<V,​E>
    Optional<TopologicalOrderAlgo.Result<V,​E>>
    +TopologicalOrderAlgoAbstract.computeTopologicalSortingIfExist​(Graph<V,​E> g) +  + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/GraphBuilder.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/GraphBuilder.html index 1ff0a55836..d9129140c3 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/GraphBuilder.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/GraphBuilder.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.GraphBuilder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/GraphFactory.Hint.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/GraphFactory.Hint.html index e09b6f6e2e..f576c7ff96 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/GraphFactory.Hint.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/GraphFactory.Hint.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.graph.GraphFactory.Hint (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/GraphFactory.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/GraphFactory.html index 1c7a2765fc..e7a6f49c9d 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/GraphFactory.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/GraphFactory.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.GraphFactory (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/Graphs.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/Graphs.html index cb769c1fb0..63952f8a08 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/Graphs.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/Graphs.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.graph.Graphs (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IEdgeIter.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IEdgeIter.html index c638c1f8a4..12536397b0 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IEdgeIter.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IEdgeIter.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IEdgeIter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IEdgeSet.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IEdgeSet.html index 357123be30..2fdadaf4fc 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IEdgeSet.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IEdgeSet.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IEdgeSet (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightFunction.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightFunction.html index 828c40db05..ec9e9103ba 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightFunction.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightFunction.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IWeightFunction (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightFunctionInt.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightFunctionInt.html index f9e66661b3..94fb1b4999 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightFunctionInt.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightFunctionInt.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IWeightFunctionInt (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeights.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeights.html index 7e8cfda9c0..0abf7811a3 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeights.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeights.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IWeights (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsBool.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsBool.html index 93e79a37b9..696e5836e9 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsBool.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsBool.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IWeightsBool (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsByte.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsByte.html index 7daf73aa81..caaa9de012 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsByte.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsByte.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IWeightsByte (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsChar.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsChar.html index 0027483e89..b4a30f6c52 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsChar.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsChar.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IWeightsChar (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsDouble.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsDouble.html index 60da838659..3813470a73 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsDouble.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsDouble.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IWeightsDouble (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsFloat.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsFloat.html index fe70e5b57f..5188c935b6 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsFloat.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsFloat.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IWeightsFloat (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsInt.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsInt.html index a180211d28..79b74b2484 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsInt.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsInt.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IWeightsInt (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsLong.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsLong.html index b6c648322a..dd2c52e9a7 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsLong.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsLong.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IWeightsLong (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsObj.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsObj.html index fa4be9814f..3f16f1efef 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsObj.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsObj.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IWeightsObj (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsShort.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsShort.html index d7e5cd57c8..561fab6137 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsShort.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IWeightsShort.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IWeightsShort (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IdBuilder.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IdBuilder.html index 8e6a6b1798..6dee9d10da 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IdBuilder.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IdBuilder.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IdBuilder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IdBuilderInt.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IdBuilderInt.html index a021e6eda9..133a7f98ec 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IdBuilderInt.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IdBuilderInt.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IdBuilderInt (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexGraph.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexGraph.html index bdcbf64f82..741c9f8822 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexGraph.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexGraph.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IndexGraph (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -127,13 +127,6 @@

    Uses of -com.jgalgo.alg.connect - -
    Algorithms for solving connectivity problems, such as strongly/weakly connected components, minimum edge/vertex cuts, - ect.
    - - - com.jgalgo.graph
    Graphs object are the fundamental building blocks of the JGAlgo library.
    @@ -223,28 +216,6 @@

    Uses of I
  • -
    - - -

    Uses of IndexGraph in com.jgalgo.alg.connect

    - - - - - - - - - - - - - - -
    Methods in com.jgalgo.alg.connect with parameters of type IndexGraph 
    Modifier and TypeMethodDescription
    IVertexPartitionWeaklyConnectedComponentsAlgoImpl.findWeaklyConnectedComponents​(IndexGraph g) 
    -
    -
  • -
  • diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexGraphBuilder.ReIndexedGraph.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexGraphBuilder.ReIndexedGraph.html index 34f878b8a2..928346a1b7 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexGraphBuilder.ReIndexedGraph.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexGraphBuilder.ReIndexedGraph.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.graph.IndexGraphBuilder.ReIndexedGraph (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexGraphBuilder.ReIndexingMap.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexGraphBuilder.ReIndexingMap.html index d282688434..f07b220b88 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexGraphBuilder.ReIndexingMap.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexGraphBuilder.ReIndexingMap.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.graph.IndexGraphBuilder.ReIndexingMap (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexGraphBuilder.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexGraphBuilder.html index a26aa3cd2d..c4717987bf 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexGraphBuilder.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexGraphBuilder.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IndexGraphBuilder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexGraphFactory.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexGraphFactory.html index 46748300e1..1a33ffb176 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexGraphFactory.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexGraphFactory.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IndexGraphFactory (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexIdMap.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexIdMap.html index 74f5a18423..fafa31ad09 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexIdMap.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexIdMap.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IndexIdMap (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexIdMaps.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexIdMaps.html index 28fe185a65..6874ddff61 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexIdMaps.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexIdMaps.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.graph.IndexIdMaps (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexIntIdMap.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexIntIdMap.html index 508896c142..c3b1402b5b 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexIntIdMap.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexIntIdMap.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IndexIntIdMap (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexRemoveListener.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexRemoveListener.html index 219464ee7e..8d933dc69d 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexRemoveListener.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IndexRemoveListener.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IndexRemoveListener (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IntGraph.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IntGraph.html index 72891ab750..ec90f50d71 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IntGraph.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IntGraph.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IntGraph (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IntGraphBuilder.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IntGraphBuilder.html index f040c55dc9..14393a33c8 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IntGraphBuilder.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IntGraphBuilder.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IntGraphBuilder (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/IntGraphFactory.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/IntGraphFactory.html index 44381fa5e8..a1d2dce727 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/IntGraphFactory.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/IntGraphFactory.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.IntGraphFactory (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/NoSuchEdgeException.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/NoSuchEdgeException.html index f2170ada83..88375574d8 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/NoSuchEdgeException.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/NoSuchEdgeException.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.graph.NoSuchEdgeException (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/NoSuchVertexException.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/NoSuchVertexException.html index 6163dfdbd6..17015c3db6 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/NoSuchVertexException.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/NoSuchVertexException.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.graph.NoSuchVertexException (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightFunction.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightFunction.html index 1e5f8e4d59..93f7f69593 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightFunction.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightFunction.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.WeightFunction (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -392,6 +392,13 @@

    Uses of +<V,​E>
    Set<V> +DominatingSetAlgoAbstract.computeMinimumDominationSet​(Graph<V,​E> g, + WeightFunction<V> w, + EdgeDirection dominanceDirection) +  + + <V,​E>
    Set<E>
    EdgeCover.computeMinimumEdgeCover​(Graph<V,​E> g, WeightFunction<E> w) @@ -399,6 +406,12 @@

    Uses of Compute a minimum edge cover of a graph with respect to an edge weight function.

  • + +<V,​E>
    Set<E> +EdgeCoverAbstract.computeMinimumEdgeCover​(Graph<V,​E> g, + WeightFunction<E> w) +  + <V,​E>
    Set<V>
    VertexCover.computeMinimumVertexCover​(Graph<V,​E> g, @@ -407,6 +420,12 @@

    Uses of Compute a minimum vertex cover of a graph with respect to a vertex weight function. + +<V,​E>
    Set<V> +VertexCoverAbstract.computeMinimumVertexCover​(Graph<V,​E> g, + WeightFunction<V> w) +  + @@ -434,12 +453,32 @@

    Uses of <V,​E>
    Path<V,​E> +MinimumMeanCycleAbstract.computeMinimumMeanCycle​(Graph<V,​E> g, + WeightFunction<E> w) +  + + +default <V,​E>
    Path<V,​E>
    ChinesePostman.computeShortestEdgeVisitorCircle​(Graph<V,​E> g, WeightFunction<E> w)
    Compute the shortest circuit that visits all edges in the graph at least once.
    + +<V,​E>
    Optional<Path<V,​E>>
    +ChinesePostman.computeShortestEdgeVisitorCircleIfExist​(Graph<V,​E> g, + WeightFunction<E> w) + +
    Compute the shortest circuit that visits all edges in the graph at least once, if it exist.
    + + + +<V,​E>
    Optional<Path<V,​E>>
    +ChinesePostmanAbstract.computeShortestEdgeVisitorCircleIfExist​(Graph<V,​E> g, + WeightFunction<E> w) +  + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightFunctionInt.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightFunctionInt.html index 88f90dcefe..0d5dd8ed81 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightFunctionInt.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightFunctionInt.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.WeightFunctionInt (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightFunctions.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightFunctions.html index abfd938dbd..ac1134cadc 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightFunctions.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightFunctions.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.graph.WeightFunctions (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/Weights.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/Weights.html index dcd7822c56..aa824b18cc 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/Weights.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/Weights.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.Weights (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsBool.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsBool.html index 8ab4d3d751..e54fd88afc 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsBool.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsBool.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.WeightsBool (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsByte.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsByte.html index 24111febf0..5ffa2a2ce7 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsByte.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsByte.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.WeightsByte (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsChar.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsChar.html index 98801713f5..f1303c0c96 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsChar.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsChar.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.WeightsChar (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsDouble.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsDouble.html index 0f0b26eade..c41bf8355a 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsDouble.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsDouble.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.WeightsDouble (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsFloat.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsFloat.html index 6c619f4e0c..dc6b0beff2 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsFloat.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsFloat.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.WeightsFloat (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsInt.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsInt.html index e6ff540245..04323c22c0 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsInt.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsInt.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.WeightsInt (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsLong.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsLong.html index 1399b96e68..6b2a346959 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsLong.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsLong.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.WeightsLong (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsObj.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsObj.html index c94d59bdc8..a9ae781161 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsObj.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsObj.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.WeightsObj (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsShort.html b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsShort.html index ae4217032e..18280291d4 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsShort.html +++ b/0.4.1-snapshot/com/jgalgo/graph/class-use/WeightsShort.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.graph.WeightsShort (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/package-summary.html b/0.4.1-snapshot/com/jgalgo/graph/package-summary.html index d45fe28576..d3bc73ad83 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/graph/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.graph (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/package-tree.html b/0.4.1-snapshot/com/jgalgo/graph/package-tree.html index 52f2191834..87b2316c9b 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/graph/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.graph Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/graph/package-use.html b/0.4.1-snapshot/com/jgalgo/graph/package-use.html index 2b19d840ca..7afb126dd5 100644 --- a/0.4.1-snapshot/com/jgalgo/graph/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/graph/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.graph (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -518,18 +518,12 @@

    Uses of Package
    co -IndexGraph - -
    A graph whose vertices and edges identifiers are indices.
    - - - IntGraph
    A discrete graph with int vertices and edges.
    - + WeightFunction
    Weight function that maps graph edges or vertices to weights.
    diff --git a/0.4.1-snapshot/com/jgalgo/io/Digraph6GraphReader.html b/0.4.1-snapshot/com/jgalgo/io/Digraph6GraphReader.html index 8ed85fb590..8fd01c5219 100644 --- a/0.4.1-snapshot/com/jgalgo/io/Digraph6GraphReader.html +++ b/0.4.1-snapshot/com/jgalgo/io/Digraph6GraphReader.html @@ -2,10 +2,10 @@ - + Digraph6GraphReader (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/Digraph6GraphWriter.html b/0.4.1-snapshot/com/jgalgo/io/Digraph6GraphWriter.html index c218788d36..0bd3d47499 100644 --- a/0.4.1-snapshot/com/jgalgo/io/Digraph6GraphWriter.html +++ b/0.4.1-snapshot/com/jgalgo/io/Digraph6GraphWriter.html @@ -2,10 +2,10 @@ - + Digraph6GraphWriter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/DimacsGraphReader.html b/0.4.1-snapshot/com/jgalgo/io/DimacsGraphReader.html index 8f2c70614b..3b46520225 100644 --- a/0.4.1-snapshot/com/jgalgo/io/DimacsGraphReader.html +++ b/0.4.1-snapshot/com/jgalgo/io/DimacsGraphReader.html @@ -2,10 +2,10 @@ - + DimacsGraphReader (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/DimacsGraphWriter.html b/0.4.1-snapshot/com/jgalgo/io/DimacsGraphWriter.html index 068c0dea1a..f51a055097 100644 --- a/0.4.1-snapshot/com/jgalgo/io/DimacsGraphWriter.html +++ b/0.4.1-snapshot/com/jgalgo/io/DimacsGraphWriter.html @@ -2,10 +2,10 @@ - + DimacsGraphWriter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/GexfGraphReader.html b/0.4.1-snapshot/com/jgalgo/io/GexfGraphReader.html index 6ebd92a324..68271668ed 100644 --- a/0.4.1-snapshot/com/jgalgo/io/GexfGraphReader.html +++ b/0.4.1-snapshot/com/jgalgo/io/GexfGraphReader.html @@ -2,10 +2,10 @@ - + GexfGraphReader (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/GexfGraphWriter.html b/0.4.1-snapshot/com/jgalgo/io/GexfGraphWriter.html index 225240e4be..eed0bffa21 100644 --- a/0.4.1-snapshot/com/jgalgo/io/GexfGraphWriter.html +++ b/0.4.1-snapshot/com/jgalgo/io/GexfGraphWriter.html @@ -2,10 +2,10 @@ - + GexfGraphWriter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/GmlGraphReader.html b/0.4.1-snapshot/com/jgalgo/io/GmlGraphReader.html index 020e1d01b0..aa3f874df5 100644 --- a/0.4.1-snapshot/com/jgalgo/io/GmlGraphReader.html +++ b/0.4.1-snapshot/com/jgalgo/io/GmlGraphReader.html @@ -2,10 +2,10 @@ - + GmlGraphReader (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/GmlGraphWriter.html b/0.4.1-snapshot/com/jgalgo/io/GmlGraphWriter.html index 4d2d284d36..d4ceea4563 100644 --- a/0.4.1-snapshot/com/jgalgo/io/GmlGraphWriter.html +++ b/0.4.1-snapshot/com/jgalgo/io/GmlGraphWriter.html @@ -2,10 +2,10 @@ - + GmlGraphWriter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/Graph6GraphReader.html b/0.4.1-snapshot/com/jgalgo/io/Graph6GraphReader.html index 4936134bd1..584a7d30cc 100644 --- a/0.4.1-snapshot/com/jgalgo/io/Graph6GraphReader.html +++ b/0.4.1-snapshot/com/jgalgo/io/Graph6GraphReader.html @@ -2,10 +2,10 @@ - + Graph6GraphReader (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/Graph6GraphWriter.html b/0.4.1-snapshot/com/jgalgo/io/Graph6GraphWriter.html index 85c2fb571e..ee2d3252a5 100644 --- a/0.4.1-snapshot/com/jgalgo/io/Graph6GraphWriter.html +++ b/0.4.1-snapshot/com/jgalgo/io/Graph6GraphWriter.html @@ -2,10 +2,10 @@ - + Graph6GraphWriter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/GraphMlGraphReader.html b/0.4.1-snapshot/com/jgalgo/io/GraphMlGraphReader.html index 8f81d66f72..6812c03e79 100644 --- a/0.4.1-snapshot/com/jgalgo/io/GraphMlGraphReader.html +++ b/0.4.1-snapshot/com/jgalgo/io/GraphMlGraphReader.html @@ -2,10 +2,10 @@ - + GraphMlGraphReader (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/GraphMlGraphWriter.html b/0.4.1-snapshot/com/jgalgo/io/GraphMlGraphWriter.html index b6fcee4390..4a96c8c108 100644 --- a/0.4.1-snapshot/com/jgalgo/io/GraphMlGraphWriter.html +++ b/0.4.1-snapshot/com/jgalgo/io/GraphMlGraphWriter.html @@ -2,10 +2,10 @@ - + GraphMlGraphWriter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/GraphReader.html b/0.4.1-snapshot/com/jgalgo/io/GraphReader.html index 4c9c592266..abd16029dc 100644 --- a/0.4.1-snapshot/com/jgalgo/io/GraphReader.html +++ b/0.4.1-snapshot/com/jgalgo/io/GraphReader.html @@ -2,10 +2,10 @@ - + GraphReader (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/GraphWriter.html b/0.4.1-snapshot/com/jgalgo/io/GraphWriter.html index 4c6d7f21e0..0f66cbd023 100644 --- a/0.4.1-snapshot/com/jgalgo/io/GraphWriter.html +++ b/0.4.1-snapshot/com/jgalgo/io/GraphWriter.html @@ -2,10 +2,10 @@ - + GraphWriter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/LedaGraphReader.html b/0.4.1-snapshot/com/jgalgo/io/LedaGraphReader.html index cf69fed14e..7c40c97914 100644 --- a/0.4.1-snapshot/com/jgalgo/io/LedaGraphReader.html +++ b/0.4.1-snapshot/com/jgalgo/io/LedaGraphReader.html @@ -2,10 +2,10 @@ - + LedaGraphReader (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/LedaGraphWriter.html b/0.4.1-snapshot/com/jgalgo/io/LedaGraphWriter.html index 4c0668c62d..622ac251ac 100644 --- a/0.4.1-snapshot/com/jgalgo/io/LedaGraphWriter.html +++ b/0.4.1-snapshot/com/jgalgo/io/LedaGraphWriter.html @@ -2,10 +2,10 @@ - + LedaGraphWriter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/Sparse6GraphReader.html b/0.4.1-snapshot/com/jgalgo/io/Sparse6GraphReader.html index 988d38c045..268307eccc 100644 --- a/0.4.1-snapshot/com/jgalgo/io/Sparse6GraphReader.html +++ b/0.4.1-snapshot/com/jgalgo/io/Sparse6GraphReader.html @@ -2,10 +2,10 @@ - + Sparse6GraphReader (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/Sparse6GraphWriter.html b/0.4.1-snapshot/com/jgalgo/io/Sparse6GraphWriter.html index 42ee06027f..ca36296267 100644 --- a/0.4.1-snapshot/com/jgalgo/io/Sparse6GraphWriter.html +++ b/0.4.1-snapshot/com/jgalgo/io/Sparse6GraphWriter.html @@ -2,10 +2,10 @@ - + Sparse6GraphWriter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/class-use/Digraph6GraphReader.html b/0.4.1-snapshot/com/jgalgo/io/class-use/Digraph6GraphReader.html index c8b1ed8baa..067a46563e 100644 --- a/0.4.1-snapshot/com/jgalgo/io/class-use/Digraph6GraphReader.html +++ b/0.4.1-snapshot/com/jgalgo/io/class-use/Digraph6GraphReader.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.io.Digraph6GraphReader (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/class-use/Digraph6GraphWriter.html b/0.4.1-snapshot/com/jgalgo/io/class-use/Digraph6GraphWriter.html index 9de7b2e68b..6a32db4ba8 100644 --- a/0.4.1-snapshot/com/jgalgo/io/class-use/Digraph6GraphWriter.html +++ b/0.4.1-snapshot/com/jgalgo/io/class-use/Digraph6GraphWriter.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.io.Digraph6GraphWriter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/class-use/DimacsGraphReader.html b/0.4.1-snapshot/com/jgalgo/io/class-use/DimacsGraphReader.html index a413fe5d62..e2b067c934 100644 --- a/0.4.1-snapshot/com/jgalgo/io/class-use/DimacsGraphReader.html +++ b/0.4.1-snapshot/com/jgalgo/io/class-use/DimacsGraphReader.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.io.DimacsGraphReader (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/class-use/DimacsGraphWriter.html b/0.4.1-snapshot/com/jgalgo/io/class-use/DimacsGraphWriter.html index 6d8fd31423..cd53320e9f 100644 --- a/0.4.1-snapshot/com/jgalgo/io/class-use/DimacsGraphWriter.html +++ b/0.4.1-snapshot/com/jgalgo/io/class-use/DimacsGraphWriter.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.io.DimacsGraphWriter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/class-use/GexfGraphReader.html b/0.4.1-snapshot/com/jgalgo/io/class-use/GexfGraphReader.html index afea4e3062..64df9f895a 100644 --- a/0.4.1-snapshot/com/jgalgo/io/class-use/GexfGraphReader.html +++ b/0.4.1-snapshot/com/jgalgo/io/class-use/GexfGraphReader.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.io.GexfGraphReader (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/class-use/GexfGraphWriter.html b/0.4.1-snapshot/com/jgalgo/io/class-use/GexfGraphWriter.html index 35d0397c40..696e779a06 100644 --- a/0.4.1-snapshot/com/jgalgo/io/class-use/GexfGraphWriter.html +++ b/0.4.1-snapshot/com/jgalgo/io/class-use/GexfGraphWriter.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.io.GexfGraphWriter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/class-use/GmlGraphReader.html b/0.4.1-snapshot/com/jgalgo/io/class-use/GmlGraphReader.html index e658b71a40..9db6884a8c 100644 --- a/0.4.1-snapshot/com/jgalgo/io/class-use/GmlGraphReader.html +++ b/0.4.1-snapshot/com/jgalgo/io/class-use/GmlGraphReader.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.io.GmlGraphReader (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/class-use/GmlGraphWriter.html b/0.4.1-snapshot/com/jgalgo/io/class-use/GmlGraphWriter.html index 5980f5b27a..afde21ca1c 100644 --- a/0.4.1-snapshot/com/jgalgo/io/class-use/GmlGraphWriter.html +++ b/0.4.1-snapshot/com/jgalgo/io/class-use/GmlGraphWriter.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.io.GmlGraphWriter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/class-use/Graph6GraphReader.html b/0.4.1-snapshot/com/jgalgo/io/class-use/Graph6GraphReader.html index a628a994b7..8d8e7266db 100644 --- a/0.4.1-snapshot/com/jgalgo/io/class-use/Graph6GraphReader.html +++ b/0.4.1-snapshot/com/jgalgo/io/class-use/Graph6GraphReader.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.io.Graph6GraphReader (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/class-use/Graph6GraphWriter.html b/0.4.1-snapshot/com/jgalgo/io/class-use/Graph6GraphWriter.html index a56b5fa547..05fd2ffd1e 100644 --- a/0.4.1-snapshot/com/jgalgo/io/class-use/Graph6GraphWriter.html +++ b/0.4.1-snapshot/com/jgalgo/io/class-use/Graph6GraphWriter.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.io.Graph6GraphWriter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/class-use/GraphMlGraphReader.html b/0.4.1-snapshot/com/jgalgo/io/class-use/GraphMlGraphReader.html index bfb5b48cfa..12b4add054 100644 --- a/0.4.1-snapshot/com/jgalgo/io/class-use/GraphMlGraphReader.html +++ b/0.4.1-snapshot/com/jgalgo/io/class-use/GraphMlGraphReader.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.io.GraphMlGraphReader (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/class-use/GraphMlGraphWriter.html b/0.4.1-snapshot/com/jgalgo/io/class-use/GraphMlGraphWriter.html index 0907d7ff63..67ff903abb 100644 --- a/0.4.1-snapshot/com/jgalgo/io/class-use/GraphMlGraphWriter.html +++ b/0.4.1-snapshot/com/jgalgo/io/class-use/GraphMlGraphWriter.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.io.GraphMlGraphWriter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/class-use/GraphReader.html b/0.4.1-snapshot/com/jgalgo/io/class-use/GraphReader.html index 9d5ef86c4e..ab5e3eec11 100644 --- a/0.4.1-snapshot/com/jgalgo/io/class-use/GraphReader.html +++ b/0.4.1-snapshot/com/jgalgo/io/class-use/GraphReader.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.io.GraphReader (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/class-use/GraphWriter.html b/0.4.1-snapshot/com/jgalgo/io/class-use/GraphWriter.html index 79ea0df2e3..98a46da994 100644 --- a/0.4.1-snapshot/com/jgalgo/io/class-use/GraphWriter.html +++ b/0.4.1-snapshot/com/jgalgo/io/class-use/GraphWriter.html @@ -2,10 +2,10 @@ - + Uses of Interface com.jgalgo.io.GraphWriter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/class-use/LedaGraphReader.html b/0.4.1-snapshot/com/jgalgo/io/class-use/LedaGraphReader.html index 23feaec655..f664e17103 100644 --- a/0.4.1-snapshot/com/jgalgo/io/class-use/LedaGraphReader.html +++ b/0.4.1-snapshot/com/jgalgo/io/class-use/LedaGraphReader.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.io.LedaGraphReader (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/class-use/LedaGraphWriter.html b/0.4.1-snapshot/com/jgalgo/io/class-use/LedaGraphWriter.html index 452f77aa6e..32acde6a28 100644 --- a/0.4.1-snapshot/com/jgalgo/io/class-use/LedaGraphWriter.html +++ b/0.4.1-snapshot/com/jgalgo/io/class-use/LedaGraphWriter.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.io.LedaGraphWriter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/class-use/Sparse6GraphReader.html b/0.4.1-snapshot/com/jgalgo/io/class-use/Sparse6GraphReader.html index 6ac814577d..435c2df58e 100644 --- a/0.4.1-snapshot/com/jgalgo/io/class-use/Sparse6GraphReader.html +++ b/0.4.1-snapshot/com/jgalgo/io/class-use/Sparse6GraphReader.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.io.Sparse6GraphReader (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/class-use/Sparse6GraphWriter.html b/0.4.1-snapshot/com/jgalgo/io/class-use/Sparse6GraphWriter.html index 37501c9741..faffd5f470 100644 --- a/0.4.1-snapshot/com/jgalgo/io/class-use/Sparse6GraphWriter.html +++ b/0.4.1-snapshot/com/jgalgo/io/class-use/Sparse6GraphWriter.html @@ -2,10 +2,10 @@ - + Uses of Class com.jgalgo.io.Sparse6GraphWriter (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/package-summary.html b/0.4.1-snapshot/com/jgalgo/io/package-summary.html index 845421dd32..920d2700f7 100644 --- a/0.4.1-snapshot/com/jgalgo/io/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/io/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo.io (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/package-tree.html b/0.4.1-snapshot/com/jgalgo/io/package-tree.html index c6c6cf3bf5..c97b7c6db6 100644 --- a/0.4.1-snapshot/com/jgalgo/io/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/io/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo.io Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/io/package-use.html b/0.4.1-snapshot/com/jgalgo/io/package-use.html index d152b1c115..b044adc777 100644 --- a/0.4.1-snapshot/com/jgalgo/io/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/io/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo.io (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/package-summary.html b/0.4.1-snapshot/com/jgalgo/package-summary.html index 26b02cc396..91f4a14bde 100644 --- a/0.4.1-snapshot/com/jgalgo/package-summary.html +++ b/0.4.1-snapshot/com/jgalgo/package-summary.html @@ -2,10 +2,10 @@ - + com.jgalgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/package-tree.html b/0.4.1-snapshot/com/jgalgo/package-tree.html index 899719842e..eea397b773 100644 --- a/0.4.1-snapshot/com/jgalgo/package-tree.html +++ b/0.4.1-snapshot/com/jgalgo/package-tree.html @@ -2,10 +2,10 @@ - + com.jgalgo Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/com/jgalgo/package-use.html b/0.4.1-snapshot/com/jgalgo/package-use.html index bba34e2383..7c80cdf8bc 100644 --- a/0.4.1-snapshot/com/jgalgo/package-use.html +++ b/0.4.1-snapshot/com/jgalgo/package-use.html @@ -2,10 +2,10 @@ - + Uses of Package com.jgalgo (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/constant-values.html b/0.4.1-snapshot/constant-values.html index 927a682a15..c968ef5475 100644 --- a/0.4.1-snapshot/constant-values.html +++ b/0.4.1-snapshot/constant-values.html @@ -2,10 +2,10 @@ - + Constant Field Values (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/deprecated-list.html b/0.4.1-snapshot/deprecated-list.html index 38c3ddf3a0..22a02e0b59 100644 --- a/0.4.1-snapshot/deprecated-list.html +++ b/0.4.1-snapshot/deprecated-list.html @@ -2,10 +2,10 @@ - + Deprecated List (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/help-doc.html b/0.4.1-snapshot/help-doc.html index f3ef2858f7..afc34d2940 100644 --- a/0.4.1-snapshot/help-doc.html +++ b/0.4.1-snapshot/help-doc.html @@ -2,10 +2,10 @@ - + API Help (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/index-all.html b/0.4.1-snapshot/index-all.html index 1ca0f64213..d5146cad62 100644 --- a/0.4.1-snapshot/index-all.html +++ b/0.4.1-snapshot/index-all.html @@ -2,10 +2,10 @@ - + Index (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -474,10 +474,6 @@

    A

    Find all closures in the given graph.
    -
    allCycles(Graph<V, E>) - Method in interface com.jgalgo.alg.cycle.CyclesEnumerator
    -
    -
    Find all cycles in the given graph.
    -
    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.
    @@ -886,6 +882,22 @@

    C

    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
    @@ -1220,6 +1232,8 @@

    C

    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.
    @@ -1326,10 +1340,14 @@

    C

    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.
    @@ -1338,6 +1356,8 @@

    C

    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.
    @@ -1350,10 +1370,18 @@

    C

    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.path.ShortestPathST
    Compute the shortest path from a source vertex to a target vertex.
    @@ -1388,8 +1416,14 @@

    C

    computeTopologicalSorting(Graph<V, E>) - Method in interface com.jgalgo.alg.dag.TopologicalOrderAlgo
    -
    Compute the topological order of a DAG vertices.
    +
    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.path.VoronoiAlgo
    Compute the Voronoi cells of a graph with respect to a set of sites and an edge weight function.
    @@ -1468,6 +1502,22 @@

    C

    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
    @@ -1540,10 +1590,36 @@

    C

    A builder for CyclesEnumerator objects.
    +
    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
    +
     
    @@ -1873,6 +1949,22 @@

    D

    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.
    @@ -1931,6 +2023,30 @@

    E

    A builder for EdgeCover algorithms.
    +
    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.
    @@ -2370,8 +2486,6 @@

    F

    findWeaklyConnectedComponents(Graph<V, E>) - Method in class com.jgalgo.alg.connect.WeaklyConnectedComponentsAlgoAbstract
     
    -
    findWeaklyConnectedComponents(IndexGraph) - Method in class com.jgalgo.alg.connect.WeaklyConnectedComponentsAlgoImpl
    -
     
    Flow<V,​E> - Interface in com.jgalgo.alg.flow
    Flow on graph edges.
    @@ -4660,6 +4774,30 @@

    M

    A builder for MinimumMeanCycle objects.
    +
    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.
    @@ -6285,6 +6423,8 @@

    S

     
    setSeed(long) - Method in class com.jgalgo.alg.connect.KEdgeConnectedComponentsWang
     
    +
    setSeed(long) - Method in class com.jgalgo.alg.cover.DominatingSetAlgoGreedy
    +
     
    setSeed(long) - Method in interface com.jgalgo.alg.RandomizedAlgorithm
    Sets the seed for the random number generator.
    @@ -6664,6 +6804,22 @@

    T

    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
    @@ -6904,6 +7060,22 @@

    V

    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.
    diff --git a/0.4.1-snapshot/index-main.html b/0.4.1-snapshot/index-main.html index 4c16eaac3d..7b01917177 100644 --- a/0.4.1-snapshot/index-main.html +++ b/0.4.1-snapshot/index-main.html @@ -2,10 +2,10 @@ - + Overview (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/member-search-index.js b/0.4.1-snapshot/member-search-index.js index 0babf6d28c..c0334ec504 100644 --- a/0.4.1-snapshot/member-search-index.js +++ b/0.4.1-snapshot/member-search-index.js @@ -1 +1 @@ -memberSearchIndex = [{"p":"com.jgalgo.graph","c":"AbstractGraph","l":"AbstractGraph()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableNetworkAdapter","l":"addEdge(EndpointPair, E)","url":"addEdge(com.google.common.graph.EndpointPair,E)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addEdge(int, int, int)","url":"addEdge(int,int,int)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"addEdge(int, int, int)","url":"addEdge(int,int,int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"addEdge(int, int, int)","url":"addEdge(int,int,int)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"addEdge(int, int, int)","url":"addEdge(int,int,int)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addEdge(int, int)","url":"addEdge(int,int)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"addEdge(int, int)","url":"addEdge(int,int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"addEdge(int, int)","url":"addEdge(int,int)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"addEdge(int, int)","url":"addEdge(int,int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"addEdge(Integer, Integer, Integer)","url":"addEdge(java.lang.Integer,java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"addEdge(Integer, Integer, Integer)","url":"addEdge(java.lang.Integer,java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"addEdge(Integer, Integer)","url":"addEdge(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"addEdge(Integer, Integer)","url":"addEdge(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableNetworkAdapter","l":"addEdge(V, V, E)","url":"addEdge(V,V,E)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"addEdge(V, V, E)","url":"addEdge(V,V,E)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"addEdge(V, V, E)","url":"addEdge(V,V,E)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"addEdge(V, V, E)","url":"addEdge(V,V,E)"},{"p":"com.jgalgo.graph","c":"Graph","l":"addEdge(V, V, E)","url":"addEdge(V,V,E)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"addEdge(V, V, E)","url":"addEdge(V,V,E)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"addEdge(V, V)","url":"addEdge(V,V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"addEdge(V, V)","url":"addEdge(V,V)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"addEdge(V, V)","url":"addEdge(V,V)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addEdgeRemoveListener(IndexRemoveListener)","url":"addEdgeRemoveListener(com.jgalgo.graph.IndexRemoveListener)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addEdges(EdgeSet)","url":"addEdges(com.jgalgo.graph.EdgeSet)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"addEdges(EdgeSet)","url":"addEdges(com.jgalgo.graph.EdgeSet)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"addEdges(EdgeSet)","url":"addEdges(com.jgalgo.graph.EdgeSet)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"addEdges(EdgeSet)","url":"addEdges(com.jgalgo.graph.EdgeSet)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"addEdges(EdgeSet)","url":"addEdges(com.jgalgo.graph.EdgeSet)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"addEdges(EdgeSet)","url":"addEdges(com.jgalgo.graph.EdgeSet)"},{"p":"com.jgalgo.graph","c":"Graph","l":"addEdges(EdgeSet)","url":"addEdges(com.jgalgo.graph.EdgeSet)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"addEdges(EdgeSet)","url":"addEdges(com.jgalgo.graph.EdgeSet)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addEdgesReassignIds(IEdgeSet)","url":"addEdgesReassignIds(com.jgalgo.graph.IEdgeSet)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"addEdgesReassignIds(IEdgeSet)","url":"addEdgesReassignIds(com.jgalgo.graph.IEdgeSet)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"addEdgesWeights(String, Class, T)","url":"addEdgesWeights(java.lang.String,java.lang.Class,T)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"addEdgesWeights(String, Class, T)","url":"addEdgesWeights(java.lang.String,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"Graph","l":"addEdgesWeights(String, Class, T)","url":"addEdgesWeights(java.lang.String,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"addEdgesWeights(String, Class, T)","url":"addEdgesWeights(java.lang.String,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addEdgesWeights(String, Class, T)","url":"addEdgesWeights(java.lang.String,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"Graph","l":"addEdgesWeights(String, Class)","url":"addEdgesWeights(java.lang.String,java.lang.Class)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"addEdgesWeights(String, Class)","url":"addEdgesWeights(java.lang.String,java.lang.Class)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addEdgesWeights(String, Class)","url":"addEdgesWeights(java.lang.String,java.lang.Class)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"addHint(GraphFactory.Hint)","url":"addHint(com.jgalgo.graph.GraphFactory.Hint)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"addHint(GraphFactory.Hint)","url":"addHint(com.jgalgo.graph.GraphFactory.Hint)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"addHint(GraphFactory.Hint)","url":"addHint(com.jgalgo.graph.GraphFactory.Hint)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorDynamic","l":"addLeaf(LowestCommonAncestorDynamic.Vertex)","url":"addLeaf(com.jgalgo.alg.tree.LowestCommonAncestorDynamic.Vertex)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableGraphAdapter","l":"addNode(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableNetworkAdapter","l":"addNode(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableValueGraphAdapter","l":"addNode(V)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.IQueries","l":"addQuery(int, int)","url":"addQuery(int,int)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.IQueries","l":"addQuery(int, int)","url":"addQuery(int,int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.IQueries","l":"addQuery(Integer, Integer)","url":"addQuery(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.IQueries","l":"addQuery(Integer, Integer)","url":"addQuery(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.Queries","l":"addQuery(V, V)","url":"addQuery(V,V)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.Queries","l":"addQuery(V, V)","url":"addQuery(V,V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"addVertex()"},{"p":"com.jgalgo.graph","c":"Graph","l":"addVertex()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"addVertex()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"addVertex()"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"addVertex()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addVertex(int)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"addVertex(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"addVertex(int)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"addVertex(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"addVertex(Integer)","url":"addVertex(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"addVertex(Integer)","url":"addVertex(java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"addVertex(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"addVertex(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"addVertex(V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"addVertex(V)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"addVertex(V)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addVertexInt()"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"addVertexInt()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"addVertexInt()"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"addVertexInt()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addVertexRemoveListener(IndexRemoveListener)","url":"addVertexRemoveListener(com.jgalgo.graph.IndexRemoveListener)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addVertices(Collection)","url":"addVertices(java.util.Collection)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"addVertices(Collection)","url":"addVertices(java.util.Collection)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"addVertices(Collection)","url":"addVertices(java.util.Collection)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"addVertices(Collection)","url":"addVertices(java.util.Collection)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"addVertices(Collection)","url":"addVertices(java.util.Collection)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"addVertices(Collection)","url":"addVertices(java.util.Collection)"},{"p":"com.jgalgo.graph","c":"Graph","l":"addVertices(Collection)","url":"addVertices(java.util.Collection)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"addVertices(Collection)","url":"addVertices(java.util.Collection)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"addVerticesWeights(String, Class, T)","url":"addVerticesWeights(java.lang.String,java.lang.Class,T)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"addVerticesWeights(String, Class, T)","url":"addVerticesWeights(java.lang.String,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"Graph","l":"addVerticesWeights(String, Class, T)","url":"addVerticesWeights(java.lang.String,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"addVerticesWeights(String, Class, T)","url":"addVerticesWeights(java.lang.String,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addVerticesWeights(String, Class, T)","url":"addVerticesWeights(java.lang.String,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"Graph","l":"addVerticesWeights(String, Class)","url":"addVerticesWeights(java.lang.String,java.lang.Class)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"addVerticesWeights(String, Class)","url":"addVerticesWeights(java.lang.String,java.lang.Class)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addVerticesWeights(String, Class)","url":"addVerticesWeights(java.lang.String,java.lang.Class)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"adjacentEdges(E)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"adjacentNodes(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"adjacentNodes(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"adjacentNodes(V)"},{"p":"com.jgalgo.alg","c":"EdgeDirection","l":"All"},{"p":"com.jgalgo.alg.closure","c":"ClosuresEnumerator","l":"allClosures(Graph)","url":"allClosures(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.cycle","c":"CyclesEnumerator","l":"allCycles(Graph)","url":"allCycles(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutAllST","l":"allMinimumCuts(Graph, WeightFunction, V, V)","url":"allMinimumCuts(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllST","l":"allMinimumCuts(Graph, WeightFunction, V, V)","url":"allMinimumCuts(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllGlobal","l":"allMinimumCuts(Graph, WeightFunction)","url":"allMinimumCuts(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.graph","c":"EdgeSet","l":"allOf(Graph)","url":"allOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"IEdgeSet","l":"allOf(IntGraph)","url":"allOf(com.jgalgo.graph.IntGraph)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"allowParallelEdges()"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"allowParallelEdges()"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"allowParallelEdges()"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"allowParallelEdges(boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"allowParallelEdges(boolean)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"allowParallelEdges(boolean)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"allowSelfEdges()"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"allowSelfEdges()"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"allowSelfEdges()"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"allowSelfEdges(boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"allowSelfEdges(boolean)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"allowSelfEdges(boolean)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"allowsParallelEdges()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"allowsSelfLoops()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"allowsSelfLoops()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"allowsSelfLoops()"},{"p":"com.jgalgo.alg.path","c":"SimplePathsEnumerator","l":"allSimplePaths(Graph, V, V)","url":"allSimplePaths(com.jgalgo.graph.Graph,V,V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"asGraph()"},{"p":"com.jgalgo.graph","c":"WeightFunctions","l":"asIntGraphWeightFunc(WeightFunction)","url":"asIntGraphWeightFunc(com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.IResult","l":"backtrackEdge(int)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.IResult","l":"backtrackEdge(Integer)","url":"backtrackEdge(java.lang.Integer)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Result","l":"backtrackEdge(V)"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"BarabasiAlbertGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"BarabasiAlbertGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.example","c":"BfsDfsExample","l":"bfsExample()"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter","l":"bfsLayers(Graph, V)","url":"bfsLayers(com.jgalgo.graph.Graph,V)"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter","l":"bfsTree(Graph, V, boolean)","url":"bfsTree(com.jgalgo.graph.Graph,V,boolean)"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter","l":"bfsTree(Graph, V)","url":"bfsTree(com.jgalgo.graph.Graph,V)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgoAbstract","l":"BiConnectedComponentsAlgoAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgoHopcroftTarjan","l":"BiConnectedComponentsAlgoHopcroftTarjan()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"blockEdges(int)"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"blockEdges(int)"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"blocksGraph()"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"blocksGraph()"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"blocksGraph(boolean, boolean)","url":"blocksGraph(boolean,boolean)"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"blocksGraph(boolean, boolean)","url":"blocksGraph(boolean,boolean)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.IResult","l":"blockSite(int)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.Result","l":"blockSite(int)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.IResult","l":"blockSiteInt(int)"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"blockSubGraph(int, boolean, boolean)","url":"blockSubGraph(int,boolean,boolean)"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"blockSubGraph(int, boolean, boolean)","url":"blockSubGraph(int,boolean,boolean)"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"blockSubGraph(int)"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"blockSubGraph(int)"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"blockVertices(int)"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"blockVertices(int)"},{"p":"com.jgalgo.alg.clique","c":"MaximalCliquesEnumerator.Builder","l":"build()"},{"p":"com.jgalgo.alg.color","c":"ColoringAlgo.Builder","l":"build()"},{"p":"com.jgalgo.alg.connect","c":"StronglyConnectedComponentsAlgo.Builder","l":"build()"},{"p":"com.jgalgo.alg.cover","c":"EdgeCover.Builder","l":"build()"},{"p":"com.jgalgo.alg.cycle","c":"CyclesEnumerator.Builder","l":"build()"},{"p":"com.jgalgo.alg.cycle","c":"MinimumMeanCycle.Builder","l":"build()"},{"p":"com.jgalgo.alg.flow","c":"MaximumFlow.Builder","l":"build()"},{"p":"com.jgalgo.alg.flow","c":"MinimumCostFlow.Builder","l":"build()"},{"p":"com.jgalgo.alg.match","c":"MatchingAlgo.Builder","l":"build()"},{"p":"com.jgalgo.alg.path","c":"KShortestPathsST.Builder","l":"build()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs.Builder","l":"build()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathHeuristicST.Builder","l":"build()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathST.Builder","l":"build()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Builder","l":"build()"},{"p":"com.jgalgo.alg.span","c":"MinimumSpanningTree.Builder","l":"build()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorDynamic.Builder","l":"build()"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.Builder","l":"build()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"build()"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"build()"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"build()"},{"p":"com.jgalgo.graph","c":"IdBuilderInt","l":"build(IntSet)","url":"build(it.unimi.dsi.fastutil.ints.IntSet)"},{"p":"com.jgalgo.graph","c":"IdBuilderInt","l":"build(Set)","url":"build(java.util.Set)"},{"p":"com.jgalgo.graph","c":"IdBuilder","l":"build(Set)","url":"build(java.util.Set)"},{"p":"com.jgalgo.alg.clique","c":"MaximalCliquesEnumerator","l":"builder()"},{"p":"com.jgalgo.alg.color","c":"ColoringAlgo","l":"builder()"},{"p":"com.jgalgo.alg.connect","c":"StronglyConnectedComponentsAlgo","l":"builder()"},{"p":"com.jgalgo.alg.cover","c":"EdgeCover","l":"builder()"},{"p":"com.jgalgo.alg.cycle","c":"CyclesEnumerator","l":"builder()"},{"p":"com.jgalgo.alg.cycle","c":"MinimumMeanCycle","l":"builder()"},{"p":"com.jgalgo.alg.flow","c":"MaximumFlow","l":"builder()"},{"p":"com.jgalgo.alg.flow","c":"MinimumCostFlow","l":"builder()"},{"p":"com.jgalgo.alg.match","c":"MatchingAlgo","l":"builder()"},{"p":"com.jgalgo.alg.path","c":"KShortestPathsST","l":"builder()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs","l":"builder()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathHeuristicST","l":"builder()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathST","l":"builder()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource","l":"builder()"},{"p":"com.jgalgo.alg.span","c":"MinimumSpanningTree","l":"builder()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorDynamic","l":"builder()"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima","l":"builder()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"buildMutable()"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"buildMutable()"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"buildMutable()"},{"p":"com.jgalgo.graph","c":"IWeightFunction","l":"CardinalityWeightFunction"},{"p":"com.jgalgo.graph","c":"WeightFunction","l":"CardinalityWeightFunction"},{"p":"com.jgalgo.graph","c":"WeightFunction","l":"cardinalityWeightFunction()"},{"p":"com.jgalgo.alg.distancemeasures","c":"DistanceMeasures","l":"center()"},{"p":"com.jgalgo.alg.distancemeasures","c":"IDistanceMeasures","l":"center()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"clear()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"clear()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorDynamic","l":"clear()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.Queries","l":"clear()"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.Queries","l":"clear()"},{"p":"com.jgalgo.graph","c":"Graph","l":"clear()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"clear()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"clear()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"clearEdges()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"clearEdges()"},{"p":"com.jgalgo.graph","c":"Graph","l":"clearEdges()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"clearEdges()"},{"p":"com.jgalgo.alg.closure","c":"ClosuresEnumeratorAbstract","l":"ClosuresEnumeratorAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.closure","c":"ClosuresEnumeratorSchrageBaker","l":"ClosuresEnumeratorSchrageBaker()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.closure","c":"ClosuresEnumerator","l":"closuresIter(Graph)","url":"closuresIter(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.closure","c":"ClosuresEnumeratorAbstract","l":"closuresIter(Graph)","url":"closuresIter(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.color","c":"ColoringAlgoAbstract","l":"ColoringAlgoAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.color","c":"ColoringDSatur","l":"ColoringDSatur()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.example","c":"ColoringExample","l":"coloringExample()"},{"p":"com.jgalgo.alg.color","c":"ColoringGreedy","l":"ColoringGreedy()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.color","c":"ColoringRecursiveLargestFirst","l":"ColoringRecursiveLargestFirst()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"LineGraphGenerator","l":"commonVertexWeights(String)","url":"commonVertexWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"IWeightFunction","l":"compare(int, int)","url":"compare(int,int)"},{"p":"com.jgalgo.graph","c":"IWeightFunctionInt","l":"compare(int, int)","url":"compare(int,int)"},{"p":"com.jgalgo.graph","c":"IWeightFunction","l":"compare(Integer, Integer)","url":"compare(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightFunctionInt","l":"compare(Integer, Integer)","url":"compare(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsByte","l":"compare(Integer, Integer)","url":"compare(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsDouble","l":"compare(Integer, Integer)","url":"compare(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsFloat","l":"compare(Integer, Integer)","url":"compare(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsInt","l":"compare(Integer, Integer)","url":"compare(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsLong","l":"compare(Integer, Integer)","url":"compare(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsShort","l":"compare(Integer, Integer)","url":"compare(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"WeightFunction","l":"compare(K, K)","url":"compare(K,K)"},{"p":"com.jgalgo.graph","c":"WeightFunctionInt","l":"compare(K, K)","url":"compare(K,K)"},{"p":"com.jgalgo.gen","c":"ComplementGraphGenerator","l":"ComplementGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"ComplementGraphGenerator","l":"ComplementGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"CompleteBipartiteGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"CompleteBipartiteGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.gen","c":"CompleteGraphGenerator","l":"CompleteGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"CompleteGraphGenerator","l":"CompleteGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs","l":"computeAllShortestPaths(Graph, WeightFunction)","url":"computeAllShortestPaths(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.color","c":"ColoringAlgo","l":"computeColoring(Graph)","url":"computeColoring(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.color","c":"ColoringAlgoAbstract","l":"computeColoring(Graph)","url":"computeColoring(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo","l":"computeCores(Graph, EdgeDirection)","url":"computeCores(com.jgalgo.graph.Graph,com.jgalgo.alg.EdgeDirection)"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo","l":"computeCores(Graph)","url":"computeCores(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.euler","c":"EulerianTourAlgo","l":"computeEulerianTour(Graph)","url":"computeEulerianTour(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.euler","c":"EulerianTourAlgo","l":"computeEulerianTourIfExist(Graph)","url":"computeEulerianTourIfExist(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima","l":"computeHeaviestEdgeInTreePaths(Graph, WeightFunction, TreePathMaxima.Queries)","url":"computeHeaviestEdgeInTreePaths(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,com.jgalgo.alg.tree.TreePathMaxima.Queries)"},{"p":"com.jgalgo.alg.connect","c":"KEdgeConnectedComponentsAlgo","l":"computeKEdgeConnectedComponents(Graph, int)","url":"computeKEdgeConnectedComponents(com.jgalgo.graph.Graph,int)"},{"p":"com.jgalgo.alg.connect","c":"KEdgeConnectedComponentsAlgoAbstract","l":"computeKEdgeConnectedComponents(Graph, int)","url":"computeKEdgeConnectedComponents(com.jgalgo.graph.Graph,int)"},{"p":"com.jgalgo.alg.path","c":"KShortestPathsST","l":"computeKShortestPaths(Graph, WeightFunction, V, V, int)","url":"computeKShortestPaths(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V,int)"},{"p":"com.jgalgo.alg.flow","c":"MaximumFlow","l":"computeMaximumFlow(Graph, WeightFunction, Collection, Collection)","url":"computeMaximumFlow(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.alg.flow","c":"MaximumFlow","l":"computeMaximumFlow(Graph, WeightFunction, V, V)","url":"computeMaximumFlow(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.match","c":"MatchingAlgo","l":"computeMaximumMatching(Graph, WeightFunction)","url":"computeMaximumMatching(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.match","c":"MatchingAlgo","l":"computeMaximumPerfectMatching(Graph, WeightFunction)","url":"computeMaximumPerfectMatching(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.flow","c":"MinimumCostFlow","l":"computeMinCostFlow(Graph, WeightFunction, WeightFunction, WeightFunction, WeightFunction)","url":"computeMinCostFlow(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,com.jgalgo.graph.WeightFunction,com.jgalgo.graph.WeightFunction,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.flow","c":"MinimumCostFlow","l":"computeMinCostFlow(Graph, WeightFunction, WeightFunction, WeightFunction)","url":"computeMinCostFlow(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,com.jgalgo.graph.WeightFunction,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.flow","c":"MinimumCostFlow","l":"computeMinCostMaxFlow(Graph, WeightFunction, WeightFunction, Collection, Collection)","url":"computeMinCostMaxFlow(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,com.jgalgo.graph.WeightFunction,java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.alg.flow","c":"MinimumCostFlow","l":"computeMinCostMaxFlow(Graph, WeightFunction, WeightFunction, V, V)","url":"computeMinCostMaxFlow(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.flow","c":"MinimumCostFlow","l":"computeMinCostMaxFlow(Graph, WeightFunction, WeightFunction, WeightFunction, Collection, Collection)","url":"computeMinCostMaxFlow(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,com.jgalgo.graph.WeightFunction,com.jgalgo.graph.WeightFunction,java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.alg.flow","c":"MinimumCostFlow","l":"computeMinCostMaxFlow(Graph, WeightFunction, WeightFunction, WeightFunction, V, V)","url":"computeMinCostMaxFlow(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,com.jgalgo.graph.WeightFunction,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutST","l":"computeMinimumCut(Graph, WeightFunction, Collection, Collection)","url":"computeMinimumCut(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutSTAbstract","l":"computeMinimumCut(Graph, WeightFunction, Collection, Collection)","url":"computeMinimumCut(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutST","l":"computeMinimumCut(Graph, WeightFunction, V, V)","url":"computeMinimumCut(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutSTAbstract","l":"computeMinimumCut(Graph, WeightFunction, V, V)","url":"computeMinimumCut(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutGlobal","l":"computeMinimumCut(Graph, WeightFunction)","url":"computeMinimumCut(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutGlobalAbstract","l":"computeMinimumCut(Graph, WeightFunction)","url":"computeMinimumCut(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutST","l":"computeMinimumCut(Graph, WeightFunction, V, V)","url":"computeMinimumCut(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutSTAbstract","l":"computeMinimumCut(Graph, WeightFunction, V, V)","url":"computeMinimumCut(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutGlobal","l":"computeMinimumCut(Graph, WeightFunction)","url":"computeMinimumCut(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutGlobalAbstract","l":"computeMinimumCut(Graph, WeightFunction)","url":"computeMinimumCut(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.span","c":"MinimumDirectedSpanningTree","l":"computeMinimumDirectedSpanningTree(Graph, WeightFunction, V)","url":"computeMinimumDirectedSpanningTree(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V)"},{"p":"com.jgalgo.alg.cover","c":"DominatingSetAlgo","l":"computeMinimumDominationSet(Graph, WeightFunction, EdgeDirection)","url":"computeMinimumDominationSet(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,com.jgalgo.alg.EdgeDirection)"},{"p":"com.jgalgo.alg.cover","c":"DominatingSetAlgo","l":"computeMinimumDominationSet(Graph, WeightFunction)","url":"computeMinimumDominationSet(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.cover","c":"EdgeCover","l":"computeMinimumEdgeCover(Graph, WeightFunction)","url":"computeMinimumEdgeCover(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.match","c":"MatchingAlgo","l":"computeMinimumMatching(Graph, WeightFunction)","url":"computeMinimumMatching(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.cycle","c":"MinimumMeanCycle","l":"computeMinimumMeanCycle(Graph, WeightFunction)","url":"computeMinimumMeanCycle(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.match","c":"MatchingAlgo","l":"computeMinimumPerfectMatching(Graph, WeightFunction)","url":"computeMinimumPerfectMatching(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.span","c":"MinimumSpanningTree","l":"computeMinimumSpanningTree(Graph, WeightFunction)","url":"computeMinimumSpanningTree(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.cover","c":"VertexCover","l":"computeMinimumVertexCover(Graph, WeightFunction)","url":"computeMinimumVertexCover(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.cycle","c":"ChinesePostman","l":"computeShortestEdgeVisitorCircle(Graph, WeightFunction)","url":"computeShortestEdgeVisitorCircle(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathHeuristicST","l":"computeShortestPath(Graph, WeightFunction, V, V, ToDoubleFunction)","url":"computeShortestPath(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V,java.util.function.ToDoubleFunction)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathST","l":"computeShortestPath(Graph, WeightFunction, V, V)","url":"computeShortestPath(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathHeuristicST","l":"computeShortestPath(IntGraph, IWeightFunction, int, int, IntToDoubleFunction)","url":"computeShortestPath(com.jgalgo.graph.IntGraph,com.jgalgo.graph.IWeightFunction,int,int,java.util.function.IntToDoubleFunction)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathST","l":"computeShortestPathAndWeight(Graph, WeightFunction, V, V)","url":"computeShortestPathAndWeight(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource","l":"computeShortestPaths(Graph, WeightFunction, V)","url":"computeShortestPaths(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V)"},{"p":"com.jgalgo.alg.path","c":"TspMetric","l":"computeShortestTour(Graph, WeightFunction)","url":"computeShortestTour(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.span","c":"SteinerTreeAlgo","l":"computeSteinerTree(Graph, WeightFunction, Collection)","url":"computeSteinerTree(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,java.util.Collection)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs","l":"computeSubsetShortestPaths(Graph, Collection, WeightFunction)","url":"computeSubsetShortestPaths(com.jgalgo.graph.Graph,java.util.Collection,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.dag","c":"TopologicalOrderAlgo","l":"computeTopologicalSorting(Graph)","url":"computeTopologicalSorting(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo","l":"computeVoronoiCells(Graph, Collection, WeightFunction)","url":"computeVoronoiCells(com.jgalgo.graph.Graph,java.util.Collection,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"containsEdge(E)"},{"p":"com.jgalgo.alg.match","c":"Matching","l":"containsEdge(E)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"containsEdge(int, int)","url":"containsEdge(int,int)"},{"p":"com.jgalgo.alg.match","c":"IMatching","l":"containsEdge(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"containsEdge(Integer, Integer)","url":"containsEdge(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.alg.match","c":"IMatching","l":"containsEdge(Integer)","url":"containsEdge(java.lang.Integer)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"containsEdge(V, V)","url":"containsEdge(V,V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"containsEdge(V, V)","url":"containsEdge(V,V)"},{"p":"com.jgalgo.graph","c":"Graphs","l":"containsParallelEdges(Graph)","url":"containsParallelEdges(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"containsVertex(V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"copy()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"copy()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"copy()"},{"p":"com.jgalgo.graph","c":"Graph","l":"copy(boolean, boolean)","url":"copy(boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"copy(boolean, boolean)","url":"copy(boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"copy(boolean, boolean)","url":"copy(boolean,boolean)"},{"p":"com.jgalgo.gen","c":"UnionGraphGenerator","l":"copyWeights(boolean, boolean)","url":"copyWeights(boolean,boolean)"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo.IResult","l":"coreCrust(int)"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo.Result","l":"coreCrust(int)"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo.IResult","l":"coreShell(int)"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo.Result","l":"coreShell(int)"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo.IResult","l":"coreVertices(int)"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo.Result","l":"coreVertices(int)"},{"p":"com.jgalgo.graph","c":"Weights","l":"createExternalEdgesWeights(Graph, Class, T)","url":"createExternalEdgesWeights(com.jgalgo.graph.Graph,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"Weights","l":"createExternalEdgesWeights(Graph, Class)","url":"createExternalEdgesWeights(com.jgalgo.graph.Graph,java.lang.Class)"},{"p":"com.jgalgo.graph","c":"IWeights","l":"createExternalEdgesWeights(IntGraph, Class, T)","url":"createExternalEdgesWeights(com.jgalgo.graph.IntGraph,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"IWeights","l":"createExternalEdgesWeights(IntGraph, Class)","url":"createExternalEdgesWeights(com.jgalgo.graph.IntGraph,java.lang.Class)"},{"p":"com.jgalgo.graph","c":"Weights","l":"createExternalVerticesWeights(Graph, Class, T)","url":"createExternalVerticesWeights(com.jgalgo.graph.Graph,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"Weights","l":"createExternalVerticesWeights(Graph, Class)","url":"createExternalVerticesWeights(com.jgalgo.graph.Graph,java.lang.Class)"},{"p":"com.jgalgo.graph","c":"IWeights","l":"createExternalVerticesWeights(IntGraph, Class, T)","url":"createExternalVerticesWeights(com.jgalgo.graph.IntGraph,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"IWeights","l":"createExternalVerticesWeights(IntGraph, Class)","url":"createExternalVerticesWeights(com.jgalgo.graph.IntGraph,java.lang.Class)"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"crossEdges()"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"crossEdges()"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"crossEdges(int, int)","url":"crossEdges(int,int)"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"crossEdges(int, int)","url":"crossEdges(int,int)"},{"p":"com.jgalgo.alg.path","c":"NegativeCycleException","l":"cycle()"},{"p":"com.jgalgo.alg.path","c":"NegativeCycleException","l":"cycle(Graph)","url":"cycle(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.cycle","c":"CyclesEnumerator","l":"cyclesIter(Graph)","url":"cyclesIter(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"IdBuilderInt","l":"defaultBuilder()"},{"p":"com.jgalgo.graph","c":"IdBuilder","l":"defaultBuilder(Class)","url":"defaultBuilder(java.lang.Class)"},{"p":"com.jgalgo.graph","c":"IdBuilderInt","l":"defaultFactory()"},{"p":"com.jgalgo.graph","c":"IdBuilder","l":"defaultFactory(Class)","url":"defaultFactory(java.lang.Class)"},{"p":"com.jgalgo.graph","c":"WeightsBool","l":"defaultWeight()"},{"p":"com.jgalgo.graph","c":"WeightsByte","l":"defaultWeight()"},{"p":"com.jgalgo.graph","c":"WeightsChar","l":"defaultWeight()"},{"p":"com.jgalgo.graph","c":"WeightsDouble","l":"defaultWeight()"},{"p":"com.jgalgo.graph","c":"WeightsFloat","l":"defaultWeight()"},{"p":"com.jgalgo.graph","c":"WeightsInt","l":"defaultWeight()"},{"p":"com.jgalgo.graph","c":"WeightsLong","l":"defaultWeight()"},{"p":"com.jgalgo.graph","c":"WeightsObj","l":"defaultWeight()"},{"p":"com.jgalgo.graph","c":"WeightsShort","l":"defaultWeight()"},{"p":"com.jgalgo.graph","c":"Weights","l":"defaultWeightAsObj()"},{"p":"com.jgalgo.graph","c":"WeightsBool","l":"defaultWeightAsObj()"},{"p":"com.jgalgo.graph","c":"WeightsByte","l":"defaultWeightAsObj()"},{"p":"com.jgalgo.graph","c":"WeightsChar","l":"defaultWeightAsObj()"},{"p":"com.jgalgo.graph","c":"WeightsDouble","l":"defaultWeightAsObj()"},{"p":"com.jgalgo.graph","c":"WeightsFloat","l":"defaultWeightAsObj()"},{"p":"com.jgalgo.graph","c":"WeightsInt","l":"defaultWeightAsObj()"},{"p":"com.jgalgo.graph","c":"WeightsLong","l":"defaultWeightAsObj()"},{"p":"com.jgalgo.graph","c":"WeightsObj","l":"defaultWeightAsObj()"},{"p":"com.jgalgo.graph","c":"WeightsShort","l":"defaultWeightAsObj()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"degree(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"degree(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"degreeOf(V)"},{"p":"com.jgalgo.graph","c":"GraphFactory.Hint","l":"DenseGraph"},{"p":"com.jgalgo.example","c":"BfsDfsExample","l":"dfsExample()"},{"p":"com.jgalgo.alg.traversal","c":"DfsIter","l":"dfsTree(Graph, V, boolean)","url":"dfsTree(com.jgalgo.graph.Graph,V,boolean)"},{"p":"com.jgalgo.alg.traversal","c":"DfsIter","l":"dfsTree(Graph, V)","url":"dfsTree(com.jgalgo.graph.Graph,V)"},{"p":"com.jgalgo.alg.distancemeasures","c":"DistanceMeasures","l":"diameter()"},{"p":"com.jgalgo.gen","c":"DifferenceGraphGenerator","l":"DifferenceGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"DifferenceGraphGenerator","l":"DifferenceGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.io","c":"Digraph6GraphReader","l":"Digraph6GraphReader()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.io","c":"Digraph6GraphWriter","l":"Digraph6GraphWriter()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.io","c":"DimacsGraphReader","l":"DimacsGraphReader()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.io","c":"DimacsGraphWriter","l":"DimacsGraphWriter()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"directed()"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"directed()"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"directed()"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"directed()"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"directed()"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"directed()"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"directed(boolean)"},{"p":"com.jgalgo.gen","c":"CompleteGraphGenerator","l":"directed(boolean)"},{"p":"com.jgalgo.gen","c":"EmptyGraphGenerator","l":"directed(boolean)"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"directed(boolean)"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"directed(boolean)"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"directed(boolean)"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"directedAll()"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"directedAll()"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"directedAll()"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"directedLeftToRight()"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"directedLeftToRight()"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"directedLeftToRight()"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"directedRightToLeft()"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"directedRightToLeft()"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"directedRightToLeft()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs.IResult","l":"distance(int, int)","url":"distance(int,int)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.IResult","l":"distance(int)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.IResult","l":"distance(int)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs.IResult","l":"distance(Integer, Integer)","url":"distance(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.IResult","l":"distance(Integer)","url":"distance(java.lang.Integer)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.IResult","l":"distance(Integer)","url":"distance(java.lang.Integer)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs.Result","l":"distance(V, V)","url":"distance(V,V)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Result","l":"distance(V)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.Result","l":"distance(V)"},{"p":"com.jgalgo.example","c":"LowestCommonAncestorExample","l":"dynamicLCAExample()"},{"p":"com.jgalgo.alg.distancemeasures","c":"IDistanceMeasures","l":"eccentricity(int)"},{"p":"com.jgalgo.alg.distancemeasures","c":"IDistanceMeasures","l":"eccentricity(Integer)","url":"eccentricity(java.lang.Integer)"},{"p":"com.jgalgo.alg.distancemeasures","c":"DistanceMeasures","l":"eccentricity(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"edgeBuilder()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"edgeBuilder()"},{"p":"com.jgalgo.graph","c":"Graph","l":"edgeBuilder()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"edgeBuilder()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"edgeBuilder()"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"edgeBuilder()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"edgeBuilder()"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"edgeBuilder()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"edgeConnectingOrNull(V, V)","url":"edgeConnectingOrNull(V,V)"},{"p":"com.jgalgo.gen","c":"DifferenceGraphGenerator","l":"edgeDifferenceByEndpoints()"},{"p":"com.jgalgo.gen","c":"SymmetricDifferenceGraphGenerator","l":"edgeDifferenceByEndpoints()"},{"p":"com.jgalgo.gen","c":"DifferenceGraphGenerator","l":"edgeDifferenceById()"},{"p":"com.jgalgo.gen","c":"SymmetricDifferenceGraphGenerator","l":"edgeDifferenceById()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"edgeEndpoint(E, V)","url":"edgeEndpoint(E,V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"edgeEndpoint(E, V)","url":"edgeEndpoint(E,V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"edgeEndpoint(E, V)","url":"edgeEndpoint(E,V)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"edgeEndpoint(int, int)","url":"edgeEndpoint(int,int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"edgeEndpoint(Integer, Integer)","url":"edgeEndpoint(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.gen","c":"IntersectionGraphGenerator","l":"edgeIntersectByEndpoints()"},{"p":"com.jgalgo.gen","c":"IntersectionGraphGenerator","l":"edgeIntersectById()"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"edgeIter()"},{"p":"com.jgalgo.alg.path","c":"Path","l":"edgeIter()"},{"p":"com.jgalgo.example","c":"EdgeIterationExample","l":"edgeIterationExample()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"edgeOrder()"},{"p":"com.jgalgo.alg.traversal","c":"DfsIter","l":"edgePath()"},{"p":"com.jgalgo.alg.traversal","c":"DfsIter.Int","l":"edgePath()"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"edgeProbabilities(double, double, double, double)","url":"edgeProbabilities(double,double,double,double)"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"edgeProbability(double)"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"edgeProbability(double)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"edges()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"edges()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"edges()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"edges()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"edges()"},{"p":"com.jgalgo.alg.match","c":"IMatching","l":"edges()"},{"p":"com.jgalgo.alg.match","c":"Matching","l":"edges()"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"edges()"},{"p":"com.jgalgo.alg.path","c":"Path","l":"edges()"},{"p":"com.jgalgo.alg.span","c":"MinimumSpanningTree.IResult","l":"edges()"},{"p":"com.jgalgo.alg.span","c":"MinimumSpanningTree.Result","l":"edges()"},{"p":"com.jgalgo.alg.span","c":"SteinerTreeAlgo.IResult","l":"edges()"},{"p":"com.jgalgo.alg.span","c":"SteinerTreeAlgo.Result","l":"edges()"},{"p":"com.jgalgo.graph","c":"Graph","l":"edges()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"edges()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"edges()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"edges()"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"edges()"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"edges(IdBuilder)","url":"edges(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"ComplementGraphGenerator","l":"edges(IdBuilder)","url":"edges(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"edges(IdBuilder)","url":"edges(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"CompleteGraphGenerator","l":"edges(IdBuilder)","url":"edges(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"edges(IdBuilder)","url":"edges(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"edges(IdBuilder)","url":"edges(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"LineGraphGenerator","l":"edges(IdBuilder)","url":"edges(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"UniformTreeGenerator","l":"edges(IdBuilder)","url":"edges(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"edges(int, IdBuilder)","url":"edges(int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"edges(int, IdBuilder)","url":"edges(int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"edges(int, IdBuilder)","url":"edges(int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"edges(int)"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"edges(int)"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"edges(int)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"edgesConnecting(V, V)","url":"edgesConnecting(V,V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"edgeSet()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"edgesOf(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"edgeSource(E)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"edgeSource(E)"},{"p":"com.jgalgo.graph","c":"Graph","l":"edgeSource(E)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"edgeSource(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"edgeSource(Integer)","url":"edgeSource(java.lang.Integer)"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"edgesPerStep(int)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder.ReIndexedGraph","l":"edgesReIndexing"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"edgesWeights(String)","url":"edgesWeights(java.lang.String)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"edgesWeights(String)","url":"edgesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"Graph","l":"edgesWeights(String)","url":"edgesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"edgesWeights(String)","url":"edgesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"edgesWeights(String)","url":"edgesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"edgesWeights(String)","url":"edgesWeights(java.lang.String)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"edgesWeightsKeys()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"edgesWeightsKeys()"},{"p":"com.jgalgo.graph","c":"Graph","l":"edgesWeightsKeys()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"edgesWeightsKeys()"},{"p":"com.jgalgo.gen","c":"UnionGraphGenerator","l":"edgesWeightsKeys(Set)","url":"edgesWeightsKeys(java.util.Set)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"edgeTarget(E)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"edgeTarget(E)"},{"p":"com.jgalgo.graph","c":"Graph","l":"edgeTarget(E)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"edgeTarget(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"edgeTarget(Integer)","url":"edgeTarget(java.lang.Integer)"},{"p":"com.jgalgo.gen","c":"UnionGraphGenerator","l":"edgeUnionByEndpoints()"},{"p":"com.jgalgo.gen","c":"UnionGraphGenerator","l":"edgeUnionById()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"edgeValueOrDefault(EndpointPair, ValueT)","url":"edgeValueOrDefault(com.google.common.graph.EndpointPair,ValueT)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"edgeValueOrDefault(V, V, ValueT)","url":"edgeValueOrDefault(V,V,ValueT)"},{"p":"com.jgalgo.gen","c":"EmptyGraphGenerator","l":"emptyGraph(Collection)","url":"emptyGraph(java.util.Collection)"},{"p":"com.jgalgo.gen","c":"EmptyGraphGenerator","l":"EmptyGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"EmptyGraphGenerator","l":"EmptyGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"ensureEdgeCapacity(int)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"ensureEdgeCapacity(int)"},{"p":"com.jgalgo.graph","c":"Graph","l":"ensureEdgeCapacity(int)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"ensureEdgeCapacity(int)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"ensureVertexCapacity(int)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"ensureVertexCapacity(int)"},{"p":"com.jgalgo.graph","c":"Graph","l":"ensureVertexCapacity(int)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"ensureVertexCapacity(int)"},{"p":"com.jgalgo.alg.path","c":"Path","l":"equals(Object)","url":"equals(java.lang.Object)"},{"p":"com.jgalgo.graph","c":"AbstractGraph","l":"equals(Object)","url":"equals(java.lang.Object)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"expectedEdgesNum(int)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"expectedEdgesNum(int)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"expectedEdgesNum(int)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"expectedVerticesNum(int)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"expectedVerticesNum(int)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"expectedVerticesNum(int)"},{"p":"com.jgalgo.graph","c":"GraphFactory.Hint","l":"FastEdgeLookup"},{"p":"com.jgalgo.graph","c":"GraphFactory.Hint","l":"FastEdgeRemoval"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo","l":"findBiConnectedComponents(Graph)","url":"findBiConnectedComponents(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgoAbstract","l":"findBiConnectedComponents(Graph)","url":"findBiConnectedComponents(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.connect","c":"KVertexConnectedComponentsAlgo","l":"findKVertexConnectedComponents(Graph, int)","url":"findKVertexConnectedComponents(com.jgalgo.graph.Graph,int)"},{"p":"com.jgalgo.alg.connect","c":"KVertexConnectedComponentsAlgoAbstract","l":"findKVertexConnectedComponents(Graph, int)","url":"findKVertexConnectedComponents(com.jgalgo.graph.Graph,int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorStatic.IDataStructure","l":"findLca(int, int)","url":"findLca(int,int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorStatic.IDataStructure","l":"findLca(Integer, Integer)","url":"findLca(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorStatic.DataStructure","l":"findLca(V, V)","url":"findLca(V,V)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline","l":"findLCAs(Graph, V, LowestCommonAncestorOffline.Queries)","url":"findLCAs(com.jgalgo.graph.Graph,V,com.jgalgo.alg.tree.LowestCommonAncestorOffline.Queries)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorDynamic","l":"findLowestCommonAncestor(LowestCommonAncestorDynamic.Vertex, LowestCommonAncestorDynamic.Vertex)","url":"findLowestCommonAncestor(com.jgalgo.alg.tree.LowestCommonAncestorDynamic.Vertex,com.jgalgo.alg.tree.LowestCommonAncestorDynamic.Vertex)"},{"p":"com.jgalgo.alg.bipartite","c":"BipartiteGraphs","l":"findPartition(Graph, boolean)","url":"findPartition(com.jgalgo.graph.Graph,boolean)"},{"p":"com.jgalgo.alg.bipartite","c":"BipartiteGraphs","l":"findPartition(Graph)","url":"findPartition(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.path","c":"Path","l":"findPath(Graph, V, V)","url":"findPath(com.jgalgo.graph.Graph,V,V)"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"findPath(IntGraph, int, int)","url":"findPath(com.jgalgo.graph.IntGraph,int,int)"},{"p":"com.jgalgo.alg.connect","c":"StronglyConnectedComponentsAlgo","l":"findStronglyConnectedComponents(Graph)","url":"findStronglyConnectedComponents(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.connect","c":"StronglyConnectedComponentsAlgoAbstract","l":"findStronglyConnectedComponents(Graph)","url":"findStronglyConnectedComponents(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.connect","c":"WeaklyConnectedComponentsAlgo","l":"findWeaklyConnectedComponents(Graph)","url":"findWeaklyConnectedComponents(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.connect","c":"WeaklyConnectedComponentsAlgoAbstract","l":"findWeaklyConnectedComponents(Graph)","url":"findWeaklyConnectedComponents(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.connect","c":"WeaklyConnectedComponentsAlgoImpl","l":"findWeaklyConnectedComponents(IndexGraph)","url":"findWeaklyConnectedComponents(com.jgalgo.graph.IndexGraph)"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"fromArray(IndexGraph, int[], int)","url":"fromArray(com.jgalgo.graph.IndexGraph,int[],int)"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"fromBitmap(IndexGraph, Bitmap)","url":"fromBitmap(com.jgalgo.graph.IndexGraph,com.jgalgo.internal.util.Bitmap)"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"fromMap(Graph, Map)","url":"fromMap(com.jgalgo.graph.Graph,java.util.Map)"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"fromMap(Graph, Object2IntMap)","url":"fromMap(com.jgalgo.graph.Graph,it.unimi.dsi.fastutil.objects.Object2IntMap)"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"fromMap(IntGraph, Int2IntMap)","url":"fromMap(com.jgalgo.graph.IntGraph,it.unimi.dsi.fastutil.ints.Int2IntMap)"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"fromMap(IntGraph, Map)","url":"fromMap(com.jgalgo.graph.IntGraph,java.util.Map)"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"fromMapping(Graph, Predicate)","url":"fromMapping(com.jgalgo.graph.Graph,java.util.function.Predicate)"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"fromMapping(Graph, ToIntFunction)","url":"fromMapping(com.jgalgo.graph.Graph,java.util.function.ToIntFunction)"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"fromMapping(IntGraph, IntPredicate)","url":"fromMapping(com.jgalgo.graph.IntGraph,java.util.function.IntPredicate)"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"fromMapping(IntGraph, IntUnaryOperator)","url":"fromMapping(com.jgalgo.graph.IntGraph,java.util.function.IntUnaryOperator)"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"fromWeights(Graph, WeightsBool)","url":"fromWeights(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightsBool)"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"fromWeights(IntGraph, IWeightsBool)","url":"fromWeights(com.jgalgo.graph.IntGraph,com.jgalgo.graph.IWeightsBool)"},{"p":"com.jgalgo.gen","c":"GraphGenerator","l":"generate()"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"ComplementGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"CompleteGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"DifferenceGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"EmptyGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"GraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"IntersectionGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"LineGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"SymmetricDifferenceGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"UniformTreeGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"UnionGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"GraphGenerator","l":"generateMutable()"},{"p":"com.jgalgo.graph","c":"IWeightsBool","l":"get(int)"},{"p":"com.jgalgo.graph","c":"IWeightsByte","l":"get(int)"},{"p":"com.jgalgo.graph","c":"IWeightsChar","l":"get(int)"},{"p":"com.jgalgo.graph","c":"IWeightsDouble","l":"get(int)"},{"p":"com.jgalgo.graph","c":"IWeightsFloat","l":"get(int)"},{"p":"com.jgalgo.graph","c":"IWeightsInt","l":"get(int)"},{"p":"com.jgalgo.graph","c":"IWeightsLong","l":"get(int)"},{"p":"com.jgalgo.graph","c":"IWeightsObj","l":"get(int)"},{"p":"com.jgalgo.graph","c":"IWeightsShort","l":"get(int)"},{"p":"com.jgalgo.graph","c":"IWeightsBool","l":"get(Integer)","url":"get(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsByte","l":"get(Integer)","url":"get(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsChar","l":"get(Integer)","url":"get(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsDouble","l":"get(Integer)","url":"get(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsFloat","l":"get(Integer)","url":"get(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsInt","l":"get(Integer)","url":"get(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsLong","l":"get(Integer)","url":"get(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsObj","l":"get(Integer)","url":"get(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsShort","l":"get(Integer)","url":"get(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"WeightsBool","l":"get(K)"},{"p":"com.jgalgo.graph","c":"WeightsByte","l":"get(K)"},{"p":"com.jgalgo.graph","c":"WeightsChar","l":"get(K)"},{"p":"com.jgalgo.graph","c":"WeightsDouble","l":"get(K)"},{"p":"com.jgalgo.graph","c":"WeightsFloat","l":"get(K)"},{"p":"com.jgalgo.graph","c":"WeightsInt","l":"get(K)"},{"p":"com.jgalgo.graph","c":"WeightsLong","l":"get(K)"},{"p":"com.jgalgo.graph","c":"WeightsObj","l":"get(K)"},{"p":"com.jgalgo.graph","c":"WeightsShort","l":"get(K)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"getAllEdges(V, V)","url":"getAllEdges(V,V)"},{"p":"com.jgalgo.graph","c":"IWeights","l":"getAsObj(int)"},{"p":"com.jgalgo.graph","c":"IWeightsBool","l":"getAsObj(int)"},{"p":"com.jgalgo.graph","c":"IWeightsByte","l":"getAsObj(int)"},{"p":"com.jgalgo.graph","c":"IWeightsChar","l":"getAsObj(int)"},{"p":"com.jgalgo.graph","c":"IWeightsDouble","l":"getAsObj(int)"},{"p":"com.jgalgo.graph","c":"IWeightsFloat","l":"getAsObj(int)"},{"p":"com.jgalgo.graph","c":"IWeightsInt","l":"getAsObj(int)"},{"p":"com.jgalgo.graph","c":"IWeightsLong","l":"getAsObj(int)"},{"p":"com.jgalgo.graph","c":"IWeightsObj","l":"getAsObj(int)"},{"p":"com.jgalgo.graph","c":"IWeightsShort","l":"getAsObj(int)"},{"p":"com.jgalgo.graph","c":"IWeights","l":"getAsObj(Integer)","url":"getAsObj(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsBool","l":"getAsObj(Integer)","url":"getAsObj(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsByte","l":"getAsObj(Integer)","url":"getAsObj(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsChar","l":"getAsObj(Integer)","url":"getAsObj(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsDouble","l":"getAsObj(Integer)","url":"getAsObj(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsFloat","l":"getAsObj(Integer)","url":"getAsObj(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsInt","l":"getAsObj(Integer)","url":"getAsObj(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsLong","l":"getAsObj(Integer)","url":"getAsObj(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsObj","l":"getAsObj(Integer)","url":"getAsObj(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsShort","l":"getAsObj(Integer)","url":"getAsObj(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"Weights","l":"getAsObj(K)"},{"p":"com.jgalgo.graph","c":"WeightsBool","l":"getAsObj(K)"},{"p":"com.jgalgo.graph","c":"WeightsByte","l":"getAsObj(K)"},{"p":"com.jgalgo.graph","c":"WeightsChar","l":"getAsObj(K)"},{"p":"com.jgalgo.graph","c":"WeightsDouble","l":"getAsObj(K)"},{"p":"com.jgalgo.graph","c":"WeightsFloat","l":"getAsObj(K)"},{"p":"com.jgalgo.graph","c":"WeightsInt","l":"getAsObj(K)"},{"p":"com.jgalgo.graph","c":"WeightsLong","l":"getAsObj(K)"},{"p":"com.jgalgo.graph","c":"WeightsObj","l":"getAsObj(K)"},{"p":"com.jgalgo.graph","c":"WeightsShort","l":"getAsObj(K)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.IResult","l":"getBiCcEdges(int)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.Result","l":"getBiCcEdges(int)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.IResult","l":"getBiCcVertices(int)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.Result","l":"getBiCcVertices(int)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.Result","l":"getBlockGraph()"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.IResult","l":"getCutVertices()"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.Result","l":"getCutVertices()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorDynamic.Vertex","l":"getData()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"getEdge(int, int)","url":"getEdge(int,int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"getEdge(Integer, Integer)","url":"getEdge(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"getEdge(V, V)","url":"getEdge(V,V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"getEdge(V, V)","url":"getEdge(V,V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"getEdge(V, V)","url":"getEdge(V,V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"getEdge(V, V)","url":"getEdge(V,V)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"getEdges(int, int)","url":"getEdges(int,int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"getEdges(Integer, Integer)","url":"getEdges(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"getEdges(V, V)","url":"getEdges(V,V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"getEdges(V, V)","url":"getEdges(V,V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"getEdges(V, V)","url":"getEdges(V,V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"getEdgeSource(E)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"getEdgeSupplier()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"getEdgeTarget(E)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"getEdgeWeight(E)"},{"p":"com.jgalgo.alg.bipartite","c":"BipartiteGraphs","l":"getExistingPartition(Graph)","url":"getExistingPartition(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.bipartite","c":"BipartiteGraphs","l":"getExistingPartition(IntGraph)","url":"getExistingPartition(com.jgalgo.graph.IntGraph)"},{"p":"com.jgalgo.alg.flow","c":"Flow","l":"getFlow(E)"},{"p":"com.jgalgo.alg.flow","c":"IFlow","l":"getFlow(int)"},{"p":"com.jgalgo.alg.flow","c":"IFlow","l":"getFlow(Integer)","url":"getFlow(java.lang.Integer)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.IResult","l":"getHeaviestEdge(int)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.Result","l":"getHeaviestEdge(int)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.IResult","l":"getHeaviestEdgeInt(int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.IResult","l":"getLca(int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.Result","l":"getLca(int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.IResult","l":"getLcaInt(int)"},{"p":"com.jgalgo.alg.match","c":"IMatching","l":"getMatchedEdge(int)"},{"p":"com.jgalgo.alg.match","c":"IMatching","l":"getMatchedEdge(Integer)","url":"getMatchedEdge(java.lang.Integer)"},{"p":"com.jgalgo.alg.match","c":"Matching","l":"getMatchedEdge(V)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.Result","l":"getNumberOfBiCcs()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorDynamic.Vertex","l":"getParent()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs.IResult","l":"getPath(int, int)","url":"getPath(int,int)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.IResult","l":"getPath(int)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.IResult","l":"getPath(int)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs.IResult","l":"getPath(Integer, Integer)","url":"getPath(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.IResult","l":"getPath(Integer)","url":"getPath(java.lang.Integer)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.IResult","l":"getPath(Integer)","url":"getPath(java.lang.Integer)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs.Result","l":"getPath(V, V)","url":"getPath(V,V)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Result","l":"getPath(V)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.Result","l":"getPath(V)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.IQueries","l":"getQuerySource(int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.Queries","l":"getQuerySource(int)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.IQueries","l":"getQuerySource(int)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.Queries","l":"getQuerySource(int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.IQueries","l":"getQuerySourceInt(int)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.IQueries","l":"getQuerySourceInt(int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.IQueries","l":"getQueryTarget(int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.Queries","l":"getQueryTarget(int)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.IQueries","l":"getQueryTarget(int)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.Queries","l":"getQueryTarget(int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.IQueries","l":"getQueryTargetInt(int)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.IQueries","l":"getQueryTargetInt(int)"},{"p":"com.jgalgo.alg.flow","c":"IFlow","l":"getSupply(int)"},{"p":"com.jgalgo.alg.flow","c":"IFlow","l":"getSupply(Integer)","url":"getSupply(java.lang.Integer)"},{"p":"com.jgalgo.alg.flow","c":"Flow","l":"getSupply(V)"},{"p":"com.jgalgo.alg.flow","c":"Flow","l":"getSupplySubset(Collection)","url":"getSupplySubset(java.util.Collection)"},{"p":"com.jgalgo.alg.flow","c":"Flow","l":"getTotalCost(WeightFunction)","url":"getTotalCost(com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"getType()"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.IResult","l":"getVertexBiCcs(int)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.IResult","l":"getVertexBiCcs(Integer)","url":"getVertexBiCcs(java.lang.Integer)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.Result","l":"getVertexBiCcs(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"getVertexSupplier()"},{"p":"com.jgalgo.io","c":"GexfGraphReader","l":"GexfGraphReader()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.io","c":"GexfGraphReader","l":"GexfGraphReader(Class, Class)","url":"%3Cinit%3E(java.lang.Class,java.lang.Class)"},{"p":"com.jgalgo.io","c":"GexfGraphWriter","l":"GexfGraphWriter()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.io","c":"GmlGraphReader","l":"GmlGraphReader()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.io","c":"GmlGraphReader","l":"GmlGraphReader(Class, Class)","url":"%3Cinit%3E(java.lang.Class,java.lang.Class)"},{"p":"com.jgalgo.io","c":"GmlGraphWriter","l":"GmlGraphWriter()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"GnmBipartiteGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"GnmBipartiteGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"GnmGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"GnmGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"GnpBipartiteGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"GnpBipartiteGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"GnpGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"GnpGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder.ReIndexedGraph","l":"graph"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"graph()"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"graph()"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"graph()"},{"p":"com.jgalgo.alg.path","c":"Path","l":"graph()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.IResult","l":"graph()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Result","l":"graph()"},{"p":"com.jgalgo.gen","c":"LineGraphGenerator","l":"graph(Graph)","url":"graph(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.gen","c":"ComplementGraphGenerator","l":"graph(Graph)","url":"graph(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.io","c":"Graph6GraphReader","l":"Graph6GraphReader()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.io","c":"Graph6GraphWriter","l":"Graph6GraphWriter()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"ComplementGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"CompleteGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"DifferenceGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"EmptyGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"IntersectionGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"LineGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"SymmetricDifferenceGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"UniformTreeGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"UnionGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.io","c":"GraphMlGraphReader","l":"GraphMlGraphReader()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.io","c":"GraphMlGraphReader","l":"GraphMlGraphReader(Class, Class)","url":"%3Cinit%3E(java.lang.Class,java.lang.Class)"},{"p":"com.jgalgo.io","c":"GraphMlGraphWriter","l":"GraphMlGraphWriter()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"IntersectionGraphGenerator","l":"graphs(Collection>)","url":"graphs(java.util.Collection)"},{"p":"com.jgalgo.gen","c":"UnionGraphGenerator","l":"graphs(Collection>)","url":"graphs(java.util.Collection)"},{"p":"com.jgalgo.gen","c":"DifferenceGraphGenerator","l":"graphs(Graph, Graph)","url":"graphs(com.jgalgo.graph.Graph,com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.gen","c":"SymmetricDifferenceGraphGenerator","l":"graphs(Graph, Graph)","url":"graphs(com.jgalgo.graph.Graph,com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.gen","c":"IntersectionGraphGenerator","l":"graphs(Graph...)","url":"graphs(com.jgalgo.graph.Graph...)"},{"p":"com.jgalgo.gen","c":"UnionGraphGenerator","l":"graphs(Graph...)","url":"graphs(com.jgalgo.graph.Graph...)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"GuavaGraphAdapter(Graph)","url":"%3Cinit%3E(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableGraphAdapter","l":"GuavaMutableGraphAdapter(Graph)","url":"%3Cinit%3E(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableNetworkAdapter","l":"GuavaMutableNetworkAdapter(Graph)","url":"%3Cinit%3E(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableValueGraphAdapter","l":"GuavaMutableValueGraphAdapter(Graph, String)","url":"%3Cinit%3E(com.jgalgo.graph.Graph,java.lang.String)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"GuavaNetworkAdapter(Graph)","url":"%3Cinit%3E(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"GuavaNetworkWrapper(Network, boolean)","url":"%3Cinit%3E(com.google.common.graph.Network,boolean)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"GuavaNetworkWrapper(Network)","url":"%3Cinit%3E(com.google.common.graph.Network)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"GuavaValueGraphAdapter(Graph, String)","url":"%3Cinit%3E(com.jgalgo.graph.Graph,java.lang.String)"},{"p":"com.jgalgo.alg.hamilton","c":"HamiltonianPathAlgo","l":"hamiltonianCycle(Graph)","url":"hamiltonianCycle(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.hamilton","c":"HamiltonianPathAlgo","l":"hamiltonianCyclesIter(Graph)","url":"hamiltonianCyclesIter(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.hamilton","c":"HamiltonianPathAlgo","l":"hamiltonianPath(Graph, V, V)","url":"hamiltonianPath(com.jgalgo.graph.Graph,V,V)"},{"p":"com.jgalgo.alg.hamilton","c":"HamiltonianPathAlgo","l":"hamiltonianPath(Graph)","url":"hamiltonianPath(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.hamilton","c":"HamiltonianPathAlgo","l":"hamiltonianPathsIter(Graph, V, V)","url":"hamiltonianPathsIter(com.jgalgo.graph.Graph,V,V)"},{"p":"com.jgalgo.alg.hamilton","c":"HamiltonianPathAlgo","l":"hamiltonianPathsIter(Graph)","url":"hamiltonianPathsIter(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"hasEdgeConnecting(EndpointPair)","url":"hasEdgeConnecting(com.google.common.graph.EndpointPair)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"hasEdgeConnecting(EndpointPair)","url":"hasEdgeConnecting(com.google.common.graph.EndpointPair)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"hasEdgeConnecting(EndpointPair)","url":"hasEdgeConnecting(com.google.common.graph.EndpointPair)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"hasEdgeConnecting(V, V)","url":"hasEdgeConnecting(V,V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"hasEdgeConnecting(V, V)","url":"hasEdgeConnecting(V,V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"hasEdgeConnecting(V, V)","url":"hasEdgeConnecting(V,V)"},{"p":"com.jgalgo.graph","c":"AbstractGraph","l":"hashCode()"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter","l":"hasNext()"},{"p":"com.jgalgo.alg.traversal","c":"DfsIter","l":"hasNext()"},{"p":"com.jgalgo.alg.traversal","c":"RandomWalkIter","l":"hasNext()"},{"p":"com.jgalgo.graph","c":"IndexIntIdMap","l":"identityEdgesMap(IntSet)","url":"identityEdgesMap(it.unimi.dsi.fastutil.ints.IntSet)"},{"p":"com.jgalgo.graph","c":"IndexIntIdMap","l":"identityVerticesMap(IntSet)","url":"identityVerticesMap(it.unimi.dsi.fastutil.ints.IntSet)"},{"p":"com.jgalgo.graph","c":"IndexIntIdMap","l":"idToIndex(int)"},{"p":"com.jgalgo.graph","c":"IndexIntIdMap","l":"idToIndex(Integer)","url":"idToIndex(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IndexIdMap","l":"idToIndex(K)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"idToIndexCollection(Collection, IndexIdMap)","url":"idToIndexCollection(java.util.Collection,com.jgalgo.graph.IndexIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIntIdMap","l":"idToIndexIfExist(int)"},{"p":"com.jgalgo.graph","c":"IndexIntIdMap","l":"idToIndexIfExist(Integer)","url":"idToIndexIfExist(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IndexIdMap","l":"idToIndexIfExist(K)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"idToIndexIterator(Iterator, IndexIdMap)","url":"idToIndexIterator(java.util.Iterator,com.jgalgo.graph.IndexIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"idToIndexList(List, IndexIdMap)","url":"idToIndexList(java.util.List,com.jgalgo.graph.IndexIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"idToIndexSet(Set, IndexIdMap)","url":"idToIndexSet(java.util.Set,com.jgalgo.graph.IndexIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"idToIndexWeightFunc(WeightFunction, IndexIdMap)","url":"idToIndexWeightFunc(com.jgalgo.graph.WeightFunction,com.jgalgo.graph.IndexIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"idToIndexWeightFunc(WeightFunctionInt, IndexIdMap)","url":"idToIndexWeightFunc(com.jgalgo.graph.WeightFunctionInt,com.jgalgo.graph.IndexIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"idToIndexWeights(Weights, IndexIdMap)","url":"idToIndexWeights(com.jgalgo.graph.Weights,com.jgalgo.graph.IndexIdMap)"},{"p":"com.jgalgo.graph","c":"Graph","l":"immutableCopy()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"immutableCopy()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"immutableCopy()"},{"p":"com.jgalgo.graph","c":"Graph","l":"immutableCopy(boolean, boolean)","url":"immutableCopy(boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"immutableCopy(boolean, boolean)","url":"immutableCopy(boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"immutableCopy(boolean, boolean)","url":"immutableCopy(boolean,boolean)"},{"p":"com.jgalgo.graph","c":"Graph","l":"immutableView()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"immutableView()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"immutableView()"},{"p":"com.jgalgo.alg","c":"EdgeDirection","l":"In"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"incidentEdgeOrder()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"incidentEdgeOrder()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"incidentEdges(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"incidentEdges(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"incidentEdges(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"incidentNodes(E)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"incomingEdgesOf(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"inDegree(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"inDegree(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"inDegreeOf(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"indexGraph()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"indexGraph()"},{"p":"com.jgalgo.graph","c":"Graph","l":"indexGraph()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"indexGraph()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"indexGraphEdgesMap()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"indexGraphEdgesMap()"},{"p":"com.jgalgo.graph","c":"Graph","l":"indexGraphEdgesMap()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"indexGraphEdgesMap()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"indexGraphEdgesMap()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"indexGraphVerticesMap()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"indexGraphVerticesMap()"},{"p":"com.jgalgo.graph","c":"Graph","l":"indexGraphVerticesMap()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"indexGraphVerticesMap()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"indexGraphVerticesMap()"},{"p":"com.jgalgo.graph","c":"IndexIdMap","l":"indexToId(int)"},{"p":"com.jgalgo.graph","c":"IndexIntIdMap","l":"indexToId(int)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdCollection(IntCollection, IndexIdMap)","url":"indexToIdCollection(it.unimi.dsi.fastutil.ints.IntCollection,com.jgalgo.graph.IndexIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdCollection(IntCollection, IndexIntIdMap)","url":"indexToIdCollection(it.unimi.dsi.fastutil.ints.IntCollection,com.jgalgo.graph.IndexIntIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdEdgeIter(Graph, IEdgeIter)","url":"indexToIdEdgeIter(com.jgalgo.graph.Graph,com.jgalgo.graph.IEdgeIter)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdEdgeIter(IntGraph, IEdgeIter)","url":"indexToIdEdgeIter(com.jgalgo.graph.IntGraph,com.jgalgo.graph.IEdgeIter)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdEdgeSet(IEdgeSet, Graph)","url":"indexToIdEdgeSet(com.jgalgo.graph.IEdgeSet,com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdEdgeSet(IEdgeSet, IntGraph)","url":"indexToIdEdgeSet(com.jgalgo.graph.IEdgeSet,com.jgalgo.graph.IntGraph)"},{"p":"com.jgalgo.graph","c":"IndexIdMap","l":"indexToIdIfExist(int)"},{"p":"com.jgalgo.graph","c":"IndexIntIdMap","l":"indexToIdIfExist(int)"},{"p":"com.jgalgo.graph","c":"IndexIntIdMap","l":"indexToIdIfExistInt(int)"},{"p":"com.jgalgo.graph","c":"IndexIntIdMap","l":"indexToIdInt(int)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdIterator(IntIterator, IndexIdMap)","url":"indexToIdIterator(it.unimi.dsi.fastutil.ints.IntIterator,com.jgalgo.graph.IndexIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdIterator(IntIterator, IndexIntIdMap)","url":"indexToIdIterator(it.unimi.dsi.fastutil.ints.IntIterator,com.jgalgo.graph.IndexIntIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdList(IntList, IndexIdMap)","url":"indexToIdList(it.unimi.dsi.fastutil.ints.IntList,com.jgalgo.graph.IndexIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdList(IntList, IndexIntIdMap)","url":"indexToIdList(it.unimi.dsi.fastutil.ints.IntList,com.jgalgo.graph.IndexIntIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdSet(IntSet, IndexIdMap)","url":"indexToIdSet(it.unimi.dsi.fastutil.ints.IntSet,com.jgalgo.graph.IndexIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdSet(IntSet, IndexIntIdMap)","url":"indexToIdSet(it.unimi.dsi.fastutil.ints.IntSet,com.jgalgo.graph.IndexIntIdMap)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"inEdges(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"inEdges(Integer)","url":"inEdges(java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"inEdges(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"inEdges(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"inEdges(V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"inEdges(V)"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"initialCliqueSize(int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorDynamic","l":"initTree()"},{"p":"com.jgalgo.alg.flow","c":"MinimumCostFlow.Builder","l":"integerCosts(boolean)"},{"p":"com.jgalgo.alg.flow","c":"MinimumCostFlow.Builder","l":"integerNetwork(boolean)"},{"p":"com.jgalgo.gen","c":"IntersectionGraphGenerator","l":"IntersectionGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"IntersectionGraphGenerator","l":"IntersectionGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.graph","c":"IEdgeSet","l":"intIterator()"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismIMapping","l":"inverse()"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismMapping","l":"inverse()"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder.ReIndexingMap","l":"inverse()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"isAllowParallelEdges()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"isAllowParallelEdges()"},{"p":"com.jgalgo.graph","c":"Graph","l":"isAllowParallelEdges()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"isAllowSelfEdges()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"isAllowSelfEdges()"},{"p":"com.jgalgo.graph","c":"Graph","l":"isAllowSelfEdges()"},{"p":"com.jgalgo.alg.bipartite","c":"BipartiteGraphs","l":"isBipartite(Graph)","url":"isBipartite(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"WeightFunction","l":"isCardinality(WeightFunction)","url":"isCardinality(com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.closure","c":"ClosuresEnumerator","l":"isClosure(Graph, Set)","url":"isClosure(com.jgalgo.graph.Graph,java.util.Set)"},{"p":"com.jgalgo.alg.color","c":"ColoringAlgo","l":"isColoring(Graph, ToIntFunction)","url":"isColoring(com.jgalgo.graph.Graph,java.util.function.ToIntFunction)"},{"p":"com.jgalgo.alg.cover","c":"EdgeCover","l":"isCover(Graph, Collection)","url":"isCover(com.jgalgo.graph.Graph,java.util.Collection)"},{"p":"com.jgalgo.alg.cover","c":"VertexCover","l":"isCover(Graph, Collection)","url":"isCover(com.jgalgo.graph.Graph,java.util.Collection)"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutGlobal","l":"isCut(Graph, Collection)","url":"isCut(com.jgalgo.graph.Graph,java.util.Collection)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.IResult","l":"isCutVertex(int)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.IResult","l":"isCutVertex(Integer)","url":"isCutVertex(java.lang.Integer)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.Result","l":"isCutVertex(V)"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"isCycle()"},{"p":"com.jgalgo.alg.path","c":"Path","l":"isCycle()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"isDirected()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"isDirected()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"isDirected()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"isDirected()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"isDirected()"},{"p":"com.jgalgo.graph","c":"Graph","l":"isDirected()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"isDirected()"},{"p":"com.jgalgo.alg.cover","c":"DominatingSetAlgo","l":"isDominatingSet(Graph, Collection, EdgeDirection)","url":"isDominatingSet(com.jgalgo.graph.Graph,java.util.Collection,com.jgalgo.alg.EdgeDirection)"},{"p":"com.jgalgo.alg.euler","c":"EulerianTourAlgo","l":"isEulerian(Graph)","url":"isEulerian(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.euler","c":"EulerianTourAlgo","l":"isEulerianTour(Graph, List)","url":"isEulerianTour(com.jgalgo.graph.Graph,java.util.List)"},{"p":"com.jgalgo.alg.tree","c":"Trees","l":"isForest(Graph)","url":"isForest(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.hamilton","c":"HamiltonianPathAlgo","l":"isHamiltonianPath(Graph, List)","url":"isHamiltonianPath(com.jgalgo.graph.Graph,java.util.List)"},{"p":"com.jgalgo.graph","c":"WeightFunction","l":"isInteger(WeightFunction)","url":"isInteger(com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"isLeft(int)"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"isLeft(Integer)","url":"isLeft(java.lang.Integer)"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"isLeft(V)"},{"p":"com.jgalgo.alg.match","c":"Matching","l":"isMatching(Graph, Collection)","url":"isMatching(com.jgalgo.graph.Graph,java.util.Collection)"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismTester","l":"isomorphicMapping(Graph, Graph, boolean)","url":"isomorphicMapping(com.jgalgo.graph.Graph,com.jgalgo.graph.Graph,boolean)"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismTester","l":"isomorphicMapping(Graph, Graph)","url":"isomorphicMapping(com.jgalgo.graph.Graph,com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismTester","l":"isomorphicMappingsIter(Graph, Graph, boolean, BiPredicate, BiPredicate)","url":"isomorphicMappingsIter(com.jgalgo.graph.Graph,com.jgalgo.graph.Graph,boolean,java.util.function.BiPredicate,java.util.function.BiPredicate)"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismTester","l":"isomorphicMappingsIter(Graph, Graph, boolean)","url":"isomorphicMappingsIter(com.jgalgo.graph.Graph,com.jgalgo.graph.Graph,boolean)"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismTester","l":"isomorphicMappingsIter(Graph, Graph)","url":"isomorphicMappingsIter(com.jgalgo.graph.Graph,com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"isPartition(Graph, Predicate)","url":"isPartition(com.jgalgo.graph.Graph,java.util.function.Predicate)"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"isPartition(Graph, ToIntFunction)","url":"isPartition(com.jgalgo.graph.Graph,java.util.function.ToIntFunction)"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"isPartition(IntGraph, IntPredicate)","url":"isPartition(com.jgalgo.graph.IntGraph,java.util.function.IntPredicate)"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"isPartition(IntGraph, IntUnaryOperator)","url":"isPartition(com.jgalgo.graph.IntGraph,java.util.function.IntUnaryOperator)"},{"p":"com.jgalgo.alg.path","c":"Path","l":"isPath(Graph, V, V, List)","url":"isPath(com.jgalgo.graph.Graph,V,V,java.util.List)"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"isPath(IntGraph, int, int, IntList)","url":"isPath(com.jgalgo.graph.IntGraph,int,int,it.unimi.dsi.fastutil.ints.IntList)"},{"p":"com.jgalgo.alg.match","c":"Matching","l":"isPerfect()"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"isRight(int)"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"isRight(Integer)","url":"isRight(java.lang.Integer)"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"isRight(V)"},{"p":"com.jgalgo.alg.path","c":"Path","l":"isSimple()"},{"p":"com.jgalgo.alg.span","c":"MinimumSpanningTree","l":"isSpanningForest(Graph, Collection)","url":"isSpanningForest(com.jgalgo.graph.Graph,java.util.Collection)"},{"p":"com.jgalgo.alg.span","c":"MinimumSpanningTree","l":"isSpanningTree(Graph, Collection)","url":"isSpanningTree(com.jgalgo.graph.Graph,java.util.Collection)"},{"p":"com.jgalgo.alg.span","c":"SteinerTreeAlgo","l":"isSteinerTree(Graph, Collection, Collection)","url":"isSteinerTree(com.jgalgo.graph.Graph,java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.alg.connect","c":"StronglyConnectedComponentsAlgo","l":"isStronglyConnected(Graph)","url":"isStronglyConnected(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.connect","c":"StronglyConnectedComponentsAlgoAbstract","l":"isStronglyConnected(Graph)","url":"isStronglyConnected(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.tree","c":"Trees","l":"isTree(Graph, V)","url":"isTree(com.jgalgo.graph.Graph,V)"},{"p":"com.jgalgo.alg.tree","c":"Trees","l":"isTree(Graph)","url":"isTree(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.match","c":"IMatching","l":"isVertexMatched(int)"},{"p":"com.jgalgo.alg.match","c":"IMatching","l":"isVertexMatched(Integer)","url":"isVertexMatched(java.lang.Integer)"},{"p":"com.jgalgo.alg.match","c":"Matching","l":"isVertexMatched(V)"},{"p":"com.jgalgo.alg.connect","c":"WeaklyConnectedComponentsAlgo","l":"isWeaklyConnected(Graph)","url":"isWeaklyConnected(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.connect","c":"WeaklyConnectedComponentsAlgoAbstract","l":"isWeaklyConnected(Graph)","url":"isWeaklyConnected(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"EdgeSet","l":"iterator()"},{"p":"com.jgalgo.graph","c":"IEdgeSet","l":"iterator()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"JGraphTAdapter(Graph, String)","url":"%3Cinit%3E(com.jgalgo.graph.Graph,java.lang.String)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"JGraphTAdapter(Graph)","url":"%3Cinit%3E(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"JGraphTWrapper(Graph, String)","url":"%3Cinit%3E(org.jgrapht.Graph,java.lang.String)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"JGraphTWrapper(Graph)","url":"%3Cinit%3E(org.jgrapht.Graph)"},{"p":"com.jgalgo.alg.connect","c":"KEdgeConnectedComponentsAlgoAbstract","l":"KEdgeConnectedComponentsAlgoAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"KEdgeConnectedComponentsWang","l":"KEdgeConnectedComponentsWang()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.io","c":"Digraph6GraphWriter","l":"keepEdgesIds(boolean)"},{"p":"com.jgalgo.io","c":"Graph6GraphWriter","l":"keepEdgesIds(boolean)"},{"p":"com.jgalgo.io","c":"Sparse6GraphWriter","l":"keepEdgesIds(boolean)"},{"p":"com.jgalgo.alg.connect","c":"KVertexConnectedComponentsAlgoAbstract","l":"KVertexConnectedComponentsAlgoAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"KVertexConnectedComponentsWhiteMoody","l":"KVertexConnectedComponentsWhiteMoody()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter","l":"lastEdge()"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter.Int","l":"lastEdge()"},{"p":"com.jgalgo.alg.traversal","c":"RandomWalkIter","l":"lastEdge()"},{"p":"com.jgalgo.alg.traversal","c":"RandomWalkIter.Int","l":"lastEdge()"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter.Int","l":"lastEdgeInt()"},{"p":"com.jgalgo.alg.traversal","c":"RandomWalkIter.Int","l":"lastEdgeInt()"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter","l":"layer()"},{"p":"com.jgalgo.io","c":"LedaGraphReader","l":"LedaGraphReader()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.io","c":"LedaGraphWriter","l":"LedaGraphWriter()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"leftEdges()"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"leftEdges()"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"leftVertices()"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"leftVertices()"},{"p":"com.jgalgo.gen","c":"LineGraphGenerator","l":"LineGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"LineGraphGenerator","l":"LineGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.graph","c":"WeightFunctions","l":"localEdgeWeightFunction(IndexGraph, IWeightFunction)","url":"localEdgeWeightFunction(com.jgalgo.graph.IndexGraph,com.jgalgo.graph.IWeightFunction)"},{"p":"com.jgalgo.graph","c":"WeightFunctions","l":"localEdgeWeightFunction(IndexGraph, IWeightFunctionInt)","url":"localEdgeWeightFunction(com.jgalgo.graph.IndexGraph,com.jgalgo.graph.IWeightFunctionInt)"},{"p":"com.jgalgo.example","c":"BfsDfsExample","l":"main(String[])","url":"main(java.lang.String[])"},{"p":"com.jgalgo.example","c":"ColoringExample","l":"main(String[])","url":"main(java.lang.String[])"},{"p":"com.jgalgo.example","c":"EdgeIterationExample","l":"main(String[])","url":"main(java.lang.String[])"},{"p":"com.jgalgo.example","c":"LowestCommonAncestorExample","l":"main(String[])","url":"main(java.lang.String[])"},{"p":"com.jgalgo.example","c":"MaximumMatchingExample","l":"main(String[])","url":"main(java.lang.String[])"},{"p":"com.jgalgo.example","c":"MinimumSpanningTreeExample","l":"main(String[])","url":"main(java.lang.String[])"},{"p":"com.jgalgo.example","c":"ShortestPathExample","l":"main(String[])","url":"main(java.lang.String[])"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder.ReIndexingMap","l":"map(int)"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismMapping","l":"mapEdge(E1)"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismIMapping","l":"mapEdge(int)"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismIMapping","l":"mapEdge(Integer)","url":"mapEdge(java.lang.Integer)"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismIMapping","l":"mappedEdges()"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismMapping","l":"mappedEdges()"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismIMapping","l":"mappedVertices()"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismMapping","l":"mappedVertices()"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismIMapping","l":"mapVertex(int)"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismIMapping","l":"mapVertex(Integer)","url":"mapVertex(java.lang.Integer)"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismMapping","l":"mapVertex(V1)"},{"p":"com.jgalgo.alg.match","c":"IMatching","l":"matchedVertices()"},{"p":"com.jgalgo.alg.match","c":"Matching","l":"matchedVertices()"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo.Result","l":"maxCore()"},{"p":"com.jgalgo.alg.clique","c":"MaximalCliquesEnumeratorAbstract","l":"MaximalCliquesEnumeratorAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.clique","c":"MaximalCliquesEnumeratorBronKerbosch","l":"MaximalCliquesEnumeratorBronKerbosch()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.clique","c":"MaximalCliquesEnumeratorBronKerboschPivot","l":"MaximalCliquesEnumeratorBronKerboschPivot()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.clique","c":"MaximalCliquesEnumerator","l":"maximalCliquesIter(Graph)","url":"maximalCliquesIter(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.clique","c":"MaximalCliquesEnumeratorAbstract","l":"maximalCliquesIter(Graph)","url":"maximalCliquesIter(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.clique","c":"MaximalIndependentSetsEnumeratorAbstract","l":"MaximalIndependentSetsEnumeratorAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.clique","c":"MaximalIndependentSetsEnumeratorComplementCliques","l":"MaximalIndependentSetsEnumeratorComplementCliques()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.clique","c":"MaximalIndependentSetsEnumerator","l":"maximalIndependentSetsIter(Graph)","url":"maximalIndependentSetsIter(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.clique","c":"MaximalIndependentSetsEnumeratorAbstract","l":"maximalIndependentSetsIter(Graph)","url":"maximalIndependentSetsIter(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.example","c":"MaximumMatchingExample","l":"maximumMatchingExample()"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutAllST","l":"minimumCutsIter(Graph, WeightFunction, V, V)","url":"minimumCutsIter(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutAllSTAbstract","l":"minimumCutsIter(Graph, WeightFunction, V, V)","url":"minimumCutsIter(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllST","l":"minimumCutsIter(Graph, WeightFunction, V, V)","url":"minimumCutsIter(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllSTAbstract","l":"minimumCutsIter(Graph, WeightFunction, V, V)","url":"minimumCutsIter(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllGlobal","l":"minimumCutsIter(Graph, WeightFunction)","url":"minimumCutsIter(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllGlobalAbstract","l":"minimumCutsIter(Graph, WeightFunction)","url":"minimumCutsIter(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutAllSTAbstract","l":"MinimumEdgeCutAllSTAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutAllSTPicardQueyranne","l":"MinimumEdgeCutAllSTPicardQueyranne()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutGlobalAbstract","l":"MinimumEdgeCutGlobalAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutGlobalStoerWagner","l":"MinimumEdgeCutGlobalStoerWagner()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutSTAbstract","l":"MinimumEdgeCutSTAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllGlobalAbstract","l":"MinimumVertexCutAllGlobalAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllGlobalKanevsky","l":"MinimumVertexCutAllGlobalKanevsky()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllSTAbstract","l":"MinimumVertexCutAllSTAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllSTEdgeCut","l":"MinimumVertexCutAllSTEdgeCut()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutGlobalAbstract","l":"MinimumVertexCutGlobalAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutGlobalEsfahanianHakimi","l":"MinimumVertexCutGlobalEsfahanianHakimi()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutSTAbstract","l":"MinimumVertexCutSTAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutSTEdgeCut","l":"MinimumVertexCutSTEdgeCut()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"moveEdge(E, V, V)","url":"moveEdge(E,V,V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"moveEdge(E, V, V)","url":"moveEdge(E,V,V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"moveEdge(E, V, V)","url":"moveEdge(E,V,V)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"moveEdge(int, int, int)","url":"moveEdge(int,int,int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"moveEdge(Integer, Integer, Integer)","url":"moveEdge(java.lang.Integer,java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.example","c":"MinimumSpanningTreeExample","l":"mstExample()"},{"p":"com.jgalgo.graph","c":"WeightFunctions","l":"negate(IWeightFunction)","url":"negate(com.jgalgo.graph.IWeightFunction)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"newBuilder()"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"newBuilder()"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"newBuilder()"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"newBuilderCopyOf(Graph, boolean, boolean)","url":"newBuilderCopyOf(com.jgalgo.graph.Graph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"newBuilderCopyOf(Graph, boolean, boolean)","url":"newBuilderCopyOf(com.jgalgo.graph.Graph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"newBuilderCopyOf(Graph)","url":"newBuilderCopyOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"newBuilderCopyOf(Graph)","url":"newBuilderCopyOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"newBuilderCopyOf(Graph, boolean, boolean)","url":"newBuilderCopyOf(com.jgalgo.graph.Graph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"newBuilderCopyOf(Graph)","url":"newBuilderCopyOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"newCopyOf(Graph, boolean, boolean)","url":"newCopyOf(com.jgalgo.graph.Graph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"newCopyOf(Graph, boolean, boolean)","url":"newCopyOf(com.jgalgo.graph.Graph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"newCopyOf(Graph, boolean, boolean)","url":"newCopyOf(com.jgalgo.graph.Graph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"newCopyOf(Graph)","url":"newCopyOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"newCopyOf(Graph)","url":"newCopyOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"newCopyOf(Graph)","url":"newCopyOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"newCopyOf(Graph, boolean, boolean)","url":"newCopyOf(com.jgalgo.graph.Graph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"newCopyOf(Graph, boolean, boolean)","url":"newCopyOf(com.jgalgo.graph.Graph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"newCopyOf(Graph)","url":"newCopyOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"newCopyOf(Graph)","url":"newCopyOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"newCopyOf(IndexGraph, boolean, boolean)","url":"newCopyOf(com.jgalgo.graph.IndexGraph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"newCopyOf(IndexGraph)","url":"newCopyOf(com.jgalgo.graph.IndexGraph)"},{"p":"com.jgalgo.graph","c":"Graph","l":"newDirected()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"newDirected()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"newDirected()"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutST","l":"newFromMaximumFlow(MaximumFlow)","url":"newFromMaximumFlow(com.jgalgo.alg.flow.MaximumFlow)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"newGraph()"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"newGraph()"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"newGraph()"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"newImmutableCopyOf(Graph, boolean, boolean)","url":"newImmutableCopyOf(com.jgalgo.graph.Graph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"newImmutableCopyOf(Graph, boolean, boolean)","url":"newImmutableCopyOf(com.jgalgo.graph.Graph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"newImmutableCopyOf(Graph)","url":"newImmutableCopyOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"newImmutableCopyOf(Graph)","url":"newImmutableCopyOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"newImmutableCopyOf(Graph, boolean, boolean)","url":"newImmutableCopyOf(com.jgalgo.graph.Graph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"newImmutableCopyOf(Graph)","url":"newImmutableCopyOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.clique","c":"MaximalCliquesEnumerator","l":"newInstance()"},{"p":"com.jgalgo.alg.clique","c":"MaximalIndependentSetsEnumerator","l":"newInstance()"},{"p":"com.jgalgo.alg.closure","c":"ClosuresEnumerator","l":"newInstance()"},{"p":"com.jgalgo.alg.color","c":"ColoringAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"KEdgeConnectedComponentsAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"KVertexConnectedComponentsAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutAllST","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutGlobal","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutST","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllGlobal","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllST","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutGlobal","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutST","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"StronglyConnectedComponentsAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"WeaklyConnectedComponentsAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.cover","c":"DominatingSetAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.cover","c":"EdgeCover","l":"newInstance()"},{"p":"com.jgalgo.alg.cover","c":"VertexCover","l":"newInstance()"},{"p":"com.jgalgo.alg.cycle","c":"ChinesePostman","l":"newInstance()"},{"p":"com.jgalgo.alg.cycle","c":"CyclesEnumerator","l":"newInstance()"},{"p":"com.jgalgo.alg.cycle","c":"MinimumMeanCycle","l":"newInstance()"},{"p":"com.jgalgo.alg.dag","c":"TopologicalOrderAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.euler","c":"EulerianTourAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.flow","c":"MaximumFlow","l":"newInstance()"},{"p":"com.jgalgo.alg.flow","c":"MinimumCostFlow","l":"newInstance()"},{"p":"com.jgalgo.alg.hamilton","c":"HamiltonianPathAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismTester","l":"newInstance()"},{"p":"com.jgalgo.alg.match","c":"MatchingAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.path","c":"KShortestPathsST","l":"newInstance()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs","l":"newInstance()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathHeuristicST","l":"newInstance()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathST","l":"newInstance()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource","l":"newInstance()"},{"p":"com.jgalgo.alg.path","c":"SimplePathsEnumerator","l":"newInstance()"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.span","c":"MinimumDirectedSpanningTree","l":"newInstance()"},{"p":"com.jgalgo.alg.span","c":"MinimumSpanningTree","l":"newInstance()"},{"p":"com.jgalgo.alg.span","c":"SteinerTreeAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorDynamic","l":"newInstance()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline","l":"newInstance()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.IQueries","l":"newInstance()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorStatic","l":"newInstance()"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima","l":"newInstance()"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.IQueries","l":"newInstance()"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.Queries","l":"newInstance()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"newInstance(boolean)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"newInstance(boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"newInstance(boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"newInstance(boolean)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"newInstance(boolean)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"newInstance(boolean)"},{"p":"com.jgalgo.alg.traversal","c":"RandomWalkIter","l":"newInstance(Graph, V, WeightFunction)","url":"newInstance(com.jgalgo.graph.Graph,V,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter","l":"newInstance(Graph, V)","url":"newInstance(com.jgalgo.graph.Graph,V)"},{"p":"com.jgalgo.alg.traversal","c":"DfsIter","l":"newInstance(Graph, V)","url":"newInstance(com.jgalgo.graph.Graph,V)"},{"p":"com.jgalgo.alg.traversal","c":"RandomWalkIter","l":"newInstance(Graph, V)","url":"newInstance(com.jgalgo.graph.Graph,V)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.Queries","l":"newInstance(Graph)","url":"newInstance(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter","l":"newInstance(IntGraph, int)","url":"newInstance(com.jgalgo.graph.IntGraph,int)"},{"p":"com.jgalgo.alg.traversal","c":"DfsIter","l":"newInstance(IntGraph, int)","url":"newInstance(com.jgalgo.graph.IntGraph,int)"},{"p":"com.jgalgo.graph","c":"Graph","l":"newUndirected()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"newUndirected()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"newUndirected()"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter","l":"next()"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter.Int","l":"next()"},{"p":"com.jgalgo.alg.traversal","c":"DfsIter","l":"next()"},{"p":"com.jgalgo.alg.traversal","c":"DfsIter.Int","l":"next()"},{"p":"com.jgalgo.alg.traversal","c":"RandomWalkIter","l":"next()"},{"p":"com.jgalgo.alg.traversal","c":"RandomWalkIter.Int","l":"next()"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter.Int","l":"nextInt()"},{"p":"com.jgalgo.alg.traversal","c":"DfsIter.Int","l":"nextInt()"},{"p":"com.jgalgo.alg.traversal","c":"RandomWalkIter.Int","l":"nextInt()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"nodeOrder()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"nodeOrder()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"nodeOrder()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"nodes()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"nodes()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"nodes()"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"numberOfBlocks()"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"numberOfBlocks()"},{"p":"com.jgalgo.alg.distancemeasures","c":"DistanceMeasures","l":"of(Graph, WeightFunction)","url":"of(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.graph","c":"IEdgeSet","l":"of(IntSet, IntGraph)","url":"of(it.unimi.dsi.fastutil.ints.IntSet,com.jgalgo.graph.IntGraph)"},{"p":"com.jgalgo.graph","c":"EdgeSet","l":"of(Set, Graph)","url":"of(java.util.Set,com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"NoSuchEdgeException","l":"ofEdge(int)"},{"p":"com.jgalgo.graph","c":"NoSuchEdgeException","l":"ofEdge(Object)","url":"ofEdge(java.lang.Object)"},{"p":"com.jgalgo.graph","c":"NoSuchEdgeException","l":"ofIndex(int)"},{"p":"com.jgalgo.graph","c":"NoSuchVertexException","l":"ofIndex(int)"},{"p":"com.jgalgo.graph","c":"NoSuchVertexException","l":"ofVertex(int)"},{"p":"com.jgalgo.graph","c":"NoSuchVertexException","l":"ofVertex(Object)","url":"ofVertex(java.lang.Object)"},{"p":"com.jgalgo.alg.dag","c":"TopologicalOrderAlgo.IResult","l":"orderComparator()"},{"p":"com.jgalgo.alg.dag","c":"TopologicalOrderAlgo.Result","l":"orderComparator()"},{"p":"com.jgalgo.alg.dag","c":"TopologicalOrderAlgo.IResult","l":"orderedVertices()"},{"p":"com.jgalgo.alg.dag","c":"TopologicalOrderAlgo.Result","l":"orderedVertices()"},{"p":"com.jgalgo.alg","c":"EdgeDirection","l":"Out"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"outDegree(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"outDegree(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"outDegreeOf(V)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"outEdges(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"outEdges(Integer)","url":"outEdges(java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"outEdges(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"outEdges(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"outEdges(V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"outEdges(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"outgoingEdgesOf(V)"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"parallelEdges(boolean)"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"parallelEdges(boolean)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.IResult","l":"partition()"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.Result","l":"partition()"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"partitionFromIndexPartition(Graph, IVertexBiPartition)","url":"partitionFromIndexPartition(com.jgalgo.graph.Graph,com.jgalgo.alg.IVertexBiPartition)"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"partitionFromIndexPartition(Graph, IVertexPartition)","url":"partitionFromIndexPartition(com.jgalgo.graph.Graph,com.jgalgo.alg.IVertexPartition)"},{"p":"com.jgalgo.alg.path","c":"Path","l":"pathFromIndexPath(Graph, IPath)","url":"pathFromIndexPath(com.jgalgo.graph.Graph,com.jgalgo.alg.path.IPath)"},{"p":"com.jgalgo.graph","c":"EdgeIter","l":"peekNext()"},{"p":"com.jgalgo.graph","c":"IEdgeIter","l":"peekNext()"},{"p":"com.jgalgo.graph","c":"IEdgeIter","l":"peekNextInt()"},{"p":"com.jgalgo.alg.distancemeasures","c":"DistanceMeasures","l":"periphery()"},{"p":"com.jgalgo.alg.distancemeasures","c":"IDistanceMeasures","l":"periphery()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"predecessors(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"predecessors(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"predecessors(V)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorStatic","l":"preProcessTree(Graph, V)","url":"preProcessTree(com.jgalgo.graph.Graph,V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableGraphAdapter","l":"putEdge(EndpointPair)","url":"putEdge(com.google.common.graph.EndpointPair)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableGraphAdapter","l":"putEdge(V, V)","url":"putEdge(V,V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableValueGraphAdapter","l":"putEdgeValue(EndpointPair, ValueT)","url":"putEdgeValue(com.google.common.graph.EndpointPair,ValueT)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableValueGraphAdapter","l":"putEdgeValue(V, V, ValueT)","url":"putEdgeValue(V,V,ValueT)"},{"p":"com.jgalgo.alg.distancemeasures","c":"DistanceMeasures","l":"radius()"},{"p":"com.jgalgo.graph","c":"Graphs","l":"randEdge(Graph, Random)","url":"randEdge(com.jgalgo.graph.Graph,java.util.Random)"},{"p":"com.jgalgo.graph","c":"Graphs","l":"randEdge(IntGraph, Random)","url":"randEdge(com.jgalgo.graph.IntGraph,java.util.Random)"},{"p":"com.jgalgo.graph","c":"Graphs","l":"randVertex(Graph, Random)","url":"randVertex(com.jgalgo.graph.Graph,java.util.Random)"},{"p":"com.jgalgo.graph","c":"Graphs","l":"randVertex(IntGraph, Random)","url":"randVertex(com.jgalgo.graph.IntGraph,java.util.Random)"},{"p":"com.jgalgo.alg.path","c":"Path","l":"reachableVertices(Graph, Iterator)","url":"reachableVertices(com.jgalgo.graph.Graph,java.util.Iterator)"},{"p":"com.jgalgo.alg.path","c":"Path","l":"reachableVertices(Graph, V)","url":"reachableVertices(com.jgalgo.graph.Graph,V)"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"reachableVertices(IntGraph, int)","url":"reachableVertices(com.jgalgo.graph.IntGraph,int)"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"reachableVertices(IntGraph, IntIterator)","url":"reachableVertices(com.jgalgo.graph.IntGraph,it.unimi.dsi.fastutil.ints.IntIterator)"},{"p":"com.jgalgo.io","c":"GraphReader","l":"readGraph(File)","url":"readGraph(java.io.File)"},{"p":"com.jgalgo.io","c":"GraphReader","l":"readGraph(Reader)","url":"readGraph(java.io.Reader)"},{"p":"com.jgalgo.io","c":"GraphReader","l":"readGraph(String)","url":"readGraph(java.lang.String)"},{"p":"com.jgalgo.io","c":"GraphReader","l":"readIntoBuilder(Reader)","url":"readIntoBuilder(java.io.Reader)"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"RecursiveMatrixGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"RecursiveMatrixGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"reIndexAndBuild(boolean, boolean)","url":"reIndexAndBuild(boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"reIndexAndBuildMutable(boolean, boolean)","url":"reIndexAndBuildMutable(boolean,boolean)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"removeAllEdges(V, V)","url":"removeAllEdges(V,V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableNetworkAdapter","l":"removeEdge(E)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"removeEdge(E)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"removeEdge(E)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"removeEdge(E)"},{"p":"com.jgalgo.graph","c":"Graph","l":"removeEdge(E)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableGraphAdapter","l":"removeEdge(EndpointPair)","url":"removeEdge(com.google.common.graph.EndpointPair)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableValueGraphAdapter","l":"removeEdge(EndpointPair)","url":"removeEdge(com.google.common.graph.EndpointPair)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"removeEdge(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"removeEdge(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"removeEdge(Integer)","url":"removeEdge(java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableGraphAdapter","l":"removeEdge(V, V)","url":"removeEdge(V,V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableValueGraphAdapter","l":"removeEdge(V, V)","url":"removeEdge(V,V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"removeEdge(V, V)","url":"removeEdge(V,V)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"removeEdgeRemoveListener(IndexRemoveListener)","url":"removeEdgeRemoveListener(com.jgalgo.graph.IndexRemoveListener)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"removeEdges(Collection)","url":"removeEdges(java.util.Collection)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"removeEdges(Collection)","url":"removeEdges(java.util.Collection)"},{"p":"com.jgalgo.graph","c":"Graph","l":"removeEdges(Collection)","url":"removeEdges(java.util.Collection)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"removeEdgesOf(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"removeEdgesOf(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"removeEdgesOf(Integer)","url":"removeEdgesOf(java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"removeEdgesOf(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"removeEdgesOf(V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"removeEdgesOf(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"removeEdgesWeights(String)","url":"removeEdgesWeights(java.lang.String)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"removeEdgesWeights(String)","url":"removeEdgesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"Graph","l":"removeEdgesWeights(String)","url":"removeEdgesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"removeEdgesWeights(String)","url":"removeEdgesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"removeHint(GraphFactory.Hint)","url":"removeHint(com.jgalgo.graph.GraphFactory.Hint)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"removeHint(GraphFactory.Hint)","url":"removeHint(com.jgalgo.graph.GraphFactory.Hint)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"removeHint(GraphFactory.Hint)","url":"removeHint(com.jgalgo.graph.GraphFactory.Hint)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"removeInEdgesOf(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"removeInEdgesOf(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"removeInEdgesOf(Integer)","url":"removeInEdgesOf(java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"removeInEdgesOf(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"removeInEdgesOf(V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"removeInEdgesOf(V)"},{"p":"com.jgalgo.graph","c":"IndexRemoveListener","l":"removeLast(int)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableGraphAdapter","l":"removeNode(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableNetworkAdapter","l":"removeNode(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableValueGraphAdapter","l":"removeNode(V)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"removeOutEdgesOf(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"removeOutEdgesOf(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"removeOutEdgesOf(Integer)","url":"removeOutEdgesOf(java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"removeOutEdgesOf(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"removeOutEdgesOf(V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"removeOutEdgesOf(V)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"removeVertex(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"removeVertex(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"removeVertex(Integer)","url":"removeVertex(java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"removeVertex(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"removeVertex(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"removeVertex(V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"removeVertex(V)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"removeVertexRemoveListener(IndexRemoveListener)","url":"removeVertexRemoveListener(com.jgalgo.graph.IndexRemoveListener)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"removeVertices(Collection)","url":"removeVertices(java.util.Collection)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"removeVertices(Collection)","url":"removeVertices(java.util.Collection)"},{"p":"com.jgalgo.graph","c":"Graph","l":"removeVertices(Collection)","url":"removeVertices(java.util.Collection)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"removeVerticesWeights(String)","url":"removeVerticesWeights(java.lang.String)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"removeVerticesWeights(String)","url":"removeVerticesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"Graph","l":"removeVerticesWeights(String)","url":"removeVerticesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"removeVerticesWeights(String)","url":"removeVerticesWeights(java.lang.String)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"renameEdge(E, E)","url":"renameEdge(E,E)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"renameEdge(E, E)","url":"renameEdge(E,E)"},{"p":"com.jgalgo.graph","c":"Graph","l":"renameEdge(E, E)","url":"renameEdge(E,E)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"renameEdge(int, int)","url":"renameEdge(int,int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"renameEdge(int, int)","url":"renameEdge(int,int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"renameEdge(Integer, Integer)","url":"renameEdge(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"renameVertex(int, int)","url":"renameVertex(int,int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"renameVertex(int, int)","url":"renameVertex(int,int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"renameVertex(Integer, Integer)","url":"renameVertex(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"renameVertex(V, V)","url":"renameVertex(V,V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"renameVertex(V, V)","url":"renameVertex(V,V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"renameVertex(V, V)","url":"renameVertex(V,V)"},{"p":"com.jgalgo.graph","c":"IWeightFunction","l":"replaceNullWeightFunc(IWeightFunction)","url":"replaceNullWeightFunc(com.jgalgo.graph.IWeightFunction)"},{"p":"com.jgalgo.graph","c":"IWeightFunction","l":"replaceNullWeightFunc(IWeightFunctionInt)","url":"replaceNullWeightFunc(com.jgalgo.graph.IWeightFunctionInt)"},{"p":"com.jgalgo.graph","c":"WeightFunction","l":"replaceNullWeightFunc(WeightFunction)","url":"replaceNullWeightFunc(com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.graph","c":"WeightFunction","l":"replaceNullWeightFunc(WeightFunctionInt)","url":"replaceNullWeightFunc(com.jgalgo.graph.WeightFunctionInt)"},{"p":"com.jgalgo.graph","c":"Graph","l":"reverseEdge(E)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"reverseEdge(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"reverseEdge(Integer)","url":"reverseEdge(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"Graph","l":"reverseView()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"reverseView()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"reverseView()"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"rightEdges()"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"rightEdges()"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"rightVertices()"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"rightVertices()"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"seed(long)"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"seed(long)"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"seed(long)"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"seed(long)"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"seed(long)"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"seed(long)"},{"p":"com.jgalgo.gen","c":"UniformTreeGenerator","l":"seed(long)"},{"p":"com.jgalgo.gen","c":"ComplementGraphGenerator","l":"selfEdges(boolean)"},{"p":"com.jgalgo.gen","c":"CompleteGraphGenerator","l":"selfEdges(boolean)"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"selfEdges(boolean)"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"selfEdges(boolean)"},{"p":"com.jgalgo.graph","c":"Graphs","l":"selfEdges(Graph)","url":"selfEdges(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"Graphs","l":"selfEdges(IntGraph)","url":"selfEdges(com.jgalgo.graph.IntGraph)"},{"p":"com.jgalgo.graph","c":"IWeightsBool","l":"set(int, boolean)","url":"set(int,boolean)"},{"p":"com.jgalgo.graph","c":"IWeightsByte","l":"set(int, byte)","url":"set(int,byte)"},{"p":"com.jgalgo.graph","c":"IWeightsChar","l":"set(int, char)","url":"set(int,char)"},{"p":"com.jgalgo.graph","c":"IWeightsDouble","l":"set(int, double)","url":"set(int,double)"},{"p":"com.jgalgo.graph","c":"IWeightsFloat","l":"set(int, float)","url":"set(int,float)"},{"p":"com.jgalgo.graph","c":"IWeightsInt","l":"set(int, int)","url":"set(int,int)"},{"p":"com.jgalgo.graph","c":"IWeightsLong","l":"set(int, long)","url":"set(int,long)"},{"p":"com.jgalgo.graph","c":"IWeightsShort","l":"set(int, short)","url":"set(int,short)"},{"p":"com.jgalgo.graph","c":"IWeightsObj","l":"set(int, T)","url":"set(int,T)"},{"p":"com.jgalgo.graph","c":"IWeightsBool","l":"set(Integer, boolean)","url":"set(java.lang.Integer,boolean)"},{"p":"com.jgalgo.graph","c":"IWeightsByte","l":"set(Integer, byte)","url":"set(java.lang.Integer,byte)"},{"p":"com.jgalgo.graph","c":"IWeightsChar","l":"set(Integer, char)","url":"set(java.lang.Integer,char)"},{"p":"com.jgalgo.graph","c":"IWeightsDouble","l":"set(Integer, double)","url":"set(java.lang.Integer,double)"},{"p":"com.jgalgo.graph","c":"IWeightsFloat","l":"set(Integer, float)","url":"set(java.lang.Integer,float)"},{"p":"com.jgalgo.graph","c":"IWeightsInt","l":"set(Integer, int)","url":"set(java.lang.Integer,int)"},{"p":"com.jgalgo.graph","c":"IWeightsLong","l":"set(Integer, long)","url":"set(java.lang.Integer,long)"},{"p":"com.jgalgo.graph","c":"IWeightsShort","l":"set(Integer, short)","url":"set(java.lang.Integer,short)"},{"p":"com.jgalgo.graph","c":"IWeightsObj","l":"set(Integer, T)","url":"set(java.lang.Integer,T)"},{"p":"com.jgalgo.graph","c":"WeightsBool","l":"set(K, boolean)","url":"set(K,boolean)"},{"p":"com.jgalgo.graph","c":"WeightsByte","l":"set(K, byte)","url":"set(K,byte)"},{"p":"com.jgalgo.graph","c":"WeightsChar","l":"set(K, char)","url":"set(K,char)"},{"p":"com.jgalgo.graph","c":"WeightsDouble","l":"set(K, double)","url":"set(K,double)"},{"p":"com.jgalgo.graph","c":"WeightsFloat","l":"set(K, float)","url":"set(K,float)"},{"p":"com.jgalgo.graph","c":"WeightsInt","l":"set(K, int)","url":"set(K,int)"},{"p":"com.jgalgo.graph","c":"WeightsLong","l":"set(K, long)","url":"set(K,long)"},{"p":"com.jgalgo.graph","c":"WeightsShort","l":"set(K, short)","url":"set(K,short)"},{"p":"com.jgalgo.graph","c":"WeightsObj","l":"set(K, T)","url":"set(K,T)"},{"p":"com.jgalgo.graph","c":"IWeightsBool","l":"setAsObj(int, Boolean)","url":"setAsObj(int,java.lang.Boolean)"},{"p":"com.jgalgo.graph","c":"IWeightsByte","l":"setAsObj(int, Byte)","url":"setAsObj(int,java.lang.Byte)"},{"p":"com.jgalgo.graph","c":"IWeightsChar","l":"setAsObj(int, Character)","url":"setAsObj(int,java.lang.Character)"},{"p":"com.jgalgo.graph","c":"IWeightsDouble","l":"setAsObj(int, Double)","url":"setAsObj(int,java.lang.Double)"},{"p":"com.jgalgo.graph","c":"IWeightsFloat","l":"setAsObj(int, Float)","url":"setAsObj(int,java.lang.Float)"},{"p":"com.jgalgo.graph","c":"IWeightsInt","l":"setAsObj(int, Integer)","url":"setAsObj(int,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsLong","l":"setAsObj(int, Long)","url":"setAsObj(int,java.lang.Long)"},{"p":"com.jgalgo.graph","c":"IWeightsShort","l":"setAsObj(int, Short)","url":"setAsObj(int,java.lang.Short)"},{"p":"com.jgalgo.graph","c":"IWeights","l":"setAsObj(int, T)","url":"setAsObj(int,T)"},{"p":"com.jgalgo.graph","c":"IWeightsObj","l":"setAsObj(int, T)","url":"setAsObj(int,T)"},{"p":"com.jgalgo.graph","c":"IWeightsBool","l":"setAsObj(Integer, Boolean)","url":"setAsObj(java.lang.Integer,java.lang.Boolean)"},{"p":"com.jgalgo.graph","c":"IWeightsByte","l":"setAsObj(Integer, Byte)","url":"setAsObj(java.lang.Integer,java.lang.Byte)"},{"p":"com.jgalgo.graph","c":"IWeightsChar","l":"setAsObj(Integer, Character)","url":"setAsObj(java.lang.Integer,java.lang.Character)"},{"p":"com.jgalgo.graph","c":"IWeightsDouble","l":"setAsObj(Integer, Double)","url":"setAsObj(java.lang.Integer,java.lang.Double)"},{"p":"com.jgalgo.graph","c":"IWeightsFloat","l":"setAsObj(Integer, Float)","url":"setAsObj(java.lang.Integer,java.lang.Float)"},{"p":"com.jgalgo.graph","c":"IWeightsInt","l":"setAsObj(Integer, Integer)","url":"setAsObj(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsLong","l":"setAsObj(Integer, Long)","url":"setAsObj(java.lang.Integer,java.lang.Long)"},{"p":"com.jgalgo.graph","c":"IWeightsShort","l":"setAsObj(Integer, Short)","url":"setAsObj(java.lang.Integer,java.lang.Short)"},{"p":"com.jgalgo.graph","c":"IWeights","l":"setAsObj(Integer, T)","url":"setAsObj(java.lang.Integer,T)"},{"p":"com.jgalgo.graph","c":"IWeightsObj","l":"setAsObj(Integer, T)","url":"setAsObj(java.lang.Integer,T)"},{"p":"com.jgalgo.graph","c":"WeightsBool","l":"setAsObj(K, Boolean)","url":"setAsObj(K,java.lang.Boolean)"},{"p":"com.jgalgo.graph","c":"WeightsByte","l":"setAsObj(K, Byte)","url":"setAsObj(K,java.lang.Byte)"},{"p":"com.jgalgo.graph","c":"WeightsChar","l":"setAsObj(K, Character)","url":"setAsObj(K,java.lang.Character)"},{"p":"com.jgalgo.graph","c":"WeightsDouble","l":"setAsObj(K, Double)","url":"setAsObj(K,java.lang.Double)"},{"p":"com.jgalgo.graph","c":"WeightsFloat","l":"setAsObj(K, Float)","url":"setAsObj(K,java.lang.Float)"},{"p":"com.jgalgo.graph","c":"WeightsInt","l":"setAsObj(K, Integer)","url":"setAsObj(K,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"WeightsLong","l":"setAsObj(K, Long)","url":"setAsObj(K,java.lang.Long)"},{"p":"com.jgalgo.graph","c":"WeightsShort","l":"setAsObj(K, Short)","url":"setAsObj(K,java.lang.Short)"},{"p":"com.jgalgo.graph","c":"Weights","l":"setAsObj(K, T)","url":"setAsObj(K,T)"},{"p":"com.jgalgo.graph","c":"WeightsObj","l":"setAsObj(K, T)","url":"setAsObj(K,T)"},{"p":"com.jgalgo.alg.match","c":"MatchingAlgo.Builder","l":"setBipartite(boolean)"},{"p":"com.jgalgo.alg.match","c":"MatchingAlgo.Builder","l":"setCardinality(boolean)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs.Builder","l":"setCardinality(boolean)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Builder","l":"setCardinality(boolean)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Builder","l":"setDag(boolean)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorDynamic.Vertex","l":"setData(Object)","url":"setData(java.lang.Object)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"setDirected(boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"setDirected(boolean)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"setDirected(boolean)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"setEdgeBuilder(IdBuilder)","url":"setEdgeBuilder(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.io","c":"GexfGraphReader","l":"setEdgeBuilder(IdBuilder)","url":"setEdgeBuilder(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.io","c":"GraphMlGraphReader","l":"setEdgeBuilder(IdBuilder)","url":"setEdgeBuilder(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"setEdgeBuilder(IdBuilder)","url":"setEdgeBuilder(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"setEdgeBuilder(IdBuilder)","url":"setEdgeBuilder(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.io","c":"GexfGraphReader","l":"setEdgeBuilderDefault(Class)","url":"setEdgeBuilderDefault(java.lang.Class)"},{"p":"com.jgalgo.io","c":"GraphMlGraphReader","l":"setEdgeBuilderDefault(Class)","url":"setEdgeBuilderDefault(java.lang.Class)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"setEdgeFactory(Supplier>)","url":"setEdgeFactory(java.util.function.Supplier)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"setEdgeFactory(Supplier>)","url":"setEdgeFactory(java.util.function.Supplier)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"setEdgeFactory(Supplier>)","url":"setEdgeFactory(java.util.function.Supplier)"},{"p":"com.jgalgo.io","c":"GexfGraphReader","l":"setEdgeParser(Function)","url":"setEdgeParser(java.util.function.Function)"},{"p":"com.jgalgo.io","c":"GraphMlGraphReader","l":"setEdgeParser(Function)","url":"setEdgeParser(java.util.function.Function)"},{"p":"com.jgalgo.io","c":"GexfGraphReader","l":"setEdgeParserDefault(Class)","url":"setEdgeParserDefault(java.lang.Class)"},{"p":"com.jgalgo.io","c":"GraphMlGraphReader","l":"setEdgeParserDefault(Class)","url":"setEdgeParserDefault(java.lang.Class)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"setEdgeSupplier(Supplier)","url":"setEdgeSupplier(java.util.function.Supplier)"},{"p":"com.jgalgo.io","c":"LedaGraphReader","l":"setEdgesWeightsKey(String)","url":"setEdgesWeightsKey(java.lang.String)"},{"p":"com.jgalgo.io","c":"LedaGraphWriter","l":"setEdgesWeightsKey(String)","url":"setEdgesWeightsKey(java.lang.String)"},{"p":"com.jgalgo.io","c":"GmlGraphWriter","l":"setEdgesWeightsKeys(Collection)","url":"setEdgesWeightsKeys(java.util.Collection)"},{"p":"com.jgalgo.io","c":"GmlGraphReader","l":"setEdgeType(Class)","url":"setEdgeType(java.lang.Class)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"setEdgeWeight(E, double)","url":"setEdgeWeight(E,double)"},{"p":"com.jgalgo.io","c":"DimacsGraphWriter","l":"setEdgeWeights(String)","url":"setEdgeWeights(java.lang.String)"},{"p":"com.jgalgo.io","c":"DimacsGraphReader","l":"setEdgeWeightsKey(String)","url":"setEdgeWeightsKey(java.lang.String)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Builder","l":"setIntWeights(boolean)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Builder","l":"setMaxDistance(double)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Builder","l":"setNegativeWeights(boolean)"},{"p":"com.jgalgo.alg","c":"AlgorithmBuilderBase","l":"setOption(String, Object)","url":"setOption(java.lang.String,java.lang.Object)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"setOption(String, Object)","url":"setOption(java.lang.String,java.lang.Object)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"setOption(String, Object)","url":"setOption(java.lang.String,java.lang.Object)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"setOption(String, Object)","url":"setOption(java.lang.String,java.lang.Object)"},{"p":"com.jgalgo","c":"JGAlgoConfig","l":"setParallelByDefault(boolean)"},{"p":"com.jgalgo.alg","c":"RandomizedAlgorithm","l":"setSeed(long)"},{"p":"com.jgalgo.alg.color","c":"ColoringGreedy","l":"setSeed(long)"},{"p":"com.jgalgo.alg.connect","c":"KEdgeConnectedComponentsWang","l":"setSeed(long)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"setVertexBuilder(IdBuilder)","url":"setVertexBuilder(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"setVertexBuilder(IdBuilder)","url":"setVertexBuilder(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"setVertexBuilder(IdBuilder)","url":"setVertexBuilder(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"setVertexFactory(Supplier>)","url":"setVertexFactory(java.util.function.Supplier)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"setVertexFactory(Supplier>)","url":"setVertexFactory(java.util.function.Supplier)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"setVertexFactory(Supplier>)","url":"setVertexFactory(java.util.function.Supplier)"},{"p":"com.jgalgo.io","c":"GexfGraphReader","l":"setVertexParser(Function)","url":"setVertexParser(java.util.function.Function)"},{"p":"com.jgalgo.io","c":"GraphMlGraphReader","l":"setVertexParser(Function)","url":"setVertexParser(java.util.function.Function)"},{"p":"com.jgalgo.io","c":"GexfGraphReader","l":"setVertexParserDefault(Class)","url":"setVertexParserDefault(java.lang.Class)"},{"p":"com.jgalgo.io","c":"GraphMlGraphReader","l":"setVertexParserDefault(Class)","url":"setVertexParserDefault(java.lang.Class)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"setVertexSupplier(Supplier)","url":"setVertexSupplier(java.util.function.Supplier)"},{"p":"com.jgalgo.io","c":"GmlGraphReader","l":"setVertexType(Class)","url":"setVertexType(java.lang.Class)"},{"p":"com.jgalgo.io","c":"LedaGraphReader","l":"setVerticesWeightsKey(String)","url":"setVerticesWeightsKey(java.lang.String)"},{"p":"com.jgalgo.io","c":"LedaGraphWriter","l":"setVerticesWeightsKey(String)","url":"setVerticesWeightsKey(java.lang.String)"},{"p":"com.jgalgo.io","c":"GmlGraphWriter","l":"setVerticesWeightsKeys(Collection)","url":"setVerticesWeightsKeys(java.util.Collection)"},{"p":"com.jgalgo.example","c":"ShortestPathExample","l":"shortestPathExample()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.IResult","l":"shortestPathTree()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Result","l":"shortestPathTree()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.IResult","l":"shortestPathTree(boolean)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Result","l":"shortestPathTree(boolean)"},{"p":"com.jgalgo.alg.path","c":"SimplePathsEnumerator","l":"simplePathsIter(Graph, V, V)","url":"simplePathsIter(com.jgalgo.graph.Graph,V,V)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorDynamic","l":"size()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.Queries","l":"size()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.Result","l":"size()"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.Queries","l":"size()"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.Result","l":"size()"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"source()"},{"p":"com.jgalgo.alg.path","c":"Path","l":"source()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.IResult","l":"source()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Result","l":"source()"},{"p":"com.jgalgo.graph","c":"EdgeIter","l":"source()"},{"p":"com.jgalgo.graph","c":"IEdgeIter","l":"source()"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismIMapping","l":"sourceGraph()"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismMapping","l":"sourceGraph()"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"sourceInt()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.IResult","l":"sourceInt()"},{"p":"com.jgalgo.graph","c":"IEdgeIter","l":"sourceInt()"},{"p":"com.jgalgo.io","c":"Sparse6GraphReader","l":"Sparse6GraphReader()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.io","c":"Sparse6GraphWriter","l":"Sparse6GraphWriter()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.example","c":"LowestCommonAncestorExample","l":"staticLCAExample()"},{"p":"com.jgalgo.alg.connect","c":"StronglyConnectedComponentsAlgoAbstract","l":"StronglyConnectedComponentsAlgoAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"StronglyConnectedComponentsPathBasedDfs","l":"StronglyConnectedComponentsPathBasedDfs()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"StronglyConnectedComponentsTarjan","l":"StronglyConnectedComponentsTarjan()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.graph","c":"Graphs","l":"subGraph(Graph, Collection, Collection, boolean, boolean)","url":"subGraph(com.jgalgo.graph.Graph,java.util.Collection,java.util.Collection,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"Graphs","l":"subGraph(Graph, Collection, Collection)","url":"subGraph(com.jgalgo.graph.Graph,java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.graph","c":"Graphs","l":"subGraph(Graph, Collection)","url":"subGraph(com.jgalgo.graph.Graph,java.util.Collection)"},{"p":"com.jgalgo.graph","c":"Graphs","l":"subGraph(IntGraph, IntCollection, IntCollection, boolean, boolean)","url":"subGraph(com.jgalgo.graph.IntGraph,it.unimi.dsi.fastutil.ints.IntCollection,it.unimi.dsi.fastutil.ints.IntCollection,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"subGraphCopy(Collection, Collection)","url":"subGraphCopy(java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.graph","c":"Graph","l":"subGraphCopy(Collection, Collection)","url":"subGraphCopy(java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"subPath(int, int)","url":"subPath(int,int)"},{"p":"com.jgalgo.alg.path","c":"Path","l":"subPath(int, int)","url":"subPath(int,int)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"successors(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"successors(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"successors(V)"},{"p":"com.jgalgo.graph","c":"IndexRemoveListener","l":"swapAndRemove(int, int)","url":"swapAndRemove(int,int)"},{"p":"com.jgalgo.gen","c":"SymmetricDifferenceGraphGenerator","l":"SymmetricDifferenceGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"SymmetricDifferenceGraphGenerator","l":"SymmetricDifferenceGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"target()"},{"p":"com.jgalgo.alg.path","c":"Path","l":"target()"},{"p":"com.jgalgo.graph","c":"EdgeIter","l":"target()"},{"p":"com.jgalgo.graph","c":"IEdgeIter","l":"target()"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismIMapping","l":"targetGraph()"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismMapping","l":"targetGraph()"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"targetInt()"},{"p":"com.jgalgo.graph","c":"IEdgeIter","l":"targetInt()"},{"p":"com.jgalgo.graph","c":"AbstractGraph","l":"toString()"},{"p":"com.jgalgo.alg.path","c":"TspMetricMatchingAppx","l":"TspMetricMatchingAppx()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.path","c":"TspMetricMSTAppx","l":"TspMetricMSTAppx()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"undirected()"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"undirected()"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"undirected()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"undirected()"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"undirected()"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"undirected()"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"undirected()"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"undirected()"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"undirected()"},{"p":"com.jgalgo.graph","c":"Graph","l":"undirectedView()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"undirectedView()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"undirectedView()"},{"p":"com.jgalgo.gen","c":"UniformTreeGenerator","l":"UniformTreeGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"UniformTreeGenerator","l":"UniformTreeGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.gen","c":"UnionGraphGenerator","l":"UnionGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"UnionGraphGenerator","l":"UnionGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.alg.match","c":"IMatching","l":"unmatchedVertices()"},{"p":"com.jgalgo.alg.match","c":"Matching","l":"unmatchedVertices()"},{"p":"com.jgalgo.alg.path","c":"Path","l":"valueOf(Graph, V, V, List)","url":"valueOf(com.jgalgo.graph.Graph,V,V,java.util.List)"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"valueOf(IntGraph, int, int, IntList)","url":"valueOf(com.jgalgo.graph.IntGraph,int,int,it.unimi.dsi.fastutil.ints.IntList)"},{"p":"com.jgalgo.alg","c":"EdgeDirection","l":"valueOf(String)","url":"valueOf(java.lang.String)"},{"p":"com.jgalgo.graph","c":"GraphFactory.Hint","l":"valueOf(String)","url":"valueOf(java.lang.String)"},{"p":"com.jgalgo.alg","c":"EdgeDirection","l":"values()"},{"p":"com.jgalgo.graph","c":"GraphFactory.Hint","l":"values()"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima","l":"verifyMST(Graph, WeightFunction, Collection, TreePathMaxima)","url":"verifyMST(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,java.util.Collection,com.jgalgo.alg.tree.TreePathMaxima)"},{"p":"com.jgalgo.alg.bipartite","c":"BipartiteGraphs","l":"VertexBiPartitionWeightKey"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"vertexBlock(int)"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"vertexBlock(int)"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"vertexBlock(Integer)","url":"vertexBlock(java.lang.Integer)"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"vertexBlock(Integer)","url":"vertexBlock(java.lang.Integer)"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"vertexBlock(V)"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"vertexBlock(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"vertexBuilder()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"vertexBuilder()"},{"p":"com.jgalgo.graph","c":"Graph","l":"vertexBuilder()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"vertexBuilder()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"vertexBuilder()"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"vertexBuilder()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"vertexBuilder()"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"vertexBuilder()"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo.IResult","l":"vertexCoreNum(int)"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo.IResult","l":"vertexCoreNum(Integer)","url":"vertexCoreNum(java.lang.Integer)"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo.Result","l":"vertexCoreNum(V)"},{"p":"com.jgalgo.alg.dag","c":"TopologicalOrderAlgo.IResult","l":"vertexOrderIndex(int)"},{"p":"com.jgalgo.alg.dag","c":"TopologicalOrderAlgo.IResult","l":"vertexOrderIndex(Integer)","url":"vertexOrderIndex(java.lang.Integer)"},{"p":"com.jgalgo.alg.dag","c":"TopologicalOrderAlgo.Result","l":"vertexOrderIndex(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"vertexSet()"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.IResult","l":"vertexSite(int)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.IResult","l":"vertexSite(Integer)","url":"vertexSite(java.lang.Integer)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.Result","l":"vertexSite(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"vertices()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"vertices()"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"vertices()"},{"p":"com.jgalgo.alg.path","c":"Path","l":"vertices()"},{"p":"com.jgalgo.graph","c":"Graph","l":"vertices()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"vertices()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"vertices()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"vertices()"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"vertices()"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"vertices(Collection, Collection)","url":"vertices(java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"vertices(Collection, Collection)","url":"vertices(java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"vertices(Collection, Collection)","url":"vertices(java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"vertices(Collection)","url":"vertices(java.util.Collection)"},{"p":"com.jgalgo.gen","c":"CompleteGraphGenerator","l":"vertices(Collection)","url":"vertices(java.util.Collection)"},{"p":"com.jgalgo.gen","c":"EmptyGraphGenerator","l":"vertices(Collection)","url":"vertices(java.util.Collection)"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"vertices(Collection)","url":"vertices(java.util.Collection)"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"vertices(Collection)","url":"vertices(java.util.Collection)"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"vertices(Collection)","url":"vertices(java.util.Collection)"},{"p":"com.jgalgo.gen","c":"UniformTreeGenerator","l":"vertices(Collection)","url":"vertices(java.util.Collection)"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"vertices(int, IdBuilder)","url":"vertices(int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"CompleteGraphGenerator","l":"vertices(int, IdBuilder)","url":"vertices(int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"EmptyGraphGenerator","l":"vertices(int, IdBuilder)","url":"vertices(int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"vertices(int, IdBuilder)","url":"vertices(int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"vertices(int, IdBuilder)","url":"vertices(int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"vertices(int, IdBuilder)","url":"vertices(int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"UniformTreeGenerator","l":"vertices(int, IdBuilder)","url":"vertices(int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"vertices(int, int, IdBuilder)","url":"vertices(int,int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"vertices(int, int, IdBuilder)","url":"vertices(int,int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"vertices(int, int, IdBuilder)","url":"vertices(int,int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"vertices(int, int)","url":"vertices(int,int)"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"vertices(int, int)","url":"vertices(int,int)"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"vertices(int, int)","url":"vertices(int,int)"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"vertices(int)"},{"p":"com.jgalgo.gen","c":"CompleteGraphGenerator","l":"vertices(int)"},{"p":"com.jgalgo.gen","c":"EmptyGraphGenerator","l":"vertices(int)"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"vertices(int)"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"vertices(int)"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"vertices(int)"},{"p":"com.jgalgo.gen","c":"UniformTreeGenerator","l":"vertices(int)"},{"p":"com.jgalgo.alg.path","c":"Path","l":"verticesIter(Graph, V, List)","url":"verticesIter(com.jgalgo.graph.Graph,V,java.util.List)"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"verticesIter(IntGraph, int, IntList)","url":"verticesIter(com.jgalgo.graph.IntGraph,int,it.unimi.dsi.fastutil.ints.IntList)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder.ReIndexedGraph","l":"verticesReIndexing"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"verticesWeights(String)","url":"verticesWeights(java.lang.String)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"verticesWeights(String)","url":"verticesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"Graph","l":"verticesWeights(String)","url":"verticesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"verticesWeights(String)","url":"verticesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"verticesWeights(String)","url":"verticesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"verticesWeights(String)","url":"verticesWeights(java.lang.String)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"verticesWeightsKeys()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"verticesWeightsKeys()"},{"p":"com.jgalgo.graph","c":"Graph","l":"verticesWeightsKeys()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"verticesWeightsKeys()"},{"p":"com.jgalgo.gen","c":"UnionGraphGenerator","l":"verticesWeightsKeys(Set)","url":"verticesWeightsKeys(java.util.Set)"},{"p":"com.jgalgo.alg.connect","c":"WeaklyConnectedComponentsAlgoAbstract","l":"WeaklyConnectedComponentsAlgoAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"WeaklyConnectedComponentsAlgoImpl","l":"WeaklyConnectedComponentsAlgoImpl()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.graph","c":"IWeightFunction","l":"weight(int)"},{"p":"com.jgalgo.graph","c":"IWeightFunctionInt","l":"weight(int)"},{"p":"com.jgalgo.graph","c":"IWeightsDouble","l":"weight(int)"},{"p":"com.jgalgo.graph","c":"IWeightsFloat","l":"weight(int)"},{"p":"com.jgalgo.graph","c":"IWeightsLong","l":"weight(int)"},{"p":"com.jgalgo.graph","c":"IWeightFunction","l":"weight(Integer)","url":"weight(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightFunctionInt","l":"weight(Integer)","url":"weight(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsDouble","l":"weight(Integer)","url":"weight(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsFloat","l":"weight(Integer)","url":"weight(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsLong","l":"weight(Integer)","url":"weight(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"WeightFunction","l":"weight(K)"},{"p":"com.jgalgo.graph","c":"WeightFunctionInt","l":"weight(K)"},{"p":"com.jgalgo.graph","c":"WeightsDouble","l":"weight(K)"},{"p":"com.jgalgo.graph","c":"WeightsFloat","l":"weight(K)"},{"p":"com.jgalgo.graph","c":"WeightsLong","l":"weight(K)"},{"p":"com.jgalgo.graph","c":"IWeightFunctionInt","l":"weightInt(int)"},{"p":"com.jgalgo.graph","c":"IWeightsByte","l":"weightInt(int)"},{"p":"com.jgalgo.graph","c":"IWeightsInt","l":"weightInt(int)"},{"p":"com.jgalgo.graph","c":"IWeightsShort","l":"weightInt(int)"},{"p":"com.jgalgo.graph","c":"IWeightFunctionInt","l":"weightInt(Integer)","url":"weightInt(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsByte","l":"weightInt(Integer)","url":"weightInt(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsInt","l":"weightInt(Integer)","url":"weightInt(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsShort","l":"weightInt(Integer)","url":"weightInt(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"WeightFunctionInt","l":"weightInt(K)"},{"p":"com.jgalgo.graph","c":"WeightsByte","l":"weightInt(K)"},{"p":"com.jgalgo.graph","c":"WeightsInt","l":"weightInt(K)"},{"p":"com.jgalgo.graph","c":"WeightsShort","l":"weightInt(K)"},{"p":"com.jgalgo.graph","c":"IWeightFunction","l":"weightSum(Iterable)","url":"weightSum(java.lang.Iterable)"},{"p":"com.jgalgo.graph","c":"IWeightFunctionInt","l":"weightSum(Iterable)","url":"weightSum(java.lang.Iterable)"},{"p":"com.jgalgo.graph","c":"WeightFunction","l":"weightSum(Iterable)","url":"weightSum(java.lang.Iterable)"},{"p":"com.jgalgo.graph","c":"WeightFunctionInt","l":"weightSum(Iterable)","url":"weightSum(java.lang.Iterable)"},{"p":"com.jgalgo.graph","c":"IWeightFunction","l":"weightSum(IWeightFunction, IntIterable)","url":"weightSum(com.jgalgo.graph.IWeightFunction,it.unimi.dsi.fastutil.ints.IntIterable)"},{"p":"com.jgalgo.graph","c":"WeightFunction","l":"weightSum(WeightFunction, Iterable)","url":"weightSum(com.jgalgo.graph.WeightFunction,java.lang.Iterable)"},{"p":"com.jgalgo.io","c":"GraphWriter","l":"writeGraph(Graph, File)","url":"writeGraph(com.jgalgo.graph.Graph,java.io.File)"},{"p":"com.jgalgo.io","c":"GraphWriter","l":"writeGraph(Graph, String)","url":"writeGraph(com.jgalgo.graph.Graph,java.lang.String)"},{"p":"com.jgalgo.io","c":"GraphWriter","l":"writeGraph(Graph, Writer)","url":"writeGraph(com.jgalgo.graph.Graph,java.io.Writer)"},{"p":"com.jgalgo.io","c":"DimacsGraphWriter","l":"writeGraphImpl(Graph, Writer)","url":"writeGraphImpl(com.jgalgo.graph.Graph,java.io.Writer)"},{"p":"com.jgalgo.io","c":"LedaGraphWriter","l":"writeGraphImpl(Graph, Writer)","url":"writeGraphImpl(com.jgalgo.graph.Graph,java.io.Writer)"},{"p":"com.jgalgo.io","c":"GmlGraphWriter","l":"writeGraphImpl(Graph, Writer)","url":"writeGraphImpl(com.jgalgo.graph.Graph,java.io.Writer)"}] \ No newline at end of file +memberSearchIndex = [{"p":"com.jgalgo.graph","c":"AbstractGraph","l":"AbstractGraph()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableNetworkAdapter","l":"addEdge(EndpointPair, E)","url":"addEdge(com.google.common.graph.EndpointPair,E)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addEdge(int, int, int)","url":"addEdge(int,int,int)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"addEdge(int, int, int)","url":"addEdge(int,int,int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"addEdge(int, int, int)","url":"addEdge(int,int,int)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"addEdge(int, int, int)","url":"addEdge(int,int,int)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addEdge(int, int)","url":"addEdge(int,int)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"addEdge(int, int)","url":"addEdge(int,int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"addEdge(int, int)","url":"addEdge(int,int)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"addEdge(int, int)","url":"addEdge(int,int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"addEdge(Integer, Integer, Integer)","url":"addEdge(java.lang.Integer,java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"addEdge(Integer, Integer, Integer)","url":"addEdge(java.lang.Integer,java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"addEdge(Integer, Integer)","url":"addEdge(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"addEdge(Integer, Integer)","url":"addEdge(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableNetworkAdapter","l":"addEdge(V, V, E)","url":"addEdge(V,V,E)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"addEdge(V, V, E)","url":"addEdge(V,V,E)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"addEdge(V, V, E)","url":"addEdge(V,V,E)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"addEdge(V, V, E)","url":"addEdge(V,V,E)"},{"p":"com.jgalgo.graph","c":"Graph","l":"addEdge(V, V, E)","url":"addEdge(V,V,E)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"addEdge(V, V, E)","url":"addEdge(V,V,E)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"addEdge(V, V)","url":"addEdge(V,V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"addEdge(V, V)","url":"addEdge(V,V)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"addEdge(V, V)","url":"addEdge(V,V)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addEdgeRemoveListener(IndexRemoveListener)","url":"addEdgeRemoveListener(com.jgalgo.graph.IndexRemoveListener)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addEdges(EdgeSet)","url":"addEdges(com.jgalgo.graph.EdgeSet)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"addEdges(EdgeSet)","url":"addEdges(com.jgalgo.graph.EdgeSet)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"addEdges(EdgeSet)","url":"addEdges(com.jgalgo.graph.EdgeSet)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"addEdges(EdgeSet)","url":"addEdges(com.jgalgo.graph.EdgeSet)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"addEdges(EdgeSet)","url":"addEdges(com.jgalgo.graph.EdgeSet)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"addEdges(EdgeSet)","url":"addEdges(com.jgalgo.graph.EdgeSet)"},{"p":"com.jgalgo.graph","c":"Graph","l":"addEdges(EdgeSet)","url":"addEdges(com.jgalgo.graph.EdgeSet)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"addEdges(EdgeSet)","url":"addEdges(com.jgalgo.graph.EdgeSet)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addEdgesReassignIds(IEdgeSet)","url":"addEdgesReassignIds(com.jgalgo.graph.IEdgeSet)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"addEdgesReassignIds(IEdgeSet)","url":"addEdgesReassignIds(com.jgalgo.graph.IEdgeSet)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"addEdgesWeights(String, Class, T)","url":"addEdgesWeights(java.lang.String,java.lang.Class,T)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"addEdgesWeights(String, Class, T)","url":"addEdgesWeights(java.lang.String,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"Graph","l":"addEdgesWeights(String, Class, T)","url":"addEdgesWeights(java.lang.String,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"addEdgesWeights(String, Class, T)","url":"addEdgesWeights(java.lang.String,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addEdgesWeights(String, Class, T)","url":"addEdgesWeights(java.lang.String,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"Graph","l":"addEdgesWeights(String, Class)","url":"addEdgesWeights(java.lang.String,java.lang.Class)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"addEdgesWeights(String, Class)","url":"addEdgesWeights(java.lang.String,java.lang.Class)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addEdgesWeights(String, Class)","url":"addEdgesWeights(java.lang.String,java.lang.Class)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"addHint(GraphFactory.Hint)","url":"addHint(com.jgalgo.graph.GraphFactory.Hint)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"addHint(GraphFactory.Hint)","url":"addHint(com.jgalgo.graph.GraphFactory.Hint)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"addHint(GraphFactory.Hint)","url":"addHint(com.jgalgo.graph.GraphFactory.Hint)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorDynamic","l":"addLeaf(LowestCommonAncestorDynamic.Vertex)","url":"addLeaf(com.jgalgo.alg.tree.LowestCommonAncestorDynamic.Vertex)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableGraphAdapter","l":"addNode(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableNetworkAdapter","l":"addNode(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableValueGraphAdapter","l":"addNode(V)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.IQueries","l":"addQuery(int, int)","url":"addQuery(int,int)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.IQueries","l":"addQuery(int, int)","url":"addQuery(int,int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.IQueries","l":"addQuery(Integer, Integer)","url":"addQuery(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.IQueries","l":"addQuery(Integer, Integer)","url":"addQuery(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.Queries","l":"addQuery(V, V)","url":"addQuery(V,V)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.Queries","l":"addQuery(V, V)","url":"addQuery(V,V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"addVertex()"},{"p":"com.jgalgo.graph","c":"Graph","l":"addVertex()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"addVertex()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"addVertex()"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"addVertex()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addVertex(int)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"addVertex(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"addVertex(int)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"addVertex(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"addVertex(Integer)","url":"addVertex(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"addVertex(Integer)","url":"addVertex(java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"addVertex(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"addVertex(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"addVertex(V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"addVertex(V)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"addVertex(V)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addVertexInt()"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"addVertexInt()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"addVertexInt()"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"addVertexInt()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addVertexRemoveListener(IndexRemoveListener)","url":"addVertexRemoveListener(com.jgalgo.graph.IndexRemoveListener)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addVertices(Collection)","url":"addVertices(java.util.Collection)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"addVertices(Collection)","url":"addVertices(java.util.Collection)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"addVertices(Collection)","url":"addVertices(java.util.Collection)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"addVertices(Collection)","url":"addVertices(java.util.Collection)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"addVertices(Collection)","url":"addVertices(java.util.Collection)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"addVertices(Collection)","url":"addVertices(java.util.Collection)"},{"p":"com.jgalgo.graph","c":"Graph","l":"addVertices(Collection)","url":"addVertices(java.util.Collection)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"addVertices(Collection)","url":"addVertices(java.util.Collection)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"addVerticesWeights(String, Class, T)","url":"addVerticesWeights(java.lang.String,java.lang.Class,T)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"addVerticesWeights(String, Class, T)","url":"addVerticesWeights(java.lang.String,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"Graph","l":"addVerticesWeights(String, Class, T)","url":"addVerticesWeights(java.lang.String,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"addVerticesWeights(String, Class, T)","url":"addVerticesWeights(java.lang.String,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addVerticesWeights(String, Class, T)","url":"addVerticesWeights(java.lang.String,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"Graph","l":"addVerticesWeights(String, Class)","url":"addVerticesWeights(java.lang.String,java.lang.Class)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"addVerticesWeights(String, Class)","url":"addVerticesWeights(java.lang.String,java.lang.Class)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"addVerticesWeights(String, Class)","url":"addVerticesWeights(java.lang.String,java.lang.Class)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"adjacentEdges(E)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"adjacentNodes(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"adjacentNodes(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"adjacentNodes(V)"},{"p":"com.jgalgo.alg","c":"EdgeDirection","l":"All"},{"p":"com.jgalgo.alg.closure","c":"ClosuresEnumerator","l":"allClosures(Graph)","url":"allClosures(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutAllST","l":"allMinimumCuts(Graph, WeightFunction, V, V)","url":"allMinimumCuts(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllST","l":"allMinimumCuts(Graph, WeightFunction, V, V)","url":"allMinimumCuts(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllGlobal","l":"allMinimumCuts(Graph, WeightFunction)","url":"allMinimumCuts(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.graph","c":"EdgeSet","l":"allOf(Graph)","url":"allOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"IEdgeSet","l":"allOf(IntGraph)","url":"allOf(com.jgalgo.graph.IntGraph)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"allowParallelEdges()"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"allowParallelEdges()"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"allowParallelEdges()"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"allowParallelEdges(boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"allowParallelEdges(boolean)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"allowParallelEdges(boolean)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"allowSelfEdges()"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"allowSelfEdges()"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"allowSelfEdges()"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"allowSelfEdges(boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"allowSelfEdges(boolean)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"allowSelfEdges(boolean)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"allowsParallelEdges()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"allowsSelfLoops()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"allowsSelfLoops()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"allowsSelfLoops()"},{"p":"com.jgalgo.alg.path","c":"SimplePathsEnumerator","l":"allSimplePaths(Graph, V, V)","url":"allSimplePaths(com.jgalgo.graph.Graph,V,V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"asGraph()"},{"p":"com.jgalgo.graph","c":"WeightFunctions","l":"asIntGraphWeightFunc(WeightFunction)","url":"asIntGraphWeightFunc(com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.IResult","l":"backtrackEdge(int)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.IResult","l":"backtrackEdge(Integer)","url":"backtrackEdge(java.lang.Integer)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Result","l":"backtrackEdge(V)"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"BarabasiAlbertGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"BarabasiAlbertGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.example","c":"BfsDfsExample","l":"bfsExample()"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter","l":"bfsLayers(Graph, V)","url":"bfsLayers(com.jgalgo.graph.Graph,V)"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter","l":"bfsTree(Graph, V, boolean)","url":"bfsTree(com.jgalgo.graph.Graph,V,boolean)"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter","l":"bfsTree(Graph, V)","url":"bfsTree(com.jgalgo.graph.Graph,V)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgoAbstract","l":"BiConnectedComponentsAlgoAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgoHopcroftTarjan","l":"BiConnectedComponentsAlgoHopcroftTarjan()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"blockEdges(int)"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"blockEdges(int)"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"blocksGraph()"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"blocksGraph()"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"blocksGraph(boolean, boolean)","url":"blocksGraph(boolean,boolean)"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"blocksGraph(boolean, boolean)","url":"blocksGraph(boolean,boolean)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.IResult","l":"blockSite(int)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.Result","l":"blockSite(int)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.IResult","l":"blockSiteInt(int)"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"blockSubGraph(int, boolean, boolean)","url":"blockSubGraph(int,boolean,boolean)"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"blockSubGraph(int, boolean, boolean)","url":"blockSubGraph(int,boolean,boolean)"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"blockSubGraph(int)"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"blockSubGraph(int)"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"blockVertices(int)"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"blockVertices(int)"},{"p":"com.jgalgo.alg.clique","c":"MaximalCliquesEnumerator.Builder","l":"build()"},{"p":"com.jgalgo.alg.color","c":"ColoringAlgo.Builder","l":"build()"},{"p":"com.jgalgo.alg.connect","c":"StronglyConnectedComponentsAlgo.Builder","l":"build()"},{"p":"com.jgalgo.alg.cover","c":"EdgeCover.Builder","l":"build()"},{"p":"com.jgalgo.alg.cycle","c":"CyclesEnumerator.Builder","l":"build()"},{"p":"com.jgalgo.alg.cycle","c":"MinimumMeanCycle.Builder","l":"build()"},{"p":"com.jgalgo.alg.flow","c":"MaximumFlow.Builder","l":"build()"},{"p":"com.jgalgo.alg.flow","c":"MinimumCostFlow.Builder","l":"build()"},{"p":"com.jgalgo.alg.match","c":"MatchingAlgo.Builder","l":"build()"},{"p":"com.jgalgo.alg.path","c":"KShortestPathsST.Builder","l":"build()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs.Builder","l":"build()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathHeuristicST.Builder","l":"build()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathST.Builder","l":"build()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Builder","l":"build()"},{"p":"com.jgalgo.alg.span","c":"MinimumSpanningTree.Builder","l":"build()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorDynamic.Builder","l":"build()"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.Builder","l":"build()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"build()"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"build()"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"build()"},{"p":"com.jgalgo.graph","c":"IdBuilderInt","l":"build(IntSet)","url":"build(it.unimi.dsi.fastutil.ints.IntSet)"},{"p":"com.jgalgo.graph","c":"IdBuilderInt","l":"build(Set)","url":"build(java.util.Set)"},{"p":"com.jgalgo.graph","c":"IdBuilder","l":"build(Set)","url":"build(java.util.Set)"},{"p":"com.jgalgo.alg.clique","c":"MaximalCliquesEnumerator","l":"builder()"},{"p":"com.jgalgo.alg.color","c":"ColoringAlgo","l":"builder()"},{"p":"com.jgalgo.alg.connect","c":"StronglyConnectedComponentsAlgo","l":"builder()"},{"p":"com.jgalgo.alg.cover","c":"EdgeCover","l":"builder()"},{"p":"com.jgalgo.alg.cycle","c":"CyclesEnumerator","l":"builder()"},{"p":"com.jgalgo.alg.cycle","c":"MinimumMeanCycle","l":"builder()"},{"p":"com.jgalgo.alg.flow","c":"MaximumFlow","l":"builder()"},{"p":"com.jgalgo.alg.flow","c":"MinimumCostFlow","l":"builder()"},{"p":"com.jgalgo.alg.match","c":"MatchingAlgo","l":"builder()"},{"p":"com.jgalgo.alg.path","c":"KShortestPathsST","l":"builder()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs","l":"builder()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathHeuristicST","l":"builder()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathST","l":"builder()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource","l":"builder()"},{"p":"com.jgalgo.alg.span","c":"MinimumSpanningTree","l":"builder()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorDynamic","l":"builder()"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima","l":"builder()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"buildMutable()"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"buildMutable()"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"buildMutable()"},{"p":"com.jgalgo.graph","c":"IWeightFunction","l":"CardinalityWeightFunction"},{"p":"com.jgalgo.graph","c":"WeightFunction","l":"CardinalityWeightFunction"},{"p":"com.jgalgo.graph","c":"WeightFunction","l":"cardinalityWeightFunction()"},{"p":"com.jgalgo.alg.distancemeasures","c":"DistanceMeasures","l":"center()"},{"p":"com.jgalgo.alg.distancemeasures","c":"IDistanceMeasures","l":"center()"},{"p":"com.jgalgo.alg.cycle","c":"ChinesePostmanAbstract","l":"ChinesePostmanAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.cycle","c":"ChinesePostmanImpl","l":"ChinesePostmanImpl()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"clear()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"clear()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorDynamic","l":"clear()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.Queries","l":"clear()"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.Queries","l":"clear()"},{"p":"com.jgalgo.graph","c":"Graph","l":"clear()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"clear()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"clear()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"clearEdges()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"clearEdges()"},{"p":"com.jgalgo.graph","c":"Graph","l":"clearEdges()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"clearEdges()"},{"p":"com.jgalgo.alg.closure","c":"ClosuresEnumeratorAbstract","l":"ClosuresEnumeratorAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.closure","c":"ClosuresEnumeratorSchrageBaker","l":"ClosuresEnumeratorSchrageBaker()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.closure","c":"ClosuresEnumerator","l":"closuresIter(Graph)","url":"closuresIter(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.closure","c":"ClosuresEnumeratorAbstract","l":"closuresIter(Graph)","url":"closuresIter(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.color","c":"ColoringAlgoAbstract","l":"ColoringAlgoAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.color","c":"ColoringDSatur","l":"ColoringDSatur()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.example","c":"ColoringExample","l":"coloringExample()"},{"p":"com.jgalgo.alg.color","c":"ColoringGreedy","l":"ColoringGreedy()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.color","c":"ColoringRecursiveLargestFirst","l":"ColoringRecursiveLargestFirst()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"LineGraphGenerator","l":"commonVertexWeights(String)","url":"commonVertexWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"IWeightFunction","l":"compare(int, int)","url":"compare(int,int)"},{"p":"com.jgalgo.graph","c":"IWeightFunctionInt","l":"compare(int, int)","url":"compare(int,int)"},{"p":"com.jgalgo.graph","c":"IWeightFunction","l":"compare(Integer, Integer)","url":"compare(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightFunctionInt","l":"compare(Integer, Integer)","url":"compare(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsByte","l":"compare(Integer, Integer)","url":"compare(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsDouble","l":"compare(Integer, Integer)","url":"compare(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsFloat","l":"compare(Integer, Integer)","url":"compare(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsInt","l":"compare(Integer, Integer)","url":"compare(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsLong","l":"compare(Integer, Integer)","url":"compare(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsShort","l":"compare(Integer, Integer)","url":"compare(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"WeightFunction","l":"compare(K, K)","url":"compare(K,K)"},{"p":"com.jgalgo.graph","c":"WeightFunctionInt","l":"compare(K, K)","url":"compare(K,K)"},{"p":"com.jgalgo.gen","c":"ComplementGraphGenerator","l":"ComplementGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"ComplementGraphGenerator","l":"ComplementGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"CompleteBipartiteGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"CompleteBipartiteGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.gen","c":"CompleteGraphGenerator","l":"CompleteGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"CompleteGraphGenerator","l":"CompleteGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs","l":"computeAllShortestPaths(Graph, WeightFunction)","url":"computeAllShortestPaths(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.color","c":"ColoringAlgo","l":"computeColoring(Graph)","url":"computeColoring(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.color","c":"ColoringAlgoAbstract","l":"computeColoring(Graph)","url":"computeColoring(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo","l":"computeCores(Graph, EdgeDirection)","url":"computeCores(com.jgalgo.graph.Graph,com.jgalgo.alg.EdgeDirection)"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgoAbstract","l":"computeCores(Graph, EdgeDirection)","url":"computeCores(com.jgalgo.graph.Graph,com.jgalgo.alg.EdgeDirection)"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo","l":"computeCores(Graph)","url":"computeCores(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.euler","c":"EulerianTourAlgo","l":"computeEulerianTour(Graph)","url":"computeEulerianTour(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.euler","c":"EulerianTourAlgo","l":"computeEulerianTourIfExist(Graph)","url":"computeEulerianTourIfExist(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima","l":"computeHeaviestEdgeInTreePaths(Graph, WeightFunction, TreePathMaxima.Queries)","url":"computeHeaviestEdgeInTreePaths(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,com.jgalgo.alg.tree.TreePathMaxima.Queries)"},{"p":"com.jgalgo.alg.connect","c":"KEdgeConnectedComponentsAlgo","l":"computeKEdgeConnectedComponents(Graph, int)","url":"computeKEdgeConnectedComponents(com.jgalgo.graph.Graph,int)"},{"p":"com.jgalgo.alg.connect","c":"KEdgeConnectedComponentsAlgoAbstract","l":"computeKEdgeConnectedComponents(Graph, int)","url":"computeKEdgeConnectedComponents(com.jgalgo.graph.Graph,int)"},{"p":"com.jgalgo.alg.path","c":"KShortestPathsST","l":"computeKShortestPaths(Graph, WeightFunction, V, V, int)","url":"computeKShortestPaths(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V,int)"},{"p":"com.jgalgo.alg.flow","c":"MaximumFlow","l":"computeMaximumFlow(Graph, WeightFunction, Collection, Collection)","url":"computeMaximumFlow(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.alg.flow","c":"MaximumFlow","l":"computeMaximumFlow(Graph, WeightFunction, V, V)","url":"computeMaximumFlow(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.match","c":"MatchingAlgo","l":"computeMaximumMatching(Graph, WeightFunction)","url":"computeMaximumMatching(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.match","c":"MatchingAlgo","l":"computeMaximumPerfectMatching(Graph, WeightFunction)","url":"computeMaximumPerfectMatching(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.flow","c":"MinimumCostFlow","l":"computeMinCostFlow(Graph, WeightFunction, WeightFunction, WeightFunction, WeightFunction)","url":"computeMinCostFlow(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,com.jgalgo.graph.WeightFunction,com.jgalgo.graph.WeightFunction,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.flow","c":"MinimumCostFlow","l":"computeMinCostFlow(Graph, WeightFunction, WeightFunction, WeightFunction)","url":"computeMinCostFlow(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,com.jgalgo.graph.WeightFunction,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.flow","c":"MinimumCostFlow","l":"computeMinCostMaxFlow(Graph, WeightFunction, WeightFunction, Collection, Collection)","url":"computeMinCostMaxFlow(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,com.jgalgo.graph.WeightFunction,java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.alg.flow","c":"MinimumCostFlow","l":"computeMinCostMaxFlow(Graph, WeightFunction, WeightFunction, V, V)","url":"computeMinCostMaxFlow(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.flow","c":"MinimumCostFlow","l":"computeMinCostMaxFlow(Graph, WeightFunction, WeightFunction, WeightFunction, Collection, Collection)","url":"computeMinCostMaxFlow(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,com.jgalgo.graph.WeightFunction,com.jgalgo.graph.WeightFunction,java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.alg.flow","c":"MinimumCostFlow","l":"computeMinCostMaxFlow(Graph, WeightFunction, WeightFunction, WeightFunction, V, V)","url":"computeMinCostMaxFlow(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,com.jgalgo.graph.WeightFunction,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutST","l":"computeMinimumCut(Graph, WeightFunction, Collection, Collection)","url":"computeMinimumCut(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutSTAbstract","l":"computeMinimumCut(Graph, WeightFunction, Collection, Collection)","url":"computeMinimumCut(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutST","l":"computeMinimumCut(Graph, WeightFunction, V, V)","url":"computeMinimumCut(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutSTAbstract","l":"computeMinimumCut(Graph, WeightFunction, V, V)","url":"computeMinimumCut(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutGlobal","l":"computeMinimumCut(Graph, WeightFunction)","url":"computeMinimumCut(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutGlobalAbstract","l":"computeMinimumCut(Graph, WeightFunction)","url":"computeMinimumCut(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutST","l":"computeMinimumCut(Graph, WeightFunction, V, V)","url":"computeMinimumCut(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutSTAbstract","l":"computeMinimumCut(Graph, WeightFunction, V, V)","url":"computeMinimumCut(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutGlobal","l":"computeMinimumCut(Graph, WeightFunction)","url":"computeMinimumCut(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutGlobalAbstract","l":"computeMinimumCut(Graph, WeightFunction)","url":"computeMinimumCut(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.span","c":"MinimumDirectedSpanningTree","l":"computeMinimumDirectedSpanningTree(Graph, WeightFunction, V)","url":"computeMinimumDirectedSpanningTree(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V)"},{"p":"com.jgalgo.alg.cover","c":"DominatingSetAlgo","l":"computeMinimumDominationSet(Graph, WeightFunction, EdgeDirection)","url":"computeMinimumDominationSet(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,com.jgalgo.alg.EdgeDirection)"},{"p":"com.jgalgo.alg.cover","c":"DominatingSetAlgoAbstract","l":"computeMinimumDominationSet(Graph, WeightFunction, EdgeDirection)","url":"computeMinimumDominationSet(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,com.jgalgo.alg.EdgeDirection)"},{"p":"com.jgalgo.alg.cover","c":"DominatingSetAlgo","l":"computeMinimumDominationSet(Graph, WeightFunction)","url":"computeMinimumDominationSet(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.cover","c":"EdgeCover","l":"computeMinimumEdgeCover(Graph, WeightFunction)","url":"computeMinimumEdgeCover(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.cover","c":"EdgeCoverAbstract","l":"computeMinimumEdgeCover(Graph, WeightFunction)","url":"computeMinimumEdgeCover(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.match","c":"MatchingAlgo","l":"computeMinimumMatching(Graph, WeightFunction)","url":"computeMinimumMatching(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.cycle","c":"MinimumMeanCycle","l":"computeMinimumMeanCycle(Graph, WeightFunction)","url":"computeMinimumMeanCycle(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.cycle","c":"MinimumMeanCycleAbstract","l":"computeMinimumMeanCycle(Graph, WeightFunction)","url":"computeMinimumMeanCycle(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.match","c":"MatchingAlgo","l":"computeMinimumPerfectMatching(Graph, WeightFunction)","url":"computeMinimumPerfectMatching(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.span","c":"MinimumSpanningTree","l":"computeMinimumSpanningTree(Graph, WeightFunction)","url":"computeMinimumSpanningTree(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.cover","c":"VertexCover","l":"computeMinimumVertexCover(Graph, WeightFunction)","url":"computeMinimumVertexCover(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.cover","c":"VertexCoverAbstract","l":"computeMinimumVertexCover(Graph, WeightFunction)","url":"computeMinimumVertexCover(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.cycle","c":"ChinesePostman","l":"computeShortestEdgeVisitorCircle(Graph, WeightFunction)","url":"computeShortestEdgeVisitorCircle(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.cycle","c":"ChinesePostman","l":"computeShortestEdgeVisitorCircleIfExist(Graph, WeightFunction)","url":"computeShortestEdgeVisitorCircleIfExist(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.cycle","c":"ChinesePostmanAbstract","l":"computeShortestEdgeVisitorCircleIfExist(Graph, WeightFunction)","url":"computeShortestEdgeVisitorCircleIfExist(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathHeuristicST","l":"computeShortestPath(Graph, WeightFunction, V, V, ToDoubleFunction)","url":"computeShortestPath(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V,java.util.function.ToDoubleFunction)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathST","l":"computeShortestPath(Graph, WeightFunction, V, V)","url":"computeShortestPath(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathHeuristicST","l":"computeShortestPath(IntGraph, IWeightFunction, int, int, IntToDoubleFunction)","url":"computeShortestPath(com.jgalgo.graph.IntGraph,com.jgalgo.graph.IWeightFunction,int,int,java.util.function.IntToDoubleFunction)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathST","l":"computeShortestPathAndWeight(Graph, WeightFunction, V, V)","url":"computeShortestPathAndWeight(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource","l":"computeShortestPaths(Graph, WeightFunction, V)","url":"computeShortestPaths(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V)"},{"p":"com.jgalgo.alg.path","c":"TspMetric","l":"computeShortestTour(Graph, WeightFunction)","url":"computeShortestTour(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.span","c":"SteinerTreeAlgo","l":"computeSteinerTree(Graph, WeightFunction, Collection)","url":"computeSteinerTree(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,java.util.Collection)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs","l":"computeSubsetShortestPaths(Graph, Collection, WeightFunction)","url":"computeSubsetShortestPaths(com.jgalgo.graph.Graph,java.util.Collection,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.dag","c":"TopologicalOrderAlgo","l":"computeTopologicalSorting(Graph)","url":"computeTopologicalSorting(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.dag","c":"TopologicalOrderAlgo","l":"computeTopologicalSortingIfExist(Graph)","url":"computeTopologicalSortingIfExist(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.dag","c":"TopologicalOrderAlgoAbstract","l":"computeTopologicalSortingIfExist(Graph)","url":"computeTopologicalSortingIfExist(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo","l":"computeVoronoiCells(Graph, Collection, WeightFunction)","url":"computeVoronoiCells(com.jgalgo.graph.Graph,java.util.Collection,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"containsEdge(E)"},{"p":"com.jgalgo.alg.match","c":"Matching","l":"containsEdge(E)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"containsEdge(int, int)","url":"containsEdge(int,int)"},{"p":"com.jgalgo.alg.match","c":"IMatching","l":"containsEdge(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"containsEdge(Integer, Integer)","url":"containsEdge(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.alg.match","c":"IMatching","l":"containsEdge(Integer)","url":"containsEdge(java.lang.Integer)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"containsEdge(V, V)","url":"containsEdge(V,V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"containsEdge(V, V)","url":"containsEdge(V,V)"},{"p":"com.jgalgo.graph","c":"Graphs","l":"containsParallelEdges(Graph)","url":"containsParallelEdges(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"containsVertex(V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"copy()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"copy()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"copy()"},{"p":"com.jgalgo.graph","c":"Graph","l":"copy(boolean, boolean)","url":"copy(boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"copy(boolean, boolean)","url":"copy(boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"copy(boolean, boolean)","url":"copy(boolean,boolean)"},{"p":"com.jgalgo.gen","c":"UnionGraphGenerator","l":"copyWeights(boolean, boolean)","url":"copyWeights(boolean,boolean)"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo.IResult","l":"coreCrust(int)"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo.Result","l":"coreCrust(int)"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgoAbstract","l":"CoresAlgoAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgoImpl","l":"CoresAlgoImpl()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo.IResult","l":"coreShell(int)"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo.Result","l":"coreShell(int)"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo.IResult","l":"coreVertices(int)"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo.Result","l":"coreVertices(int)"},{"p":"com.jgalgo.graph","c":"Weights","l":"createExternalEdgesWeights(Graph, Class, T)","url":"createExternalEdgesWeights(com.jgalgo.graph.Graph,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"Weights","l":"createExternalEdgesWeights(Graph, Class)","url":"createExternalEdgesWeights(com.jgalgo.graph.Graph,java.lang.Class)"},{"p":"com.jgalgo.graph","c":"IWeights","l":"createExternalEdgesWeights(IntGraph, Class, T)","url":"createExternalEdgesWeights(com.jgalgo.graph.IntGraph,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"IWeights","l":"createExternalEdgesWeights(IntGraph, Class)","url":"createExternalEdgesWeights(com.jgalgo.graph.IntGraph,java.lang.Class)"},{"p":"com.jgalgo.graph","c":"Weights","l":"createExternalVerticesWeights(Graph, Class, T)","url":"createExternalVerticesWeights(com.jgalgo.graph.Graph,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"Weights","l":"createExternalVerticesWeights(Graph, Class)","url":"createExternalVerticesWeights(com.jgalgo.graph.Graph,java.lang.Class)"},{"p":"com.jgalgo.graph","c":"IWeights","l":"createExternalVerticesWeights(IntGraph, Class, T)","url":"createExternalVerticesWeights(com.jgalgo.graph.IntGraph,java.lang.Class,T)"},{"p":"com.jgalgo.graph","c":"IWeights","l":"createExternalVerticesWeights(IntGraph, Class)","url":"createExternalVerticesWeights(com.jgalgo.graph.IntGraph,java.lang.Class)"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"crossEdges()"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"crossEdges()"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"crossEdges(int, int)","url":"crossEdges(int,int)"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"crossEdges(int, int)","url":"crossEdges(int,int)"},{"p":"com.jgalgo.alg.path","c":"NegativeCycleException","l":"cycle()"},{"p":"com.jgalgo.alg.path","c":"NegativeCycleException","l":"cycle(Graph)","url":"cycle(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.cycle","c":"CyclesEnumeratorAbstract","l":"CyclesEnumeratorAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.cycle","c":"CyclesEnumeratorJohnson","l":"CyclesEnumeratorJohnson()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.cycle","c":"CyclesEnumeratorTarjan","l":"CyclesEnumeratorTarjan()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.cycle","c":"CyclesEnumerator","l":"cyclesIter(Graph)","url":"cyclesIter(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.cycle","c":"CyclesEnumeratorAbstract","l":"cyclesIter(Graph)","url":"cyclesIter(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"IdBuilderInt","l":"defaultBuilder()"},{"p":"com.jgalgo.graph","c":"IdBuilder","l":"defaultBuilder(Class)","url":"defaultBuilder(java.lang.Class)"},{"p":"com.jgalgo.graph","c":"IdBuilderInt","l":"defaultFactory()"},{"p":"com.jgalgo.graph","c":"IdBuilder","l":"defaultFactory(Class)","url":"defaultFactory(java.lang.Class)"},{"p":"com.jgalgo.graph","c":"WeightsBool","l":"defaultWeight()"},{"p":"com.jgalgo.graph","c":"WeightsByte","l":"defaultWeight()"},{"p":"com.jgalgo.graph","c":"WeightsChar","l":"defaultWeight()"},{"p":"com.jgalgo.graph","c":"WeightsDouble","l":"defaultWeight()"},{"p":"com.jgalgo.graph","c":"WeightsFloat","l":"defaultWeight()"},{"p":"com.jgalgo.graph","c":"WeightsInt","l":"defaultWeight()"},{"p":"com.jgalgo.graph","c":"WeightsLong","l":"defaultWeight()"},{"p":"com.jgalgo.graph","c":"WeightsObj","l":"defaultWeight()"},{"p":"com.jgalgo.graph","c":"WeightsShort","l":"defaultWeight()"},{"p":"com.jgalgo.graph","c":"Weights","l":"defaultWeightAsObj()"},{"p":"com.jgalgo.graph","c":"WeightsBool","l":"defaultWeightAsObj()"},{"p":"com.jgalgo.graph","c":"WeightsByte","l":"defaultWeightAsObj()"},{"p":"com.jgalgo.graph","c":"WeightsChar","l":"defaultWeightAsObj()"},{"p":"com.jgalgo.graph","c":"WeightsDouble","l":"defaultWeightAsObj()"},{"p":"com.jgalgo.graph","c":"WeightsFloat","l":"defaultWeightAsObj()"},{"p":"com.jgalgo.graph","c":"WeightsInt","l":"defaultWeightAsObj()"},{"p":"com.jgalgo.graph","c":"WeightsLong","l":"defaultWeightAsObj()"},{"p":"com.jgalgo.graph","c":"WeightsObj","l":"defaultWeightAsObj()"},{"p":"com.jgalgo.graph","c":"WeightsShort","l":"defaultWeightAsObj()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"degree(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"degree(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"degreeOf(V)"},{"p":"com.jgalgo.graph","c":"GraphFactory.Hint","l":"DenseGraph"},{"p":"com.jgalgo.example","c":"BfsDfsExample","l":"dfsExample()"},{"p":"com.jgalgo.alg.traversal","c":"DfsIter","l":"dfsTree(Graph, V, boolean)","url":"dfsTree(com.jgalgo.graph.Graph,V,boolean)"},{"p":"com.jgalgo.alg.traversal","c":"DfsIter","l":"dfsTree(Graph, V)","url":"dfsTree(com.jgalgo.graph.Graph,V)"},{"p":"com.jgalgo.alg.distancemeasures","c":"DistanceMeasures","l":"diameter()"},{"p":"com.jgalgo.gen","c":"DifferenceGraphGenerator","l":"DifferenceGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"DifferenceGraphGenerator","l":"DifferenceGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.io","c":"Digraph6GraphReader","l":"Digraph6GraphReader()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.io","c":"Digraph6GraphWriter","l":"Digraph6GraphWriter()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.io","c":"DimacsGraphReader","l":"DimacsGraphReader()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.io","c":"DimacsGraphWriter","l":"DimacsGraphWriter()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"directed()"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"directed()"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"directed()"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"directed()"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"directed()"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"directed()"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"directed(boolean)"},{"p":"com.jgalgo.gen","c":"CompleteGraphGenerator","l":"directed(boolean)"},{"p":"com.jgalgo.gen","c":"EmptyGraphGenerator","l":"directed(boolean)"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"directed(boolean)"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"directed(boolean)"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"directed(boolean)"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"directedAll()"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"directedAll()"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"directedAll()"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"directedLeftToRight()"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"directedLeftToRight()"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"directedLeftToRight()"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"directedRightToLeft()"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"directedRightToLeft()"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"directedRightToLeft()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs.IResult","l":"distance(int, int)","url":"distance(int,int)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.IResult","l":"distance(int)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.IResult","l":"distance(int)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs.IResult","l":"distance(Integer, Integer)","url":"distance(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.IResult","l":"distance(Integer)","url":"distance(java.lang.Integer)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.IResult","l":"distance(Integer)","url":"distance(java.lang.Integer)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs.Result","l":"distance(V, V)","url":"distance(V,V)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Result","l":"distance(V)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.Result","l":"distance(V)"},{"p":"com.jgalgo.alg.cover","c":"DominatingSetAlgoAbstract","l":"DominatingSetAlgoAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.cover","c":"DominatingSetAlgoGreedy","l":"DominatingSetAlgoGreedy()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.example","c":"LowestCommonAncestorExample","l":"dynamicLCAExample()"},{"p":"com.jgalgo.alg.distancemeasures","c":"IDistanceMeasures","l":"eccentricity(int)"},{"p":"com.jgalgo.alg.distancemeasures","c":"IDistanceMeasures","l":"eccentricity(Integer)","url":"eccentricity(java.lang.Integer)"},{"p":"com.jgalgo.alg.distancemeasures","c":"DistanceMeasures","l":"eccentricity(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"edgeBuilder()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"edgeBuilder()"},{"p":"com.jgalgo.graph","c":"Graph","l":"edgeBuilder()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"edgeBuilder()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"edgeBuilder()"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"edgeBuilder()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"edgeBuilder()"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"edgeBuilder()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"edgeConnectingOrNull(V, V)","url":"edgeConnectingOrNull(V,V)"},{"p":"com.jgalgo.alg.cover","c":"EdgeCoverAbstract","l":"EdgeCoverAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.cover","c":"EdgeCoverCardinality","l":"EdgeCoverCardinality()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.cover","c":"EdgeCoverWeighted","l":"EdgeCoverWeighted()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"DifferenceGraphGenerator","l":"edgeDifferenceByEndpoints()"},{"p":"com.jgalgo.gen","c":"SymmetricDifferenceGraphGenerator","l":"edgeDifferenceByEndpoints()"},{"p":"com.jgalgo.gen","c":"DifferenceGraphGenerator","l":"edgeDifferenceById()"},{"p":"com.jgalgo.gen","c":"SymmetricDifferenceGraphGenerator","l":"edgeDifferenceById()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"edgeEndpoint(E, V)","url":"edgeEndpoint(E,V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"edgeEndpoint(E, V)","url":"edgeEndpoint(E,V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"edgeEndpoint(E, V)","url":"edgeEndpoint(E,V)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"edgeEndpoint(int, int)","url":"edgeEndpoint(int,int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"edgeEndpoint(Integer, Integer)","url":"edgeEndpoint(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.gen","c":"IntersectionGraphGenerator","l":"edgeIntersectByEndpoints()"},{"p":"com.jgalgo.gen","c":"IntersectionGraphGenerator","l":"edgeIntersectById()"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"edgeIter()"},{"p":"com.jgalgo.alg.path","c":"Path","l":"edgeIter()"},{"p":"com.jgalgo.example","c":"EdgeIterationExample","l":"edgeIterationExample()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"edgeOrder()"},{"p":"com.jgalgo.alg.traversal","c":"DfsIter","l":"edgePath()"},{"p":"com.jgalgo.alg.traversal","c":"DfsIter.Int","l":"edgePath()"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"edgeProbabilities(double, double, double, double)","url":"edgeProbabilities(double,double,double,double)"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"edgeProbability(double)"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"edgeProbability(double)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"edges()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"edges()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"edges()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"edges()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"edges()"},{"p":"com.jgalgo.alg.match","c":"IMatching","l":"edges()"},{"p":"com.jgalgo.alg.match","c":"Matching","l":"edges()"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"edges()"},{"p":"com.jgalgo.alg.path","c":"Path","l":"edges()"},{"p":"com.jgalgo.alg.span","c":"MinimumSpanningTree.IResult","l":"edges()"},{"p":"com.jgalgo.alg.span","c":"MinimumSpanningTree.Result","l":"edges()"},{"p":"com.jgalgo.alg.span","c":"SteinerTreeAlgo.IResult","l":"edges()"},{"p":"com.jgalgo.alg.span","c":"SteinerTreeAlgo.Result","l":"edges()"},{"p":"com.jgalgo.graph","c":"Graph","l":"edges()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"edges()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"edges()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"edges()"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"edges()"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"edges(IdBuilder)","url":"edges(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"ComplementGraphGenerator","l":"edges(IdBuilder)","url":"edges(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"edges(IdBuilder)","url":"edges(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"CompleteGraphGenerator","l":"edges(IdBuilder)","url":"edges(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"edges(IdBuilder)","url":"edges(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"edges(IdBuilder)","url":"edges(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"LineGraphGenerator","l":"edges(IdBuilder)","url":"edges(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"UniformTreeGenerator","l":"edges(IdBuilder)","url":"edges(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"edges(int, IdBuilder)","url":"edges(int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"edges(int, IdBuilder)","url":"edges(int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"edges(int, IdBuilder)","url":"edges(int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"edges(int)"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"edges(int)"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"edges(int)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"edgesConnecting(V, V)","url":"edgesConnecting(V,V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"edgeSet()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"edgesOf(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"edgeSource(E)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"edgeSource(E)"},{"p":"com.jgalgo.graph","c":"Graph","l":"edgeSource(E)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"edgeSource(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"edgeSource(Integer)","url":"edgeSource(java.lang.Integer)"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"edgesPerStep(int)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder.ReIndexedGraph","l":"edgesReIndexing"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"edgesWeights(String)","url":"edgesWeights(java.lang.String)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"edgesWeights(String)","url":"edgesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"Graph","l":"edgesWeights(String)","url":"edgesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"edgesWeights(String)","url":"edgesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"edgesWeights(String)","url":"edgesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"edgesWeights(String)","url":"edgesWeights(java.lang.String)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"edgesWeightsKeys()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"edgesWeightsKeys()"},{"p":"com.jgalgo.graph","c":"Graph","l":"edgesWeightsKeys()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"edgesWeightsKeys()"},{"p":"com.jgalgo.gen","c":"UnionGraphGenerator","l":"edgesWeightsKeys(Set)","url":"edgesWeightsKeys(java.util.Set)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"edgeTarget(E)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"edgeTarget(E)"},{"p":"com.jgalgo.graph","c":"Graph","l":"edgeTarget(E)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"edgeTarget(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"edgeTarget(Integer)","url":"edgeTarget(java.lang.Integer)"},{"p":"com.jgalgo.gen","c":"UnionGraphGenerator","l":"edgeUnionByEndpoints()"},{"p":"com.jgalgo.gen","c":"UnionGraphGenerator","l":"edgeUnionById()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"edgeValueOrDefault(EndpointPair, ValueT)","url":"edgeValueOrDefault(com.google.common.graph.EndpointPair,ValueT)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"edgeValueOrDefault(V, V, ValueT)","url":"edgeValueOrDefault(V,V,ValueT)"},{"p":"com.jgalgo.gen","c":"EmptyGraphGenerator","l":"emptyGraph(Collection)","url":"emptyGraph(java.util.Collection)"},{"p":"com.jgalgo.gen","c":"EmptyGraphGenerator","l":"EmptyGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"EmptyGraphGenerator","l":"EmptyGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"ensureEdgeCapacity(int)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"ensureEdgeCapacity(int)"},{"p":"com.jgalgo.graph","c":"Graph","l":"ensureEdgeCapacity(int)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"ensureEdgeCapacity(int)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"ensureVertexCapacity(int)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"ensureVertexCapacity(int)"},{"p":"com.jgalgo.graph","c":"Graph","l":"ensureVertexCapacity(int)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"ensureVertexCapacity(int)"},{"p":"com.jgalgo.alg.path","c":"Path","l":"equals(Object)","url":"equals(java.lang.Object)"},{"p":"com.jgalgo.graph","c":"AbstractGraph","l":"equals(Object)","url":"equals(java.lang.Object)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"expectedEdgesNum(int)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"expectedEdgesNum(int)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"expectedEdgesNum(int)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"expectedVerticesNum(int)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"expectedVerticesNum(int)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"expectedVerticesNum(int)"},{"p":"com.jgalgo.graph","c":"GraphFactory.Hint","l":"FastEdgeLookup"},{"p":"com.jgalgo.graph","c":"GraphFactory.Hint","l":"FastEdgeRemoval"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo","l":"findBiConnectedComponents(Graph)","url":"findBiConnectedComponents(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgoAbstract","l":"findBiConnectedComponents(Graph)","url":"findBiConnectedComponents(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.connect","c":"KVertexConnectedComponentsAlgo","l":"findKVertexConnectedComponents(Graph, int)","url":"findKVertexConnectedComponents(com.jgalgo.graph.Graph,int)"},{"p":"com.jgalgo.alg.connect","c":"KVertexConnectedComponentsAlgoAbstract","l":"findKVertexConnectedComponents(Graph, int)","url":"findKVertexConnectedComponents(com.jgalgo.graph.Graph,int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorStatic.IDataStructure","l":"findLca(int, int)","url":"findLca(int,int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorStatic.IDataStructure","l":"findLca(Integer, Integer)","url":"findLca(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorStatic.DataStructure","l":"findLca(V, V)","url":"findLca(V,V)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline","l":"findLCAs(Graph, V, LowestCommonAncestorOffline.Queries)","url":"findLCAs(com.jgalgo.graph.Graph,V,com.jgalgo.alg.tree.LowestCommonAncestorOffline.Queries)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorDynamic","l":"findLowestCommonAncestor(LowestCommonAncestorDynamic.Vertex, LowestCommonAncestorDynamic.Vertex)","url":"findLowestCommonAncestor(com.jgalgo.alg.tree.LowestCommonAncestorDynamic.Vertex,com.jgalgo.alg.tree.LowestCommonAncestorDynamic.Vertex)"},{"p":"com.jgalgo.alg.bipartite","c":"BipartiteGraphs","l":"findPartition(Graph, boolean)","url":"findPartition(com.jgalgo.graph.Graph,boolean)"},{"p":"com.jgalgo.alg.bipartite","c":"BipartiteGraphs","l":"findPartition(Graph)","url":"findPartition(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.path","c":"Path","l":"findPath(Graph, V, V)","url":"findPath(com.jgalgo.graph.Graph,V,V)"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"findPath(IntGraph, int, int)","url":"findPath(com.jgalgo.graph.IntGraph,int,int)"},{"p":"com.jgalgo.alg.connect","c":"StronglyConnectedComponentsAlgo","l":"findStronglyConnectedComponents(Graph)","url":"findStronglyConnectedComponents(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.connect","c":"StronglyConnectedComponentsAlgoAbstract","l":"findStronglyConnectedComponents(Graph)","url":"findStronglyConnectedComponents(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.connect","c":"WeaklyConnectedComponentsAlgo","l":"findWeaklyConnectedComponents(Graph)","url":"findWeaklyConnectedComponents(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.connect","c":"WeaklyConnectedComponentsAlgoAbstract","l":"findWeaklyConnectedComponents(Graph)","url":"findWeaklyConnectedComponents(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"fromArray(IndexGraph, int[], int)","url":"fromArray(com.jgalgo.graph.IndexGraph,int[],int)"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"fromBitmap(IndexGraph, Bitmap)","url":"fromBitmap(com.jgalgo.graph.IndexGraph,com.jgalgo.internal.util.Bitmap)"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"fromMap(Graph, Map)","url":"fromMap(com.jgalgo.graph.Graph,java.util.Map)"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"fromMap(Graph, Object2IntMap)","url":"fromMap(com.jgalgo.graph.Graph,it.unimi.dsi.fastutil.objects.Object2IntMap)"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"fromMap(IntGraph, Int2IntMap)","url":"fromMap(com.jgalgo.graph.IntGraph,it.unimi.dsi.fastutil.ints.Int2IntMap)"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"fromMap(IntGraph, Map)","url":"fromMap(com.jgalgo.graph.IntGraph,java.util.Map)"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"fromMapping(Graph, Predicate)","url":"fromMapping(com.jgalgo.graph.Graph,java.util.function.Predicate)"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"fromMapping(Graph, ToIntFunction)","url":"fromMapping(com.jgalgo.graph.Graph,java.util.function.ToIntFunction)"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"fromMapping(IntGraph, IntPredicate)","url":"fromMapping(com.jgalgo.graph.IntGraph,java.util.function.IntPredicate)"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"fromMapping(IntGraph, IntUnaryOperator)","url":"fromMapping(com.jgalgo.graph.IntGraph,java.util.function.IntUnaryOperator)"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"fromWeights(Graph, WeightsBool)","url":"fromWeights(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightsBool)"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"fromWeights(IntGraph, IWeightsBool)","url":"fromWeights(com.jgalgo.graph.IntGraph,com.jgalgo.graph.IWeightsBool)"},{"p":"com.jgalgo.gen","c":"GraphGenerator","l":"generate()"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"ComplementGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"CompleteGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"DifferenceGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"EmptyGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"GraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"IntersectionGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"LineGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"SymmetricDifferenceGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"UniformTreeGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"UnionGraphGenerator","l":"generateIntoBuilder()"},{"p":"com.jgalgo.gen","c":"GraphGenerator","l":"generateMutable()"},{"p":"com.jgalgo.graph","c":"IWeightsBool","l":"get(int)"},{"p":"com.jgalgo.graph","c":"IWeightsByte","l":"get(int)"},{"p":"com.jgalgo.graph","c":"IWeightsChar","l":"get(int)"},{"p":"com.jgalgo.graph","c":"IWeightsDouble","l":"get(int)"},{"p":"com.jgalgo.graph","c":"IWeightsFloat","l":"get(int)"},{"p":"com.jgalgo.graph","c":"IWeightsInt","l":"get(int)"},{"p":"com.jgalgo.graph","c":"IWeightsLong","l":"get(int)"},{"p":"com.jgalgo.graph","c":"IWeightsObj","l":"get(int)"},{"p":"com.jgalgo.graph","c":"IWeightsShort","l":"get(int)"},{"p":"com.jgalgo.graph","c":"IWeightsBool","l":"get(Integer)","url":"get(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsByte","l":"get(Integer)","url":"get(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsChar","l":"get(Integer)","url":"get(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsDouble","l":"get(Integer)","url":"get(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsFloat","l":"get(Integer)","url":"get(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsInt","l":"get(Integer)","url":"get(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsLong","l":"get(Integer)","url":"get(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsObj","l":"get(Integer)","url":"get(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsShort","l":"get(Integer)","url":"get(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"WeightsBool","l":"get(K)"},{"p":"com.jgalgo.graph","c":"WeightsByte","l":"get(K)"},{"p":"com.jgalgo.graph","c":"WeightsChar","l":"get(K)"},{"p":"com.jgalgo.graph","c":"WeightsDouble","l":"get(K)"},{"p":"com.jgalgo.graph","c":"WeightsFloat","l":"get(K)"},{"p":"com.jgalgo.graph","c":"WeightsInt","l":"get(K)"},{"p":"com.jgalgo.graph","c":"WeightsLong","l":"get(K)"},{"p":"com.jgalgo.graph","c":"WeightsObj","l":"get(K)"},{"p":"com.jgalgo.graph","c":"WeightsShort","l":"get(K)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"getAllEdges(V, V)","url":"getAllEdges(V,V)"},{"p":"com.jgalgo.graph","c":"IWeights","l":"getAsObj(int)"},{"p":"com.jgalgo.graph","c":"IWeightsBool","l":"getAsObj(int)"},{"p":"com.jgalgo.graph","c":"IWeightsByte","l":"getAsObj(int)"},{"p":"com.jgalgo.graph","c":"IWeightsChar","l":"getAsObj(int)"},{"p":"com.jgalgo.graph","c":"IWeightsDouble","l":"getAsObj(int)"},{"p":"com.jgalgo.graph","c":"IWeightsFloat","l":"getAsObj(int)"},{"p":"com.jgalgo.graph","c":"IWeightsInt","l":"getAsObj(int)"},{"p":"com.jgalgo.graph","c":"IWeightsLong","l":"getAsObj(int)"},{"p":"com.jgalgo.graph","c":"IWeightsObj","l":"getAsObj(int)"},{"p":"com.jgalgo.graph","c":"IWeightsShort","l":"getAsObj(int)"},{"p":"com.jgalgo.graph","c":"IWeights","l":"getAsObj(Integer)","url":"getAsObj(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsBool","l":"getAsObj(Integer)","url":"getAsObj(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsByte","l":"getAsObj(Integer)","url":"getAsObj(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsChar","l":"getAsObj(Integer)","url":"getAsObj(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsDouble","l":"getAsObj(Integer)","url":"getAsObj(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsFloat","l":"getAsObj(Integer)","url":"getAsObj(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsInt","l":"getAsObj(Integer)","url":"getAsObj(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsLong","l":"getAsObj(Integer)","url":"getAsObj(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsObj","l":"getAsObj(Integer)","url":"getAsObj(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsShort","l":"getAsObj(Integer)","url":"getAsObj(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"Weights","l":"getAsObj(K)"},{"p":"com.jgalgo.graph","c":"WeightsBool","l":"getAsObj(K)"},{"p":"com.jgalgo.graph","c":"WeightsByte","l":"getAsObj(K)"},{"p":"com.jgalgo.graph","c":"WeightsChar","l":"getAsObj(K)"},{"p":"com.jgalgo.graph","c":"WeightsDouble","l":"getAsObj(K)"},{"p":"com.jgalgo.graph","c":"WeightsFloat","l":"getAsObj(K)"},{"p":"com.jgalgo.graph","c":"WeightsInt","l":"getAsObj(K)"},{"p":"com.jgalgo.graph","c":"WeightsLong","l":"getAsObj(K)"},{"p":"com.jgalgo.graph","c":"WeightsObj","l":"getAsObj(K)"},{"p":"com.jgalgo.graph","c":"WeightsShort","l":"getAsObj(K)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.IResult","l":"getBiCcEdges(int)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.Result","l":"getBiCcEdges(int)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.IResult","l":"getBiCcVertices(int)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.Result","l":"getBiCcVertices(int)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.Result","l":"getBlockGraph()"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.IResult","l":"getCutVertices()"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.Result","l":"getCutVertices()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorDynamic.Vertex","l":"getData()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"getEdge(int, int)","url":"getEdge(int,int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"getEdge(Integer, Integer)","url":"getEdge(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"getEdge(V, V)","url":"getEdge(V,V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"getEdge(V, V)","url":"getEdge(V,V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"getEdge(V, V)","url":"getEdge(V,V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"getEdge(V, V)","url":"getEdge(V,V)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"getEdges(int, int)","url":"getEdges(int,int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"getEdges(Integer, Integer)","url":"getEdges(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"getEdges(V, V)","url":"getEdges(V,V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"getEdges(V, V)","url":"getEdges(V,V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"getEdges(V, V)","url":"getEdges(V,V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"getEdgeSource(E)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"getEdgeSupplier()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"getEdgeTarget(E)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"getEdgeWeight(E)"},{"p":"com.jgalgo.alg.bipartite","c":"BipartiteGraphs","l":"getExistingPartition(Graph)","url":"getExistingPartition(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.bipartite","c":"BipartiteGraphs","l":"getExistingPartition(IntGraph)","url":"getExistingPartition(com.jgalgo.graph.IntGraph)"},{"p":"com.jgalgo.alg.flow","c":"Flow","l":"getFlow(E)"},{"p":"com.jgalgo.alg.flow","c":"IFlow","l":"getFlow(int)"},{"p":"com.jgalgo.alg.flow","c":"IFlow","l":"getFlow(Integer)","url":"getFlow(java.lang.Integer)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.IResult","l":"getHeaviestEdge(int)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.Result","l":"getHeaviestEdge(int)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.IResult","l":"getHeaviestEdgeInt(int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.IResult","l":"getLca(int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.Result","l":"getLca(int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.IResult","l":"getLcaInt(int)"},{"p":"com.jgalgo.alg.match","c":"IMatching","l":"getMatchedEdge(int)"},{"p":"com.jgalgo.alg.match","c":"IMatching","l":"getMatchedEdge(Integer)","url":"getMatchedEdge(java.lang.Integer)"},{"p":"com.jgalgo.alg.match","c":"Matching","l":"getMatchedEdge(V)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.Result","l":"getNumberOfBiCcs()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorDynamic.Vertex","l":"getParent()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs.IResult","l":"getPath(int, int)","url":"getPath(int,int)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.IResult","l":"getPath(int)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.IResult","l":"getPath(int)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs.IResult","l":"getPath(Integer, Integer)","url":"getPath(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.IResult","l":"getPath(Integer)","url":"getPath(java.lang.Integer)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.IResult","l":"getPath(Integer)","url":"getPath(java.lang.Integer)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs.Result","l":"getPath(V, V)","url":"getPath(V,V)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Result","l":"getPath(V)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.Result","l":"getPath(V)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.IQueries","l":"getQuerySource(int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.Queries","l":"getQuerySource(int)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.IQueries","l":"getQuerySource(int)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.Queries","l":"getQuerySource(int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.IQueries","l":"getQuerySourceInt(int)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.IQueries","l":"getQuerySourceInt(int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.IQueries","l":"getQueryTarget(int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.Queries","l":"getQueryTarget(int)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.IQueries","l":"getQueryTarget(int)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.Queries","l":"getQueryTarget(int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.IQueries","l":"getQueryTargetInt(int)"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.IQueries","l":"getQueryTargetInt(int)"},{"p":"com.jgalgo.alg.flow","c":"IFlow","l":"getSupply(int)"},{"p":"com.jgalgo.alg.flow","c":"IFlow","l":"getSupply(Integer)","url":"getSupply(java.lang.Integer)"},{"p":"com.jgalgo.alg.flow","c":"Flow","l":"getSupply(V)"},{"p":"com.jgalgo.alg.flow","c":"Flow","l":"getSupplySubset(Collection)","url":"getSupplySubset(java.util.Collection)"},{"p":"com.jgalgo.alg.flow","c":"Flow","l":"getTotalCost(WeightFunction)","url":"getTotalCost(com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"getType()"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.IResult","l":"getVertexBiCcs(int)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.IResult","l":"getVertexBiCcs(Integer)","url":"getVertexBiCcs(java.lang.Integer)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.Result","l":"getVertexBiCcs(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"getVertexSupplier()"},{"p":"com.jgalgo.io","c":"GexfGraphReader","l":"GexfGraphReader()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.io","c":"GexfGraphReader","l":"GexfGraphReader(Class, Class)","url":"%3Cinit%3E(java.lang.Class,java.lang.Class)"},{"p":"com.jgalgo.io","c":"GexfGraphWriter","l":"GexfGraphWriter()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.io","c":"GmlGraphReader","l":"GmlGraphReader()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.io","c":"GmlGraphReader","l":"GmlGraphReader(Class, Class)","url":"%3Cinit%3E(java.lang.Class,java.lang.Class)"},{"p":"com.jgalgo.io","c":"GmlGraphWriter","l":"GmlGraphWriter()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"GnmBipartiteGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"GnmBipartiteGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"GnmGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"GnmGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"GnpBipartiteGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"GnpBipartiteGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"GnpGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"GnpGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder.ReIndexedGraph","l":"graph"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"graph()"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"graph()"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"graph()"},{"p":"com.jgalgo.alg.path","c":"Path","l":"graph()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.IResult","l":"graph()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Result","l":"graph()"},{"p":"com.jgalgo.gen","c":"LineGraphGenerator","l":"graph(Graph)","url":"graph(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.gen","c":"ComplementGraphGenerator","l":"graph(Graph)","url":"graph(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.io","c":"Graph6GraphReader","l":"Graph6GraphReader()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.io","c":"Graph6GraphWriter","l":"Graph6GraphWriter()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"ComplementGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"CompleteGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"DifferenceGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"EmptyGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"IntersectionGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"LineGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"SymmetricDifferenceGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"UniformTreeGenerator","l":"graphFactory()"},{"p":"com.jgalgo.gen","c":"UnionGraphGenerator","l":"graphFactory()"},{"p":"com.jgalgo.io","c":"GraphMlGraphReader","l":"GraphMlGraphReader()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.io","c":"GraphMlGraphReader","l":"GraphMlGraphReader(Class, Class)","url":"%3Cinit%3E(java.lang.Class,java.lang.Class)"},{"p":"com.jgalgo.io","c":"GraphMlGraphWriter","l":"GraphMlGraphWriter()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"IntersectionGraphGenerator","l":"graphs(Collection>)","url":"graphs(java.util.Collection)"},{"p":"com.jgalgo.gen","c":"UnionGraphGenerator","l":"graphs(Collection>)","url":"graphs(java.util.Collection)"},{"p":"com.jgalgo.gen","c":"DifferenceGraphGenerator","l":"graphs(Graph, Graph)","url":"graphs(com.jgalgo.graph.Graph,com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.gen","c":"SymmetricDifferenceGraphGenerator","l":"graphs(Graph, Graph)","url":"graphs(com.jgalgo.graph.Graph,com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.gen","c":"IntersectionGraphGenerator","l":"graphs(Graph...)","url":"graphs(com.jgalgo.graph.Graph...)"},{"p":"com.jgalgo.gen","c":"UnionGraphGenerator","l":"graphs(Graph...)","url":"graphs(com.jgalgo.graph.Graph...)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"GuavaGraphAdapter(Graph)","url":"%3Cinit%3E(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableGraphAdapter","l":"GuavaMutableGraphAdapter(Graph)","url":"%3Cinit%3E(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableNetworkAdapter","l":"GuavaMutableNetworkAdapter(Graph)","url":"%3Cinit%3E(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableValueGraphAdapter","l":"GuavaMutableValueGraphAdapter(Graph, String)","url":"%3Cinit%3E(com.jgalgo.graph.Graph,java.lang.String)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"GuavaNetworkAdapter(Graph)","url":"%3Cinit%3E(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"GuavaNetworkWrapper(Network, boolean)","url":"%3Cinit%3E(com.google.common.graph.Network,boolean)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"GuavaNetworkWrapper(Network)","url":"%3Cinit%3E(com.google.common.graph.Network)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"GuavaValueGraphAdapter(Graph, String)","url":"%3Cinit%3E(com.jgalgo.graph.Graph,java.lang.String)"},{"p":"com.jgalgo.alg.hamilton","c":"HamiltonianPathAlgo","l":"hamiltonianCycle(Graph)","url":"hamiltonianCycle(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.hamilton","c":"HamiltonianPathAlgo","l":"hamiltonianCyclesIter(Graph)","url":"hamiltonianCyclesIter(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.hamilton","c":"HamiltonianPathAlgo","l":"hamiltonianPath(Graph, V, V)","url":"hamiltonianPath(com.jgalgo.graph.Graph,V,V)"},{"p":"com.jgalgo.alg.hamilton","c":"HamiltonianPathAlgo","l":"hamiltonianPath(Graph)","url":"hamiltonianPath(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.hamilton","c":"HamiltonianPathAlgo","l":"hamiltonianPathsIter(Graph, V, V)","url":"hamiltonianPathsIter(com.jgalgo.graph.Graph,V,V)"},{"p":"com.jgalgo.alg.hamilton","c":"HamiltonianPathAlgo","l":"hamiltonianPathsIter(Graph)","url":"hamiltonianPathsIter(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"hasEdgeConnecting(EndpointPair)","url":"hasEdgeConnecting(com.google.common.graph.EndpointPair)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"hasEdgeConnecting(EndpointPair)","url":"hasEdgeConnecting(com.google.common.graph.EndpointPair)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"hasEdgeConnecting(EndpointPair)","url":"hasEdgeConnecting(com.google.common.graph.EndpointPair)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"hasEdgeConnecting(V, V)","url":"hasEdgeConnecting(V,V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"hasEdgeConnecting(V, V)","url":"hasEdgeConnecting(V,V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"hasEdgeConnecting(V, V)","url":"hasEdgeConnecting(V,V)"},{"p":"com.jgalgo.graph","c":"AbstractGraph","l":"hashCode()"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter","l":"hasNext()"},{"p":"com.jgalgo.alg.traversal","c":"DfsIter","l":"hasNext()"},{"p":"com.jgalgo.alg.traversal","c":"RandomWalkIter","l":"hasNext()"},{"p":"com.jgalgo.graph","c":"IndexIntIdMap","l":"identityEdgesMap(IntSet)","url":"identityEdgesMap(it.unimi.dsi.fastutil.ints.IntSet)"},{"p":"com.jgalgo.graph","c":"IndexIntIdMap","l":"identityVerticesMap(IntSet)","url":"identityVerticesMap(it.unimi.dsi.fastutil.ints.IntSet)"},{"p":"com.jgalgo.graph","c":"IndexIntIdMap","l":"idToIndex(int)"},{"p":"com.jgalgo.graph","c":"IndexIntIdMap","l":"idToIndex(Integer)","url":"idToIndex(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IndexIdMap","l":"idToIndex(K)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"idToIndexCollection(Collection, IndexIdMap)","url":"idToIndexCollection(java.util.Collection,com.jgalgo.graph.IndexIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIntIdMap","l":"idToIndexIfExist(int)"},{"p":"com.jgalgo.graph","c":"IndexIntIdMap","l":"idToIndexIfExist(Integer)","url":"idToIndexIfExist(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IndexIdMap","l":"idToIndexIfExist(K)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"idToIndexIterator(Iterator, IndexIdMap)","url":"idToIndexIterator(java.util.Iterator,com.jgalgo.graph.IndexIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"idToIndexList(List, IndexIdMap)","url":"idToIndexList(java.util.List,com.jgalgo.graph.IndexIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"idToIndexSet(Set, IndexIdMap)","url":"idToIndexSet(java.util.Set,com.jgalgo.graph.IndexIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"idToIndexWeightFunc(WeightFunction, IndexIdMap)","url":"idToIndexWeightFunc(com.jgalgo.graph.WeightFunction,com.jgalgo.graph.IndexIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"idToIndexWeightFunc(WeightFunctionInt, IndexIdMap)","url":"idToIndexWeightFunc(com.jgalgo.graph.WeightFunctionInt,com.jgalgo.graph.IndexIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"idToIndexWeights(Weights, IndexIdMap)","url":"idToIndexWeights(com.jgalgo.graph.Weights,com.jgalgo.graph.IndexIdMap)"},{"p":"com.jgalgo.graph","c":"Graph","l":"immutableCopy()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"immutableCopy()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"immutableCopy()"},{"p":"com.jgalgo.graph","c":"Graph","l":"immutableCopy(boolean, boolean)","url":"immutableCopy(boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"immutableCopy(boolean, boolean)","url":"immutableCopy(boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"immutableCopy(boolean, boolean)","url":"immutableCopy(boolean,boolean)"},{"p":"com.jgalgo.graph","c":"Graph","l":"immutableView()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"immutableView()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"immutableView()"},{"p":"com.jgalgo.alg","c":"EdgeDirection","l":"In"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"incidentEdgeOrder()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"incidentEdgeOrder()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"incidentEdges(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"incidentEdges(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"incidentEdges(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"incidentNodes(E)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"incomingEdgesOf(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"inDegree(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"inDegree(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"inDegreeOf(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"indexGraph()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"indexGraph()"},{"p":"com.jgalgo.graph","c":"Graph","l":"indexGraph()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"indexGraph()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"indexGraphEdgesMap()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"indexGraphEdgesMap()"},{"p":"com.jgalgo.graph","c":"Graph","l":"indexGraphEdgesMap()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"indexGraphEdgesMap()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"indexGraphEdgesMap()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"indexGraphVerticesMap()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"indexGraphVerticesMap()"},{"p":"com.jgalgo.graph","c":"Graph","l":"indexGraphVerticesMap()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"indexGraphVerticesMap()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"indexGraphVerticesMap()"},{"p":"com.jgalgo.graph","c":"IndexIdMap","l":"indexToId(int)"},{"p":"com.jgalgo.graph","c":"IndexIntIdMap","l":"indexToId(int)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdCollection(IntCollection, IndexIdMap)","url":"indexToIdCollection(it.unimi.dsi.fastutil.ints.IntCollection,com.jgalgo.graph.IndexIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdCollection(IntCollection, IndexIntIdMap)","url":"indexToIdCollection(it.unimi.dsi.fastutil.ints.IntCollection,com.jgalgo.graph.IndexIntIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdEdgeIter(Graph, IEdgeIter)","url":"indexToIdEdgeIter(com.jgalgo.graph.Graph,com.jgalgo.graph.IEdgeIter)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdEdgeIter(IntGraph, IEdgeIter)","url":"indexToIdEdgeIter(com.jgalgo.graph.IntGraph,com.jgalgo.graph.IEdgeIter)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdEdgeSet(IEdgeSet, Graph)","url":"indexToIdEdgeSet(com.jgalgo.graph.IEdgeSet,com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdEdgeSet(IEdgeSet, IntGraph)","url":"indexToIdEdgeSet(com.jgalgo.graph.IEdgeSet,com.jgalgo.graph.IntGraph)"},{"p":"com.jgalgo.graph","c":"IndexIdMap","l":"indexToIdIfExist(int)"},{"p":"com.jgalgo.graph","c":"IndexIntIdMap","l":"indexToIdIfExist(int)"},{"p":"com.jgalgo.graph","c":"IndexIntIdMap","l":"indexToIdIfExistInt(int)"},{"p":"com.jgalgo.graph","c":"IndexIntIdMap","l":"indexToIdInt(int)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdIterator(IntIterator, IndexIdMap)","url":"indexToIdIterator(it.unimi.dsi.fastutil.ints.IntIterator,com.jgalgo.graph.IndexIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdIterator(IntIterator, IndexIntIdMap)","url":"indexToIdIterator(it.unimi.dsi.fastutil.ints.IntIterator,com.jgalgo.graph.IndexIntIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdList(IntList, IndexIdMap)","url":"indexToIdList(it.unimi.dsi.fastutil.ints.IntList,com.jgalgo.graph.IndexIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdList(IntList, IndexIntIdMap)","url":"indexToIdList(it.unimi.dsi.fastutil.ints.IntList,com.jgalgo.graph.IndexIntIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdSet(IntSet, IndexIdMap)","url":"indexToIdSet(it.unimi.dsi.fastutil.ints.IntSet,com.jgalgo.graph.IndexIdMap)"},{"p":"com.jgalgo.graph","c":"IndexIdMaps","l":"indexToIdSet(IntSet, IndexIntIdMap)","url":"indexToIdSet(it.unimi.dsi.fastutil.ints.IntSet,com.jgalgo.graph.IndexIntIdMap)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"inEdges(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"inEdges(Integer)","url":"inEdges(java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"inEdges(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"inEdges(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"inEdges(V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"inEdges(V)"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"initialCliqueSize(int)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorDynamic","l":"initTree()"},{"p":"com.jgalgo.alg.flow","c":"MinimumCostFlow.Builder","l":"integerCosts(boolean)"},{"p":"com.jgalgo.alg.flow","c":"MinimumCostFlow.Builder","l":"integerNetwork(boolean)"},{"p":"com.jgalgo.gen","c":"IntersectionGraphGenerator","l":"IntersectionGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"IntersectionGraphGenerator","l":"IntersectionGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.graph","c":"IEdgeSet","l":"intIterator()"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismIMapping","l":"inverse()"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismMapping","l":"inverse()"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder.ReIndexingMap","l":"inverse()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"isAllowParallelEdges()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"isAllowParallelEdges()"},{"p":"com.jgalgo.graph","c":"Graph","l":"isAllowParallelEdges()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"isAllowSelfEdges()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"isAllowSelfEdges()"},{"p":"com.jgalgo.graph","c":"Graph","l":"isAllowSelfEdges()"},{"p":"com.jgalgo.alg.bipartite","c":"BipartiteGraphs","l":"isBipartite(Graph)","url":"isBipartite(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"WeightFunction","l":"isCardinality(WeightFunction)","url":"isCardinality(com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.closure","c":"ClosuresEnumerator","l":"isClosure(Graph, Set)","url":"isClosure(com.jgalgo.graph.Graph,java.util.Set)"},{"p":"com.jgalgo.alg.color","c":"ColoringAlgo","l":"isColoring(Graph, ToIntFunction)","url":"isColoring(com.jgalgo.graph.Graph,java.util.function.ToIntFunction)"},{"p":"com.jgalgo.alg.cover","c":"EdgeCover","l":"isCover(Graph, Collection)","url":"isCover(com.jgalgo.graph.Graph,java.util.Collection)"},{"p":"com.jgalgo.alg.cover","c":"VertexCover","l":"isCover(Graph, Collection)","url":"isCover(com.jgalgo.graph.Graph,java.util.Collection)"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutGlobal","l":"isCut(Graph, Collection)","url":"isCut(com.jgalgo.graph.Graph,java.util.Collection)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.IResult","l":"isCutVertex(int)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.IResult","l":"isCutVertex(Integer)","url":"isCutVertex(java.lang.Integer)"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo.Result","l":"isCutVertex(V)"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"isCycle()"},{"p":"com.jgalgo.alg.path","c":"Path","l":"isCycle()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"isDirected()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"isDirected()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"isDirected()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"isDirected()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"isDirected()"},{"p":"com.jgalgo.graph","c":"Graph","l":"isDirected()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"isDirected()"},{"p":"com.jgalgo.alg.cover","c":"DominatingSetAlgo","l":"isDominatingSet(Graph, Collection, EdgeDirection)","url":"isDominatingSet(com.jgalgo.graph.Graph,java.util.Collection,com.jgalgo.alg.EdgeDirection)"},{"p":"com.jgalgo.alg.euler","c":"EulerianTourAlgo","l":"isEulerian(Graph)","url":"isEulerian(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.euler","c":"EulerianTourAlgo","l":"isEulerianTour(Graph, List)","url":"isEulerianTour(com.jgalgo.graph.Graph,java.util.List)"},{"p":"com.jgalgo.alg.tree","c":"Trees","l":"isForest(Graph)","url":"isForest(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.hamilton","c":"HamiltonianPathAlgo","l":"isHamiltonianPath(Graph, List)","url":"isHamiltonianPath(com.jgalgo.graph.Graph,java.util.List)"},{"p":"com.jgalgo.graph","c":"WeightFunction","l":"isInteger(WeightFunction)","url":"isInteger(com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"isLeft(int)"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"isLeft(Integer)","url":"isLeft(java.lang.Integer)"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"isLeft(V)"},{"p":"com.jgalgo.alg.match","c":"Matching","l":"isMatching(Graph, Collection)","url":"isMatching(com.jgalgo.graph.Graph,java.util.Collection)"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismTester","l":"isomorphicMapping(Graph, Graph, boolean)","url":"isomorphicMapping(com.jgalgo.graph.Graph,com.jgalgo.graph.Graph,boolean)"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismTester","l":"isomorphicMapping(Graph, Graph)","url":"isomorphicMapping(com.jgalgo.graph.Graph,com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismTester","l":"isomorphicMappingsIter(Graph, Graph, boolean, BiPredicate, BiPredicate)","url":"isomorphicMappingsIter(com.jgalgo.graph.Graph,com.jgalgo.graph.Graph,boolean,java.util.function.BiPredicate,java.util.function.BiPredicate)"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismTester","l":"isomorphicMappingsIter(Graph, Graph, boolean)","url":"isomorphicMappingsIter(com.jgalgo.graph.Graph,com.jgalgo.graph.Graph,boolean)"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismTester","l":"isomorphicMappingsIter(Graph, Graph)","url":"isomorphicMappingsIter(com.jgalgo.graph.Graph,com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"isPartition(Graph, Predicate)","url":"isPartition(com.jgalgo.graph.Graph,java.util.function.Predicate)"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"isPartition(Graph, ToIntFunction)","url":"isPartition(com.jgalgo.graph.Graph,java.util.function.ToIntFunction)"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"isPartition(IntGraph, IntPredicate)","url":"isPartition(com.jgalgo.graph.IntGraph,java.util.function.IntPredicate)"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"isPartition(IntGraph, IntUnaryOperator)","url":"isPartition(com.jgalgo.graph.IntGraph,java.util.function.IntUnaryOperator)"},{"p":"com.jgalgo.alg.path","c":"Path","l":"isPath(Graph, V, V, List)","url":"isPath(com.jgalgo.graph.Graph,V,V,java.util.List)"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"isPath(IntGraph, int, int, IntList)","url":"isPath(com.jgalgo.graph.IntGraph,int,int,it.unimi.dsi.fastutil.ints.IntList)"},{"p":"com.jgalgo.alg.match","c":"Matching","l":"isPerfect()"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"isRight(int)"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"isRight(Integer)","url":"isRight(java.lang.Integer)"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"isRight(V)"},{"p":"com.jgalgo.alg.path","c":"Path","l":"isSimple()"},{"p":"com.jgalgo.alg.span","c":"MinimumSpanningTree","l":"isSpanningForest(Graph, Collection)","url":"isSpanningForest(com.jgalgo.graph.Graph,java.util.Collection)"},{"p":"com.jgalgo.alg.span","c":"MinimumSpanningTree","l":"isSpanningTree(Graph, Collection)","url":"isSpanningTree(com.jgalgo.graph.Graph,java.util.Collection)"},{"p":"com.jgalgo.alg.span","c":"SteinerTreeAlgo","l":"isSteinerTree(Graph, Collection, Collection)","url":"isSteinerTree(com.jgalgo.graph.Graph,java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.alg.connect","c":"StronglyConnectedComponentsAlgo","l":"isStronglyConnected(Graph)","url":"isStronglyConnected(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.connect","c":"StronglyConnectedComponentsAlgoAbstract","l":"isStronglyConnected(Graph)","url":"isStronglyConnected(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.tree","c":"Trees","l":"isTree(Graph, V)","url":"isTree(com.jgalgo.graph.Graph,V)"},{"p":"com.jgalgo.alg.tree","c":"Trees","l":"isTree(Graph)","url":"isTree(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.match","c":"IMatching","l":"isVertexMatched(int)"},{"p":"com.jgalgo.alg.match","c":"IMatching","l":"isVertexMatched(Integer)","url":"isVertexMatched(java.lang.Integer)"},{"p":"com.jgalgo.alg.match","c":"Matching","l":"isVertexMatched(V)"},{"p":"com.jgalgo.alg.connect","c":"WeaklyConnectedComponentsAlgo","l":"isWeaklyConnected(Graph)","url":"isWeaklyConnected(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.connect","c":"WeaklyConnectedComponentsAlgoAbstract","l":"isWeaklyConnected(Graph)","url":"isWeaklyConnected(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"EdgeSet","l":"iterator()"},{"p":"com.jgalgo.graph","c":"IEdgeSet","l":"iterator()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"JGraphTAdapter(Graph, String)","url":"%3Cinit%3E(com.jgalgo.graph.Graph,java.lang.String)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"JGraphTAdapter(Graph)","url":"%3Cinit%3E(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"JGraphTWrapper(Graph, String)","url":"%3Cinit%3E(org.jgrapht.Graph,java.lang.String)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"JGraphTWrapper(Graph)","url":"%3Cinit%3E(org.jgrapht.Graph)"},{"p":"com.jgalgo.alg.connect","c":"KEdgeConnectedComponentsAlgoAbstract","l":"KEdgeConnectedComponentsAlgoAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"KEdgeConnectedComponentsWang","l":"KEdgeConnectedComponentsWang()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.io","c":"Digraph6GraphWriter","l":"keepEdgesIds(boolean)"},{"p":"com.jgalgo.io","c":"Graph6GraphWriter","l":"keepEdgesIds(boolean)"},{"p":"com.jgalgo.io","c":"Sparse6GraphWriter","l":"keepEdgesIds(boolean)"},{"p":"com.jgalgo.alg.connect","c":"KVertexConnectedComponentsAlgoAbstract","l":"KVertexConnectedComponentsAlgoAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"KVertexConnectedComponentsWhiteMoody","l":"KVertexConnectedComponentsWhiteMoody()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter","l":"lastEdge()"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter.Int","l":"lastEdge()"},{"p":"com.jgalgo.alg.traversal","c":"RandomWalkIter","l":"lastEdge()"},{"p":"com.jgalgo.alg.traversal","c":"RandomWalkIter.Int","l":"lastEdge()"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter.Int","l":"lastEdgeInt()"},{"p":"com.jgalgo.alg.traversal","c":"RandomWalkIter.Int","l":"lastEdgeInt()"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter","l":"layer()"},{"p":"com.jgalgo.io","c":"LedaGraphReader","l":"LedaGraphReader()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.io","c":"LedaGraphWriter","l":"LedaGraphWriter()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"leftEdges()"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"leftEdges()"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"leftVertices()"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"leftVertices()"},{"p":"com.jgalgo.gen","c":"LineGraphGenerator","l":"LineGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"LineGraphGenerator","l":"LineGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.graph","c":"WeightFunctions","l":"localEdgeWeightFunction(IndexGraph, IWeightFunction)","url":"localEdgeWeightFunction(com.jgalgo.graph.IndexGraph,com.jgalgo.graph.IWeightFunction)"},{"p":"com.jgalgo.graph","c":"WeightFunctions","l":"localEdgeWeightFunction(IndexGraph, IWeightFunctionInt)","url":"localEdgeWeightFunction(com.jgalgo.graph.IndexGraph,com.jgalgo.graph.IWeightFunctionInt)"},{"p":"com.jgalgo.example","c":"BfsDfsExample","l":"main(String[])","url":"main(java.lang.String[])"},{"p":"com.jgalgo.example","c":"ColoringExample","l":"main(String[])","url":"main(java.lang.String[])"},{"p":"com.jgalgo.example","c":"EdgeIterationExample","l":"main(String[])","url":"main(java.lang.String[])"},{"p":"com.jgalgo.example","c":"LowestCommonAncestorExample","l":"main(String[])","url":"main(java.lang.String[])"},{"p":"com.jgalgo.example","c":"MaximumMatchingExample","l":"main(String[])","url":"main(java.lang.String[])"},{"p":"com.jgalgo.example","c":"MinimumSpanningTreeExample","l":"main(String[])","url":"main(java.lang.String[])"},{"p":"com.jgalgo.example","c":"ShortestPathExample","l":"main(String[])","url":"main(java.lang.String[])"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder.ReIndexingMap","l":"map(int)"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismMapping","l":"mapEdge(E1)"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismIMapping","l":"mapEdge(int)"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismIMapping","l":"mapEdge(Integer)","url":"mapEdge(java.lang.Integer)"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismIMapping","l":"mappedEdges()"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismMapping","l":"mappedEdges()"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismIMapping","l":"mappedVertices()"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismMapping","l":"mappedVertices()"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismIMapping","l":"mapVertex(int)"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismIMapping","l":"mapVertex(Integer)","url":"mapVertex(java.lang.Integer)"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismMapping","l":"mapVertex(V1)"},{"p":"com.jgalgo.alg.match","c":"IMatching","l":"matchedVertices()"},{"p":"com.jgalgo.alg.match","c":"Matching","l":"matchedVertices()"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo.Result","l":"maxCore()"},{"p":"com.jgalgo.alg.clique","c":"MaximalCliquesEnumeratorAbstract","l":"MaximalCliquesEnumeratorAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.clique","c":"MaximalCliquesEnumeratorBronKerbosch","l":"MaximalCliquesEnumeratorBronKerbosch()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.clique","c":"MaximalCliquesEnumeratorBronKerboschPivot","l":"MaximalCliquesEnumeratorBronKerboschPivot()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.clique","c":"MaximalCliquesEnumerator","l":"maximalCliquesIter(Graph)","url":"maximalCliquesIter(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.clique","c":"MaximalCliquesEnumeratorAbstract","l":"maximalCliquesIter(Graph)","url":"maximalCliquesIter(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.clique","c":"MaximalIndependentSetsEnumeratorAbstract","l":"MaximalIndependentSetsEnumeratorAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.clique","c":"MaximalIndependentSetsEnumeratorComplementCliques","l":"MaximalIndependentSetsEnumeratorComplementCliques()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.clique","c":"MaximalIndependentSetsEnumerator","l":"maximalIndependentSetsIter(Graph)","url":"maximalIndependentSetsIter(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.clique","c":"MaximalIndependentSetsEnumeratorAbstract","l":"maximalIndependentSetsIter(Graph)","url":"maximalIndependentSetsIter(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.example","c":"MaximumMatchingExample","l":"maximumMatchingExample()"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutAllST","l":"minimumCutsIter(Graph, WeightFunction, V, V)","url":"minimumCutsIter(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutAllSTAbstract","l":"minimumCutsIter(Graph, WeightFunction, V, V)","url":"minimumCutsIter(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllST","l":"minimumCutsIter(Graph, WeightFunction, V, V)","url":"minimumCutsIter(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllSTAbstract","l":"minimumCutsIter(Graph, WeightFunction, V, V)","url":"minimumCutsIter(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,V,V)"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllGlobal","l":"minimumCutsIter(Graph, WeightFunction)","url":"minimumCutsIter(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllGlobalAbstract","l":"minimumCutsIter(Graph, WeightFunction)","url":"minimumCutsIter(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutAllSTAbstract","l":"MinimumEdgeCutAllSTAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutAllSTPicardQueyranne","l":"MinimumEdgeCutAllSTPicardQueyranne()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutGlobalAbstract","l":"MinimumEdgeCutGlobalAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutGlobalStoerWagner","l":"MinimumEdgeCutGlobalStoerWagner()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutSTAbstract","l":"MinimumEdgeCutSTAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.cycle","c":"MinimumMeanCycleAbstract","l":"MinimumMeanCycleAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.cycle","c":"MinimumMeanCycleDasdanGupta","l":"MinimumMeanCycleDasdanGupta()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.cycle","c":"MinimumMeanCycleHoward","l":"MinimumMeanCycleHoward()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllGlobalAbstract","l":"MinimumVertexCutAllGlobalAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllGlobalKanevsky","l":"MinimumVertexCutAllGlobalKanevsky()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllSTAbstract","l":"MinimumVertexCutAllSTAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllSTEdgeCut","l":"MinimumVertexCutAllSTEdgeCut()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutGlobalAbstract","l":"MinimumVertexCutGlobalAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutGlobalEsfahanianHakimi","l":"MinimumVertexCutGlobalEsfahanianHakimi()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutSTAbstract","l":"MinimumVertexCutSTAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutSTEdgeCut","l":"MinimumVertexCutSTEdgeCut()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"moveEdge(E, V, V)","url":"moveEdge(E,V,V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"moveEdge(E, V, V)","url":"moveEdge(E,V,V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"moveEdge(E, V, V)","url":"moveEdge(E,V,V)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"moveEdge(int, int, int)","url":"moveEdge(int,int,int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"moveEdge(Integer, Integer, Integer)","url":"moveEdge(java.lang.Integer,java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.example","c":"MinimumSpanningTreeExample","l":"mstExample()"},{"p":"com.jgalgo.graph","c":"WeightFunctions","l":"negate(IWeightFunction)","url":"negate(com.jgalgo.graph.IWeightFunction)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"newBuilder()"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"newBuilder()"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"newBuilder()"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"newBuilderCopyOf(Graph, boolean, boolean)","url":"newBuilderCopyOf(com.jgalgo.graph.Graph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"newBuilderCopyOf(Graph, boolean, boolean)","url":"newBuilderCopyOf(com.jgalgo.graph.Graph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"newBuilderCopyOf(Graph)","url":"newBuilderCopyOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"newBuilderCopyOf(Graph)","url":"newBuilderCopyOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"newBuilderCopyOf(Graph, boolean, boolean)","url":"newBuilderCopyOf(com.jgalgo.graph.Graph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"newBuilderCopyOf(Graph)","url":"newBuilderCopyOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"newCopyOf(Graph, boolean, boolean)","url":"newCopyOf(com.jgalgo.graph.Graph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"newCopyOf(Graph, boolean, boolean)","url":"newCopyOf(com.jgalgo.graph.Graph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"newCopyOf(Graph, boolean, boolean)","url":"newCopyOf(com.jgalgo.graph.Graph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"newCopyOf(Graph)","url":"newCopyOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"newCopyOf(Graph)","url":"newCopyOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"newCopyOf(Graph)","url":"newCopyOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"newCopyOf(Graph, boolean, boolean)","url":"newCopyOf(com.jgalgo.graph.Graph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"newCopyOf(Graph, boolean, boolean)","url":"newCopyOf(com.jgalgo.graph.Graph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"newCopyOf(Graph)","url":"newCopyOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"newCopyOf(Graph)","url":"newCopyOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"newCopyOf(IndexGraph, boolean, boolean)","url":"newCopyOf(com.jgalgo.graph.IndexGraph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"newCopyOf(IndexGraph)","url":"newCopyOf(com.jgalgo.graph.IndexGraph)"},{"p":"com.jgalgo.graph","c":"Graph","l":"newDirected()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"newDirected()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"newDirected()"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutST","l":"newFromMaximumFlow(MaximumFlow)","url":"newFromMaximumFlow(com.jgalgo.alg.flow.MaximumFlow)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"newGraph()"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"newGraph()"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"newGraph()"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"newImmutableCopyOf(Graph, boolean, boolean)","url":"newImmutableCopyOf(com.jgalgo.graph.Graph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"newImmutableCopyOf(Graph, boolean, boolean)","url":"newImmutableCopyOf(com.jgalgo.graph.Graph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"newImmutableCopyOf(Graph)","url":"newImmutableCopyOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"newImmutableCopyOf(Graph)","url":"newImmutableCopyOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"newImmutableCopyOf(Graph, boolean, boolean)","url":"newImmutableCopyOf(com.jgalgo.graph.Graph,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"newImmutableCopyOf(Graph)","url":"newImmutableCopyOf(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.clique","c":"MaximalCliquesEnumerator","l":"newInstance()"},{"p":"com.jgalgo.alg.clique","c":"MaximalIndependentSetsEnumerator","l":"newInstance()"},{"p":"com.jgalgo.alg.closure","c":"ClosuresEnumerator","l":"newInstance()"},{"p":"com.jgalgo.alg.color","c":"ColoringAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"BiConnectedComponentsAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"KEdgeConnectedComponentsAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"KVertexConnectedComponentsAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutAllST","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutGlobal","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"MinimumEdgeCutST","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllGlobal","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutAllST","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutGlobal","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"MinimumVertexCutST","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"StronglyConnectedComponentsAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.connect","c":"WeaklyConnectedComponentsAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.cover","c":"DominatingSetAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.cover","c":"EdgeCover","l":"newInstance()"},{"p":"com.jgalgo.alg.cover","c":"VertexCover","l":"newInstance()"},{"p":"com.jgalgo.alg.cycle","c":"ChinesePostman","l":"newInstance()"},{"p":"com.jgalgo.alg.cycle","c":"CyclesEnumerator","l":"newInstance()"},{"p":"com.jgalgo.alg.cycle","c":"MinimumMeanCycle","l":"newInstance()"},{"p":"com.jgalgo.alg.dag","c":"TopologicalOrderAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.euler","c":"EulerianTourAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.flow","c":"MaximumFlow","l":"newInstance()"},{"p":"com.jgalgo.alg.flow","c":"MinimumCostFlow","l":"newInstance()"},{"p":"com.jgalgo.alg.hamilton","c":"HamiltonianPathAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismTester","l":"newInstance()"},{"p":"com.jgalgo.alg.match","c":"MatchingAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.path","c":"KShortestPathsST","l":"newInstance()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs","l":"newInstance()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathHeuristicST","l":"newInstance()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathST","l":"newInstance()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource","l":"newInstance()"},{"p":"com.jgalgo.alg.path","c":"SimplePathsEnumerator","l":"newInstance()"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.span","c":"MinimumDirectedSpanningTree","l":"newInstance()"},{"p":"com.jgalgo.alg.span","c":"MinimumSpanningTree","l":"newInstance()"},{"p":"com.jgalgo.alg.span","c":"SteinerTreeAlgo","l":"newInstance()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorDynamic","l":"newInstance()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline","l":"newInstance()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.IQueries","l":"newInstance()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorStatic","l":"newInstance()"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima","l":"newInstance()"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.IQueries","l":"newInstance()"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.Queries","l":"newInstance()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"newInstance(boolean)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"newInstance(boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"newInstance(boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"newInstance(boolean)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"newInstance(boolean)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"newInstance(boolean)"},{"p":"com.jgalgo.alg.traversal","c":"RandomWalkIter","l":"newInstance(Graph, V, WeightFunction)","url":"newInstance(com.jgalgo.graph.Graph,V,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter","l":"newInstance(Graph, V)","url":"newInstance(com.jgalgo.graph.Graph,V)"},{"p":"com.jgalgo.alg.traversal","c":"DfsIter","l":"newInstance(Graph, V)","url":"newInstance(com.jgalgo.graph.Graph,V)"},{"p":"com.jgalgo.alg.traversal","c":"RandomWalkIter","l":"newInstance(Graph, V)","url":"newInstance(com.jgalgo.graph.Graph,V)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.Queries","l":"newInstance(Graph)","url":"newInstance(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter","l":"newInstance(IntGraph, int)","url":"newInstance(com.jgalgo.graph.IntGraph,int)"},{"p":"com.jgalgo.alg.traversal","c":"DfsIter","l":"newInstance(IntGraph, int)","url":"newInstance(com.jgalgo.graph.IntGraph,int)"},{"p":"com.jgalgo.graph","c":"Graph","l":"newUndirected()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"newUndirected()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"newUndirected()"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter","l":"next()"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter.Int","l":"next()"},{"p":"com.jgalgo.alg.traversal","c":"DfsIter","l":"next()"},{"p":"com.jgalgo.alg.traversal","c":"DfsIter.Int","l":"next()"},{"p":"com.jgalgo.alg.traversal","c":"RandomWalkIter","l":"next()"},{"p":"com.jgalgo.alg.traversal","c":"RandomWalkIter.Int","l":"next()"},{"p":"com.jgalgo.alg.traversal","c":"BfsIter.Int","l":"nextInt()"},{"p":"com.jgalgo.alg.traversal","c":"DfsIter.Int","l":"nextInt()"},{"p":"com.jgalgo.alg.traversal","c":"RandomWalkIter.Int","l":"nextInt()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"nodeOrder()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"nodeOrder()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"nodeOrder()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"nodes()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"nodes()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"nodes()"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"numberOfBlocks()"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"numberOfBlocks()"},{"p":"com.jgalgo.alg.distancemeasures","c":"DistanceMeasures","l":"of(Graph, WeightFunction)","url":"of(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.graph","c":"IEdgeSet","l":"of(IntSet, IntGraph)","url":"of(it.unimi.dsi.fastutil.ints.IntSet,com.jgalgo.graph.IntGraph)"},{"p":"com.jgalgo.graph","c":"EdgeSet","l":"of(Set, Graph)","url":"of(java.util.Set,com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"NoSuchEdgeException","l":"ofEdge(int)"},{"p":"com.jgalgo.graph","c":"NoSuchEdgeException","l":"ofEdge(Object)","url":"ofEdge(java.lang.Object)"},{"p":"com.jgalgo.graph","c":"NoSuchEdgeException","l":"ofIndex(int)"},{"p":"com.jgalgo.graph","c":"NoSuchVertexException","l":"ofIndex(int)"},{"p":"com.jgalgo.graph","c":"NoSuchVertexException","l":"ofVertex(int)"},{"p":"com.jgalgo.graph","c":"NoSuchVertexException","l":"ofVertex(Object)","url":"ofVertex(java.lang.Object)"},{"p":"com.jgalgo.alg.dag","c":"TopologicalOrderAlgo.IResult","l":"orderComparator()"},{"p":"com.jgalgo.alg.dag","c":"TopologicalOrderAlgo.Result","l":"orderComparator()"},{"p":"com.jgalgo.alg.dag","c":"TopologicalOrderAlgo.IResult","l":"orderedVertices()"},{"p":"com.jgalgo.alg.dag","c":"TopologicalOrderAlgo.Result","l":"orderedVertices()"},{"p":"com.jgalgo.alg","c":"EdgeDirection","l":"Out"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"outDegree(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"outDegree(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"outDegreeOf(V)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"outEdges(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"outEdges(Integer)","url":"outEdges(java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"outEdges(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"outEdges(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"outEdges(V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"outEdges(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"outgoingEdgesOf(V)"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"parallelEdges(boolean)"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"parallelEdges(boolean)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.IResult","l":"partition()"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.Result","l":"partition()"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"partitionFromIndexPartition(Graph, IVertexBiPartition)","url":"partitionFromIndexPartition(com.jgalgo.graph.Graph,com.jgalgo.alg.IVertexBiPartition)"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"partitionFromIndexPartition(Graph, IVertexPartition)","url":"partitionFromIndexPartition(com.jgalgo.graph.Graph,com.jgalgo.alg.IVertexPartition)"},{"p":"com.jgalgo.alg.path","c":"Path","l":"pathFromIndexPath(Graph, IPath)","url":"pathFromIndexPath(com.jgalgo.graph.Graph,com.jgalgo.alg.path.IPath)"},{"p":"com.jgalgo.graph","c":"EdgeIter","l":"peekNext()"},{"p":"com.jgalgo.graph","c":"IEdgeIter","l":"peekNext()"},{"p":"com.jgalgo.graph","c":"IEdgeIter","l":"peekNextInt()"},{"p":"com.jgalgo.alg.distancemeasures","c":"DistanceMeasures","l":"periphery()"},{"p":"com.jgalgo.alg.distancemeasures","c":"IDistanceMeasures","l":"periphery()"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"predecessors(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"predecessors(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"predecessors(V)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorStatic","l":"preProcessTree(Graph, V)","url":"preProcessTree(com.jgalgo.graph.Graph,V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableGraphAdapter","l":"putEdge(EndpointPair)","url":"putEdge(com.google.common.graph.EndpointPair)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableGraphAdapter","l":"putEdge(V, V)","url":"putEdge(V,V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableValueGraphAdapter","l":"putEdgeValue(EndpointPair, ValueT)","url":"putEdgeValue(com.google.common.graph.EndpointPair,ValueT)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableValueGraphAdapter","l":"putEdgeValue(V, V, ValueT)","url":"putEdgeValue(V,V,ValueT)"},{"p":"com.jgalgo.alg.distancemeasures","c":"DistanceMeasures","l":"radius()"},{"p":"com.jgalgo.graph","c":"Graphs","l":"randEdge(Graph, Random)","url":"randEdge(com.jgalgo.graph.Graph,java.util.Random)"},{"p":"com.jgalgo.graph","c":"Graphs","l":"randEdge(IntGraph, Random)","url":"randEdge(com.jgalgo.graph.IntGraph,java.util.Random)"},{"p":"com.jgalgo.graph","c":"Graphs","l":"randVertex(Graph, Random)","url":"randVertex(com.jgalgo.graph.Graph,java.util.Random)"},{"p":"com.jgalgo.graph","c":"Graphs","l":"randVertex(IntGraph, Random)","url":"randVertex(com.jgalgo.graph.IntGraph,java.util.Random)"},{"p":"com.jgalgo.alg.path","c":"Path","l":"reachableVertices(Graph, Iterator)","url":"reachableVertices(com.jgalgo.graph.Graph,java.util.Iterator)"},{"p":"com.jgalgo.alg.path","c":"Path","l":"reachableVertices(Graph, V)","url":"reachableVertices(com.jgalgo.graph.Graph,V)"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"reachableVertices(IntGraph, int)","url":"reachableVertices(com.jgalgo.graph.IntGraph,int)"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"reachableVertices(IntGraph, IntIterator)","url":"reachableVertices(com.jgalgo.graph.IntGraph,it.unimi.dsi.fastutil.ints.IntIterator)"},{"p":"com.jgalgo.io","c":"GraphReader","l":"readGraph(File)","url":"readGraph(java.io.File)"},{"p":"com.jgalgo.io","c":"GraphReader","l":"readGraph(Reader)","url":"readGraph(java.io.Reader)"},{"p":"com.jgalgo.io","c":"GraphReader","l":"readGraph(String)","url":"readGraph(java.lang.String)"},{"p":"com.jgalgo.io","c":"GraphReader","l":"readIntoBuilder(Reader)","url":"readIntoBuilder(java.io.Reader)"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"RecursiveMatrixGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"RecursiveMatrixGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"reIndexAndBuild(boolean, boolean)","url":"reIndexAndBuild(boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"reIndexAndBuildMutable(boolean, boolean)","url":"reIndexAndBuildMutable(boolean,boolean)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"removeAllEdges(V, V)","url":"removeAllEdges(V,V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableNetworkAdapter","l":"removeEdge(E)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"removeEdge(E)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"removeEdge(E)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"removeEdge(E)"},{"p":"com.jgalgo.graph","c":"Graph","l":"removeEdge(E)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableGraphAdapter","l":"removeEdge(EndpointPair)","url":"removeEdge(com.google.common.graph.EndpointPair)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableValueGraphAdapter","l":"removeEdge(EndpointPair)","url":"removeEdge(com.google.common.graph.EndpointPair)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"removeEdge(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"removeEdge(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"removeEdge(Integer)","url":"removeEdge(java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableGraphAdapter","l":"removeEdge(V, V)","url":"removeEdge(V,V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableValueGraphAdapter","l":"removeEdge(V, V)","url":"removeEdge(V,V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"removeEdge(V, V)","url":"removeEdge(V,V)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"removeEdgeRemoveListener(IndexRemoveListener)","url":"removeEdgeRemoveListener(com.jgalgo.graph.IndexRemoveListener)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"removeEdges(Collection)","url":"removeEdges(java.util.Collection)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"removeEdges(Collection)","url":"removeEdges(java.util.Collection)"},{"p":"com.jgalgo.graph","c":"Graph","l":"removeEdges(Collection)","url":"removeEdges(java.util.Collection)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"removeEdgesOf(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"removeEdgesOf(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"removeEdgesOf(Integer)","url":"removeEdgesOf(java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"removeEdgesOf(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"removeEdgesOf(V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"removeEdgesOf(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"removeEdgesWeights(String)","url":"removeEdgesWeights(java.lang.String)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"removeEdgesWeights(String)","url":"removeEdgesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"Graph","l":"removeEdgesWeights(String)","url":"removeEdgesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"removeEdgesWeights(String)","url":"removeEdgesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"removeHint(GraphFactory.Hint)","url":"removeHint(com.jgalgo.graph.GraphFactory.Hint)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"removeHint(GraphFactory.Hint)","url":"removeHint(com.jgalgo.graph.GraphFactory.Hint)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"removeHint(GraphFactory.Hint)","url":"removeHint(com.jgalgo.graph.GraphFactory.Hint)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"removeInEdgesOf(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"removeInEdgesOf(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"removeInEdgesOf(Integer)","url":"removeInEdgesOf(java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"removeInEdgesOf(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"removeInEdgesOf(V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"removeInEdgesOf(V)"},{"p":"com.jgalgo.graph","c":"IndexRemoveListener","l":"removeLast(int)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableGraphAdapter","l":"removeNode(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableNetworkAdapter","l":"removeNode(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaMutableValueGraphAdapter","l":"removeNode(V)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"removeOutEdgesOf(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"removeOutEdgesOf(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"removeOutEdgesOf(Integer)","url":"removeOutEdgesOf(java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"removeOutEdgesOf(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"removeOutEdgesOf(V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"removeOutEdgesOf(V)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"removeVertex(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"removeVertex(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"removeVertex(Integer)","url":"removeVertex(java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"removeVertex(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"removeVertex(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"removeVertex(V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"removeVertex(V)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"removeVertexRemoveListener(IndexRemoveListener)","url":"removeVertexRemoveListener(com.jgalgo.graph.IndexRemoveListener)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"removeVertices(Collection)","url":"removeVertices(java.util.Collection)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"removeVertices(Collection)","url":"removeVertices(java.util.Collection)"},{"p":"com.jgalgo.graph","c":"Graph","l":"removeVertices(Collection)","url":"removeVertices(java.util.Collection)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"removeVerticesWeights(String)","url":"removeVerticesWeights(java.lang.String)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"removeVerticesWeights(String)","url":"removeVerticesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"Graph","l":"removeVerticesWeights(String)","url":"removeVerticesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"removeVerticesWeights(String)","url":"removeVerticesWeights(java.lang.String)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"renameEdge(E, E)","url":"renameEdge(E,E)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"renameEdge(E, E)","url":"renameEdge(E,E)"},{"p":"com.jgalgo.graph","c":"Graph","l":"renameEdge(E, E)","url":"renameEdge(E,E)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"renameEdge(int, int)","url":"renameEdge(int,int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"renameEdge(int, int)","url":"renameEdge(int,int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"renameEdge(Integer, Integer)","url":"renameEdge(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"renameVertex(int, int)","url":"renameVertex(int,int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"renameVertex(int, int)","url":"renameVertex(int,int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"renameVertex(Integer, Integer)","url":"renameVertex(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"renameVertex(V, V)","url":"renameVertex(V,V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"renameVertex(V, V)","url":"renameVertex(V,V)"},{"p":"com.jgalgo.graph","c":"Graph","l":"renameVertex(V, V)","url":"renameVertex(V,V)"},{"p":"com.jgalgo.graph","c":"IWeightFunction","l":"replaceNullWeightFunc(IWeightFunction)","url":"replaceNullWeightFunc(com.jgalgo.graph.IWeightFunction)"},{"p":"com.jgalgo.graph","c":"IWeightFunction","l":"replaceNullWeightFunc(IWeightFunctionInt)","url":"replaceNullWeightFunc(com.jgalgo.graph.IWeightFunctionInt)"},{"p":"com.jgalgo.graph","c":"WeightFunction","l":"replaceNullWeightFunc(WeightFunction)","url":"replaceNullWeightFunc(com.jgalgo.graph.WeightFunction)"},{"p":"com.jgalgo.graph","c":"WeightFunction","l":"replaceNullWeightFunc(WeightFunctionInt)","url":"replaceNullWeightFunc(com.jgalgo.graph.WeightFunctionInt)"},{"p":"com.jgalgo.graph","c":"Graph","l":"reverseEdge(E)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"reverseEdge(int)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"reverseEdge(Integer)","url":"reverseEdge(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"Graph","l":"reverseView()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"reverseView()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"reverseView()"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"rightEdges()"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"rightEdges()"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"rightVertices()"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"rightVertices()"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"seed(long)"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"seed(long)"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"seed(long)"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"seed(long)"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"seed(long)"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"seed(long)"},{"p":"com.jgalgo.gen","c":"UniformTreeGenerator","l":"seed(long)"},{"p":"com.jgalgo.gen","c":"ComplementGraphGenerator","l":"selfEdges(boolean)"},{"p":"com.jgalgo.gen","c":"CompleteGraphGenerator","l":"selfEdges(boolean)"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"selfEdges(boolean)"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"selfEdges(boolean)"},{"p":"com.jgalgo.graph","c":"Graphs","l":"selfEdges(Graph)","url":"selfEdges(com.jgalgo.graph.Graph)"},{"p":"com.jgalgo.graph","c":"Graphs","l":"selfEdges(IntGraph)","url":"selfEdges(com.jgalgo.graph.IntGraph)"},{"p":"com.jgalgo.graph","c":"IWeightsBool","l":"set(int, boolean)","url":"set(int,boolean)"},{"p":"com.jgalgo.graph","c":"IWeightsByte","l":"set(int, byte)","url":"set(int,byte)"},{"p":"com.jgalgo.graph","c":"IWeightsChar","l":"set(int, char)","url":"set(int,char)"},{"p":"com.jgalgo.graph","c":"IWeightsDouble","l":"set(int, double)","url":"set(int,double)"},{"p":"com.jgalgo.graph","c":"IWeightsFloat","l":"set(int, float)","url":"set(int,float)"},{"p":"com.jgalgo.graph","c":"IWeightsInt","l":"set(int, int)","url":"set(int,int)"},{"p":"com.jgalgo.graph","c":"IWeightsLong","l":"set(int, long)","url":"set(int,long)"},{"p":"com.jgalgo.graph","c":"IWeightsShort","l":"set(int, short)","url":"set(int,short)"},{"p":"com.jgalgo.graph","c":"IWeightsObj","l":"set(int, T)","url":"set(int,T)"},{"p":"com.jgalgo.graph","c":"IWeightsBool","l":"set(Integer, boolean)","url":"set(java.lang.Integer,boolean)"},{"p":"com.jgalgo.graph","c":"IWeightsByte","l":"set(Integer, byte)","url":"set(java.lang.Integer,byte)"},{"p":"com.jgalgo.graph","c":"IWeightsChar","l":"set(Integer, char)","url":"set(java.lang.Integer,char)"},{"p":"com.jgalgo.graph","c":"IWeightsDouble","l":"set(Integer, double)","url":"set(java.lang.Integer,double)"},{"p":"com.jgalgo.graph","c":"IWeightsFloat","l":"set(Integer, float)","url":"set(java.lang.Integer,float)"},{"p":"com.jgalgo.graph","c":"IWeightsInt","l":"set(Integer, int)","url":"set(java.lang.Integer,int)"},{"p":"com.jgalgo.graph","c":"IWeightsLong","l":"set(Integer, long)","url":"set(java.lang.Integer,long)"},{"p":"com.jgalgo.graph","c":"IWeightsShort","l":"set(Integer, short)","url":"set(java.lang.Integer,short)"},{"p":"com.jgalgo.graph","c":"IWeightsObj","l":"set(Integer, T)","url":"set(java.lang.Integer,T)"},{"p":"com.jgalgo.graph","c":"WeightsBool","l":"set(K, boolean)","url":"set(K,boolean)"},{"p":"com.jgalgo.graph","c":"WeightsByte","l":"set(K, byte)","url":"set(K,byte)"},{"p":"com.jgalgo.graph","c":"WeightsChar","l":"set(K, char)","url":"set(K,char)"},{"p":"com.jgalgo.graph","c":"WeightsDouble","l":"set(K, double)","url":"set(K,double)"},{"p":"com.jgalgo.graph","c":"WeightsFloat","l":"set(K, float)","url":"set(K,float)"},{"p":"com.jgalgo.graph","c":"WeightsInt","l":"set(K, int)","url":"set(K,int)"},{"p":"com.jgalgo.graph","c":"WeightsLong","l":"set(K, long)","url":"set(K,long)"},{"p":"com.jgalgo.graph","c":"WeightsShort","l":"set(K, short)","url":"set(K,short)"},{"p":"com.jgalgo.graph","c":"WeightsObj","l":"set(K, T)","url":"set(K,T)"},{"p":"com.jgalgo.graph","c":"IWeightsBool","l":"setAsObj(int, Boolean)","url":"setAsObj(int,java.lang.Boolean)"},{"p":"com.jgalgo.graph","c":"IWeightsByte","l":"setAsObj(int, Byte)","url":"setAsObj(int,java.lang.Byte)"},{"p":"com.jgalgo.graph","c":"IWeightsChar","l":"setAsObj(int, Character)","url":"setAsObj(int,java.lang.Character)"},{"p":"com.jgalgo.graph","c":"IWeightsDouble","l":"setAsObj(int, Double)","url":"setAsObj(int,java.lang.Double)"},{"p":"com.jgalgo.graph","c":"IWeightsFloat","l":"setAsObj(int, Float)","url":"setAsObj(int,java.lang.Float)"},{"p":"com.jgalgo.graph","c":"IWeightsInt","l":"setAsObj(int, Integer)","url":"setAsObj(int,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsLong","l":"setAsObj(int, Long)","url":"setAsObj(int,java.lang.Long)"},{"p":"com.jgalgo.graph","c":"IWeightsShort","l":"setAsObj(int, Short)","url":"setAsObj(int,java.lang.Short)"},{"p":"com.jgalgo.graph","c":"IWeights","l":"setAsObj(int, T)","url":"setAsObj(int,T)"},{"p":"com.jgalgo.graph","c":"IWeightsObj","l":"setAsObj(int, T)","url":"setAsObj(int,T)"},{"p":"com.jgalgo.graph","c":"IWeightsBool","l":"setAsObj(Integer, Boolean)","url":"setAsObj(java.lang.Integer,java.lang.Boolean)"},{"p":"com.jgalgo.graph","c":"IWeightsByte","l":"setAsObj(Integer, Byte)","url":"setAsObj(java.lang.Integer,java.lang.Byte)"},{"p":"com.jgalgo.graph","c":"IWeightsChar","l":"setAsObj(Integer, Character)","url":"setAsObj(java.lang.Integer,java.lang.Character)"},{"p":"com.jgalgo.graph","c":"IWeightsDouble","l":"setAsObj(Integer, Double)","url":"setAsObj(java.lang.Integer,java.lang.Double)"},{"p":"com.jgalgo.graph","c":"IWeightsFloat","l":"setAsObj(Integer, Float)","url":"setAsObj(java.lang.Integer,java.lang.Float)"},{"p":"com.jgalgo.graph","c":"IWeightsInt","l":"setAsObj(Integer, Integer)","url":"setAsObj(java.lang.Integer,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsLong","l":"setAsObj(Integer, Long)","url":"setAsObj(java.lang.Integer,java.lang.Long)"},{"p":"com.jgalgo.graph","c":"IWeightsShort","l":"setAsObj(Integer, Short)","url":"setAsObj(java.lang.Integer,java.lang.Short)"},{"p":"com.jgalgo.graph","c":"IWeights","l":"setAsObj(Integer, T)","url":"setAsObj(java.lang.Integer,T)"},{"p":"com.jgalgo.graph","c":"IWeightsObj","l":"setAsObj(Integer, T)","url":"setAsObj(java.lang.Integer,T)"},{"p":"com.jgalgo.graph","c":"WeightsBool","l":"setAsObj(K, Boolean)","url":"setAsObj(K,java.lang.Boolean)"},{"p":"com.jgalgo.graph","c":"WeightsByte","l":"setAsObj(K, Byte)","url":"setAsObj(K,java.lang.Byte)"},{"p":"com.jgalgo.graph","c":"WeightsChar","l":"setAsObj(K, Character)","url":"setAsObj(K,java.lang.Character)"},{"p":"com.jgalgo.graph","c":"WeightsDouble","l":"setAsObj(K, Double)","url":"setAsObj(K,java.lang.Double)"},{"p":"com.jgalgo.graph","c":"WeightsFloat","l":"setAsObj(K, Float)","url":"setAsObj(K,java.lang.Float)"},{"p":"com.jgalgo.graph","c":"WeightsInt","l":"setAsObj(K, Integer)","url":"setAsObj(K,java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"WeightsLong","l":"setAsObj(K, Long)","url":"setAsObj(K,java.lang.Long)"},{"p":"com.jgalgo.graph","c":"WeightsShort","l":"setAsObj(K, Short)","url":"setAsObj(K,java.lang.Short)"},{"p":"com.jgalgo.graph","c":"Weights","l":"setAsObj(K, T)","url":"setAsObj(K,T)"},{"p":"com.jgalgo.graph","c":"WeightsObj","l":"setAsObj(K, T)","url":"setAsObj(K,T)"},{"p":"com.jgalgo.alg.match","c":"MatchingAlgo.Builder","l":"setBipartite(boolean)"},{"p":"com.jgalgo.alg.match","c":"MatchingAlgo.Builder","l":"setCardinality(boolean)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathAllPairs.Builder","l":"setCardinality(boolean)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Builder","l":"setCardinality(boolean)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Builder","l":"setDag(boolean)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorDynamic.Vertex","l":"setData(Object)","url":"setData(java.lang.Object)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"setDirected(boolean)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"setDirected(boolean)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"setDirected(boolean)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"setEdgeBuilder(IdBuilder)","url":"setEdgeBuilder(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.io","c":"GexfGraphReader","l":"setEdgeBuilder(IdBuilder)","url":"setEdgeBuilder(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.io","c":"GraphMlGraphReader","l":"setEdgeBuilder(IdBuilder)","url":"setEdgeBuilder(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"setEdgeBuilder(IdBuilder)","url":"setEdgeBuilder(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"setEdgeBuilder(IdBuilder)","url":"setEdgeBuilder(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.io","c":"GexfGraphReader","l":"setEdgeBuilderDefault(Class)","url":"setEdgeBuilderDefault(java.lang.Class)"},{"p":"com.jgalgo.io","c":"GraphMlGraphReader","l":"setEdgeBuilderDefault(Class)","url":"setEdgeBuilderDefault(java.lang.Class)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"setEdgeFactory(Supplier>)","url":"setEdgeFactory(java.util.function.Supplier)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"setEdgeFactory(Supplier>)","url":"setEdgeFactory(java.util.function.Supplier)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"setEdgeFactory(Supplier>)","url":"setEdgeFactory(java.util.function.Supplier)"},{"p":"com.jgalgo.io","c":"GexfGraphReader","l":"setEdgeParser(Function)","url":"setEdgeParser(java.util.function.Function)"},{"p":"com.jgalgo.io","c":"GraphMlGraphReader","l":"setEdgeParser(Function)","url":"setEdgeParser(java.util.function.Function)"},{"p":"com.jgalgo.io","c":"GexfGraphReader","l":"setEdgeParserDefault(Class)","url":"setEdgeParserDefault(java.lang.Class)"},{"p":"com.jgalgo.io","c":"GraphMlGraphReader","l":"setEdgeParserDefault(Class)","url":"setEdgeParserDefault(java.lang.Class)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"setEdgeSupplier(Supplier)","url":"setEdgeSupplier(java.util.function.Supplier)"},{"p":"com.jgalgo.io","c":"LedaGraphReader","l":"setEdgesWeightsKey(String)","url":"setEdgesWeightsKey(java.lang.String)"},{"p":"com.jgalgo.io","c":"LedaGraphWriter","l":"setEdgesWeightsKey(String)","url":"setEdgesWeightsKey(java.lang.String)"},{"p":"com.jgalgo.io","c":"GmlGraphWriter","l":"setEdgesWeightsKeys(Collection)","url":"setEdgesWeightsKeys(java.util.Collection)"},{"p":"com.jgalgo.io","c":"GmlGraphReader","l":"setEdgeType(Class)","url":"setEdgeType(java.lang.Class)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"setEdgeWeight(E, double)","url":"setEdgeWeight(E,double)"},{"p":"com.jgalgo.io","c":"DimacsGraphWriter","l":"setEdgeWeights(String)","url":"setEdgeWeights(java.lang.String)"},{"p":"com.jgalgo.io","c":"DimacsGraphReader","l":"setEdgeWeightsKey(String)","url":"setEdgeWeightsKey(java.lang.String)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Builder","l":"setIntWeights(boolean)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Builder","l":"setMaxDistance(double)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Builder","l":"setNegativeWeights(boolean)"},{"p":"com.jgalgo.alg","c":"AlgorithmBuilderBase","l":"setOption(String, Object)","url":"setOption(java.lang.String,java.lang.Object)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"setOption(String, Object)","url":"setOption(java.lang.String,java.lang.Object)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"setOption(String, Object)","url":"setOption(java.lang.String,java.lang.Object)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"setOption(String, Object)","url":"setOption(java.lang.String,java.lang.Object)"},{"p":"com.jgalgo","c":"JGAlgoConfig","l":"setParallelByDefault(boolean)"},{"p":"com.jgalgo.alg","c":"RandomizedAlgorithm","l":"setSeed(long)"},{"p":"com.jgalgo.alg.color","c":"ColoringGreedy","l":"setSeed(long)"},{"p":"com.jgalgo.alg.connect","c":"KEdgeConnectedComponentsWang","l":"setSeed(long)"},{"p":"com.jgalgo.alg.cover","c":"DominatingSetAlgoGreedy","l":"setSeed(long)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"setVertexBuilder(IdBuilder)","url":"setVertexBuilder(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"setVertexBuilder(IdBuilder)","url":"setVertexBuilder(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"setVertexBuilder(IdBuilder)","url":"setVertexBuilder(com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"setVertexFactory(Supplier>)","url":"setVertexFactory(java.util.function.Supplier)"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"setVertexFactory(Supplier>)","url":"setVertexFactory(java.util.function.Supplier)"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"setVertexFactory(Supplier>)","url":"setVertexFactory(java.util.function.Supplier)"},{"p":"com.jgalgo.io","c":"GexfGraphReader","l":"setVertexParser(Function)","url":"setVertexParser(java.util.function.Function)"},{"p":"com.jgalgo.io","c":"GraphMlGraphReader","l":"setVertexParser(Function)","url":"setVertexParser(java.util.function.Function)"},{"p":"com.jgalgo.io","c":"GexfGraphReader","l":"setVertexParserDefault(Class)","url":"setVertexParserDefault(java.lang.Class)"},{"p":"com.jgalgo.io","c":"GraphMlGraphReader","l":"setVertexParserDefault(Class)","url":"setVertexParserDefault(java.lang.Class)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"setVertexSupplier(Supplier)","url":"setVertexSupplier(java.util.function.Supplier)"},{"p":"com.jgalgo.io","c":"GmlGraphReader","l":"setVertexType(Class)","url":"setVertexType(java.lang.Class)"},{"p":"com.jgalgo.io","c":"LedaGraphReader","l":"setVerticesWeightsKey(String)","url":"setVerticesWeightsKey(java.lang.String)"},{"p":"com.jgalgo.io","c":"LedaGraphWriter","l":"setVerticesWeightsKey(String)","url":"setVerticesWeightsKey(java.lang.String)"},{"p":"com.jgalgo.io","c":"GmlGraphWriter","l":"setVerticesWeightsKeys(Collection)","url":"setVerticesWeightsKeys(java.util.Collection)"},{"p":"com.jgalgo.example","c":"ShortestPathExample","l":"shortestPathExample()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.IResult","l":"shortestPathTree()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Result","l":"shortestPathTree()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.IResult","l":"shortestPathTree(boolean)"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Result","l":"shortestPathTree(boolean)"},{"p":"com.jgalgo.alg.path","c":"SimplePathsEnumerator","l":"simplePathsIter(Graph, V, V)","url":"simplePathsIter(com.jgalgo.graph.Graph,V,V)"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorDynamic","l":"size()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.Queries","l":"size()"},{"p":"com.jgalgo.alg.tree","c":"LowestCommonAncestorOffline.Result","l":"size()"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.Queries","l":"size()"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima.Result","l":"size()"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"source()"},{"p":"com.jgalgo.alg.path","c":"Path","l":"source()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.IResult","l":"source()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.Result","l":"source()"},{"p":"com.jgalgo.graph","c":"EdgeIter","l":"source()"},{"p":"com.jgalgo.graph","c":"IEdgeIter","l":"source()"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismIMapping","l":"sourceGraph()"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismMapping","l":"sourceGraph()"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"sourceInt()"},{"p":"com.jgalgo.alg.path","c":"ShortestPathSingleSource.IResult","l":"sourceInt()"},{"p":"com.jgalgo.graph","c":"IEdgeIter","l":"sourceInt()"},{"p":"com.jgalgo.io","c":"Sparse6GraphReader","l":"Sparse6GraphReader()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.io","c":"Sparse6GraphWriter","l":"Sparse6GraphWriter()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.example","c":"LowestCommonAncestorExample","l":"staticLCAExample()"},{"p":"com.jgalgo.alg.connect","c":"StronglyConnectedComponentsAlgoAbstract","l":"StronglyConnectedComponentsAlgoAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"StronglyConnectedComponentsPathBasedDfs","l":"StronglyConnectedComponentsPathBasedDfs()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"StronglyConnectedComponentsTarjan","l":"StronglyConnectedComponentsTarjan()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.graph","c":"Graphs","l":"subGraph(Graph, Collection, Collection, boolean, boolean)","url":"subGraph(com.jgalgo.graph.Graph,java.util.Collection,java.util.Collection,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"Graphs","l":"subGraph(Graph, Collection, Collection)","url":"subGraph(com.jgalgo.graph.Graph,java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.graph","c":"Graphs","l":"subGraph(Graph, Collection)","url":"subGraph(com.jgalgo.graph.Graph,java.util.Collection)"},{"p":"com.jgalgo.graph","c":"Graphs","l":"subGraph(IntGraph, IntCollection, IntCollection, boolean, boolean)","url":"subGraph(com.jgalgo.graph.IntGraph,it.unimi.dsi.fastutil.ints.IntCollection,it.unimi.dsi.fastutil.ints.IntCollection,boolean,boolean)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"subGraphCopy(Collection, Collection)","url":"subGraphCopy(java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.graph","c":"Graph","l":"subGraphCopy(Collection, Collection)","url":"subGraphCopy(java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"subPath(int, int)","url":"subPath(int,int)"},{"p":"com.jgalgo.alg.path","c":"Path","l":"subPath(int, int)","url":"subPath(int,int)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaGraphAdapter","l":"successors(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkAdapter","l":"successors(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaValueGraphAdapter","l":"successors(V)"},{"p":"com.jgalgo.graph","c":"IndexRemoveListener","l":"swapAndRemove(int, int)","url":"swapAndRemove(int,int)"},{"p":"com.jgalgo.gen","c":"SymmetricDifferenceGraphGenerator","l":"SymmetricDifferenceGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"SymmetricDifferenceGraphGenerator","l":"SymmetricDifferenceGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"target()"},{"p":"com.jgalgo.alg.path","c":"Path","l":"target()"},{"p":"com.jgalgo.graph","c":"EdgeIter","l":"target()"},{"p":"com.jgalgo.graph","c":"IEdgeIter","l":"target()"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismIMapping","l":"targetGraph()"},{"p":"com.jgalgo.alg.isomorphism","c":"IsomorphismMapping","l":"targetGraph()"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"targetInt()"},{"p":"com.jgalgo.graph","c":"IEdgeIter","l":"targetInt()"},{"p":"com.jgalgo.alg.dag","c":"TopologicalOrderAlgoAbstract","l":"TopologicalOrderAlgoAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.dag","c":"TopologicalOrderAlgoImpl","l":"TopologicalOrderAlgoImpl()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.graph","c":"AbstractGraph","l":"toString()"},{"p":"com.jgalgo.alg.path","c":"TspMetricMatchingAppx","l":"TspMetricMatchingAppx()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.path","c":"TspMetricMSTAppx","l":"TspMetricMSTAppx()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"undirected()"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"undirected()"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"undirected()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"undirected()"},{"p":"com.jgalgo.graph","c":"GraphFactory","l":"undirected()"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"undirected()"},{"p":"com.jgalgo.graph","c":"IndexGraphFactory","l":"undirected()"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"undirected()"},{"p":"com.jgalgo.graph","c":"IntGraphFactory","l":"undirected()"},{"p":"com.jgalgo.graph","c":"Graph","l":"undirectedView()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"undirectedView()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"undirectedView()"},{"p":"com.jgalgo.gen","c":"UniformTreeGenerator","l":"UniformTreeGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"UniformTreeGenerator","l":"UniformTreeGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.gen","c":"UnionGraphGenerator","l":"UnionGraphGenerator()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.gen","c":"UnionGraphGenerator","l":"UnionGraphGenerator(GraphFactory)","url":"%3Cinit%3E(com.jgalgo.graph.GraphFactory)"},{"p":"com.jgalgo.alg.match","c":"IMatching","l":"unmatchedVertices()"},{"p":"com.jgalgo.alg.match","c":"Matching","l":"unmatchedVertices()"},{"p":"com.jgalgo.alg.path","c":"Path","l":"valueOf(Graph, V, V, List)","url":"valueOf(com.jgalgo.graph.Graph,V,V,java.util.List)"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"valueOf(IntGraph, int, int, IntList)","url":"valueOf(com.jgalgo.graph.IntGraph,int,int,it.unimi.dsi.fastutil.ints.IntList)"},{"p":"com.jgalgo.alg","c":"EdgeDirection","l":"valueOf(String)","url":"valueOf(java.lang.String)"},{"p":"com.jgalgo.graph","c":"GraphFactory.Hint","l":"valueOf(String)","url":"valueOf(java.lang.String)"},{"p":"com.jgalgo.alg","c":"EdgeDirection","l":"values()"},{"p":"com.jgalgo.graph","c":"GraphFactory.Hint","l":"values()"},{"p":"com.jgalgo.alg.tree","c":"TreePathMaxima","l":"verifyMST(Graph, WeightFunction, Collection, TreePathMaxima)","url":"verifyMST(com.jgalgo.graph.Graph,com.jgalgo.graph.WeightFunction,java.util.Collection,com.jgalgo.alg.tree.TreePathMaxima)"},{"p":"com.jgalgo.alg.bipartite","c":"BipartiteGraphs","l":"VertexBiPartitionWeightKey"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"vertexBlock(int)"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"vertexBlock(int)"},{"p":"com.jgalgo.alg","c":"IVertexBiPartition","l":"vertexBlock(Integer)","url":"vertexBlock(java.lang.Integer)"},{"p":"com.jgalgo.alg","c":"IVertexPartition","l":"vertexBlock(Integer)","url":"vertexBlock(java.lang.Integer)"},{"p":"com.jgalgo.alg","c":"VertexBiPartition","l":"vertexBlock(V)"},{"p":"com.jgalgo.alg","c":"VertexPartition","l":"vertexBlock(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"vertexBuilder()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"vertexBuilder()"},{"p":"com.jgalgo.graph","c":"Graph","l":"vertexBuilder()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"vertexBuilder()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"vertexBuilder()"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder","l":"vertexBuilder()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"vertexBuilder()"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"vertexBuilder()"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo.IResult","l":"vertexCoreNum(int)"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo.IResult","l":"vertexCoreNum(Integer)","url":"vertexCoreNum(java.lang.Integer)"},{"p":"com.jgalgo.alg.cores","c":"CoresAlgo.Result","l":"vertexCoreNum(V)"},{"p":"com.jgalgo.alg.cover","c":"VertexCoverAbstract","l":"VertexCoverAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.cover","c":"VertexCoverBarYehuda","l":"VertexCoverBarYehuda()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.dag","c":"TopologicalOrderAlgo.IResult","l":"vertexOrderIndex(int)"},{"p":"com.jgalgo.alg.dag","c":"TopologicalOrderAlgo.IResult","l":"vertexOrderIndex(Integer)","url":"vertexOrderIndex(java.lang.Integer)"},{"p":"com.jgalgo.alg.dag","c":"TopologicalOrderAlgo.Result","l":"vertexOrderIndex(V)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTAdapter","l":"vertexSet()"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.IResult","l":"vertexSite(int)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.IResult","l":"vertexSite(Integer)","url":"vertexSite(java.lang.Integer)"},{"p":"com.jgalgo.alg.path","c":"VoronoiAlgo.Result","l":"vertexSite(V)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"vertices()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"vertices()"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"vertices()"},{"p":"com.jgalgo.alg.path","c":"Path","l":"vertices()"},{"p":"com.jgalgo.graph","c":"Graph","l":"vertices()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"vertices()"},{"p":"com.jgalgo.graph","c":"IndexGraph","l":"vertices()"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"vertices()"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"vertices()"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"vertices(Collection, Collection)","url":"vertices(java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"vertices(Collection, Collection)","url":"vertices(java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"vertices(Collection, Collection)","url":"vertices(java.util.Collection,java.util.Collection)"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"vertices(Collection)","url":"vertices(java.util.Collection)"},{"p":"com.jgalgo.gen","c":"CompleteGraphGenerator","l":"vertices(Collection)","url":"vertices(java.util.Collection)"},{"p":"com.jgalgo.gen","c":"EmptyGraphGenerator","l":"vertices(Collection)","url":"vertices(java.util.Collection)"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"vertices(Collection)","url":"vertices(java.util.Collection)"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"vertices(Collection)","url":"vertices(java.util.Collection)"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"vertices(Collection)","url":"vertices(java.util.Collection)"},{"p":"com.jgalgo.gen","c":"UniformTreeGenerator","l":"vertices(Collection)","url":"vertices(java.util.Collection)"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"vertices(int, IdBuilder)","url":"vertices(int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"CompleteGraphGenerator","l":"vertices(int, IdBuilder)","url":"vertices(int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"EmptyGraphGenerator","l":"vertices(int, IdBuilder)","url":"vertices(int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"vertices(int, IdBuilder)","url":"vertices(int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"vertices(int, IdBuilder)","url":"vertices(int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"vertices(int, IdBuilder)","url":"vertices(int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"UniformTreeGenerator","l":"vertices(int, IdBuilder)","url":"vertices(int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"vertices(int, int, IdBuilder)","url":"vertices(int,int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"vertices(int, int, IdBuilder)","url":"vertices(int,int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"vertices(int, int, IdBuilder)","url":"vertices(int,int,com.jgalgo.graph.IdBuilder)"},{"p":"com.jgalgo.gen","c":"CompleteBipartiteGraphGenerator","l":"vertices(int, int)","url":"vertices(int,int)"},{"p":"com.jgalgo.gen","c":"GnmBipartiteGraphGenerator","l":"vertices(int, int)","url":"vertices(int,int)"},{"p":"com.jgalgo.gen","c":"GnpBipartiteGraphGenerator","l":"vertices(int, int)","url":"vertices(int,int)"},{"p":"com.jgalgo.gen","c":"BarabasiAlbertGraphGenerator","l":"vertices(int)"},{"p":"com.jgalgo.gen","c":"CompleteGraphGenerator","l":"vertices(int)"},{"p":"com.jgalgo.gen","c":"EmptyGraphGenerator","l":"vertices(int)"},{"p":"com.jgalgo.gen","c":"GnmGraphGenerator","l":"vertices(int)"},{"p":"com.jgalgo.gen","c":"GnpGraphGenerator","l":"vertices(int)"},{"p":"com.jgalgo.gen","c":"RecursiveMatrixGraphGenerator","l":"vertices(int)"},{"p":"com.jgalgo.gen","c":"UniformTreeGenerator","l":"vertices(int)"},{"p":"com.jgalgo.alg.path","c":"Path","l":"verticesIter(Graph, V, List)","url":"verticesIter(com.jgalgo.graph.Graph,V,java.util.List)"},{"p":"com.jgalgo.alg.path","c":"IPath","l":"verticesIter(IntGraph, int, IntList)","url":"verticesIter(com.jgalgo.graph.IntGraph,int,it.unimi.dsi.fastutil.ints.IntList)"},{"p":"com.jgalgo.graph","c":"IndexGraphBuilder.ReIndexedGraph","l":"verticesReIndexing"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"verticesWeights(String)","url":"verticesWeights(java.lang.String)"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"verticesWeights(String)","url":"verticesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"Graph","l":"verticesWeights(String)","url":"verticesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"verticesWeights(String)","url":"verticesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"IntGraph","l":"verticesWeights(String)","url":"verticesWeights(java.lang.String)"},{"p":"com.jgalgo.graph","c":"IntGraphBuilder","l":"verticesWeights(String)","url":"verticesWeights(java.lang.String)"},{"p":"com.jgalgo.adapt.guava","c":"GuavaNetworkWrapper","l":"verticesWeightsKeys()"},{"p":"com.jgalgo.adapt.jgrapht","c":"JGraphTWrapper","l":"verticesWeightsKeys()"},{"p":"com.jgalgo.graph","c":"Graph","l":"verticesWeightsKeys()"},{"p":"com.jgalgo.graph","c":"GraphBuilder","l":"verticesWeightsKeys()"},{"p":"com.jgalgo.gen","c":"UnionGraphGenerator","l":"verticesWeightsKeys(Set)","url":"verticesWeightsKeys(java.util.Set)"},{"p":"com.jgalgo.alg.connect","c":"WeaklyConnectedComponentsAlgoAbstract","l":"WeaklyConnectedComponentsAlgoAbstract()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.alg.connect","c":"WeaklyConnectedComponentsAlgoImpl","l":"WeaklyConnectedComponentsAlgoImpl()","url":"%3Cinit%3E()"},{"p":"com.jgalgo.graph","c":"IWeightFunction","l":"weight(int)"},{"p":"com.jgalgo.graph","c":"IWeightFunctionInt","l":"weight(int)"},{"p":"com.jgalgo.graph","c":"IWeightsDouble","l":"weight(int)"},{"p":"com.jgalgo.graph","c":"IWeightsFloat","l":"weight(int)"},{"p":"com.jgalgo.graph","c":"IWeightsLong","l":"weight(int)"},{"p":"com.jgalgo.graph","c":"IWeightFunction","l":"weight(Integer)","url":"weight(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightFunctionInt","l":"weight(Integer)","url":"weight(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsDouble","l":"weight(Integer)","url":"weight(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsFloat","l":"weight(Integer)","url":"weight(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsLong","l":"weight(Integer)","url":"weight(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"WeightFunction","l":"weight(K)"},{"p":"com.jgalgo.graph","c":"WeightFunctionInt","l":"weight(K)"},{"p":"com.jgalgo.graph","c":"WeightsDouble","l":"weight(K)"},{"p":"com.jgalgo.graph","c":"WeightsFloat","l":"weight(K)"},{"p":"com.jgalgo.graph","c":"WeightsLong","l":"weight(K)"},{"p":"com.jgalgo.graph","c":"IWeightFunctionInt","l":"weightInt(int)"},{"p":"com.jgalgo.graph","c":"IWeightsByte","l":"weightInt(int)"},{"p":"com.jgalgo.graph","c":"IWeightsInt","l":"weightInt(int)"},{"p":"com.jgalgo.graph","c":"IWeightsShort","l":"weightInt(int)"},{"p":"com.jgalgo.graph","c":"IWeightFunctionInt","l":"weightInt(Integer)","url":"weightInt(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsByte","l":"weightInt(Integer)","url":"weightInt(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsInt","l":"weightInt(Integer)","url":"weightInt(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"IWeightsShort","l":"weightInt(Integer)","url":"weightInt(java.lang.Integer)"},{"p":"com.jgalgo.graph","c":"WeightFunctionInt","l":"weightInt(K)"},{"p":"com.jgalgo.graph","c":"WeightsByte","l":"weightInt(K)"},{"p":"com.jgalgo.graph","c":"WeightsInt","l":"weightInt(K)"},{"p":"com.jgalgo.graph","c":"WeightsShort","l":"weightInt(K)"},{"p":"com.jgalgo.graph","c":"IWeightFunction","l":"weightSum(Iterable)","url":"weightSum(java.lang.Iterable)"},{"p":"com.jgalgo.graph","c":"IWeightFunctionInt","l":"weightSum(Iterable)","url":"weightSum(java.lang.Iterable)"},{"p":"com.jgalgo.graph","c":"WeightFunction","l":"weightSum(Iterable)","url":"weightSum(java.lang.Iterable)"},{"p":"com.jgalgo.graph","c":"WeightFunctionInt","l":"weightSum(Iterable)","url":"weightSum(java.lang.Iterable)"},{"p":"com.jgalgo.graph","c":"IWeightFunction","l":"weightSum(IWeightFunction, IntIterable)","url":"weightSum(com.jgalgo.graph.IWeightFunction,it.unimi.dsi.fastutil.ints.IntIterable)"},{"p":"com.jgalgo.graph","c":"WeightFunction","l":"weightSum(WeightFunction, Iterable)","url":"weightSum(com.jgalgo.graph.WeightFunction,java.lang.Iterable)"},{"p":"com.jgalgo.io","c":"GraphWriter","l":"writeGraph(Graph, File)","url":"writeGraph(com.jgalgo.graph.Graph,java.io.File)"},{"p":"com.jgalgo.io","c":"GraphWriter","l":"writeGraph(Graph, String)","url":"writeGraph(com.jgalgo.graph.Graph,java.lang.String)"},{"p":"com.jgalgo.io","c":"GraphWriter","l":"writeGraph(Graph, Writer)","url":"writeGraph(com.jgalgo.graph.Graph,java.io.Writer)"},{"p":"com.jgalgo.io","c":"DimacsGraphWriter","l":"writeGraphImpl(Graph, Writer)","url":"writeGraphImpl(com.jgalgo.graph.Graph,java.io.Writer)"},{"p":"com.jgalgo.io","c":"LedaGraphWriter","l":"writeGraphImpl(Graph, Writer)","url":"writeGraphImpl(com.jgalgo.graph.Graph,java.io.Writer)"},{"p":"com.jgalgo.io","c":"GmlGraphWriter","l":"writeGraphImpl(Graph, Writer)","url":"writeGraphImpl(com.jgalgo.graph.Graph,java.io.Writer)"}] \ No newline at end of file diff --git a/0.4.1-snapshot/member-search-index.zip b/0.4.1-snapshot/member-search-index.zip index ba2c70360e..80bbb92cb1 100644 Binary files a/0.4.1-snapshot/member-search-index.zip and b/0.4.1-snapshot/member-search-index.zip differ diff --git a/0.4.1-snapshot/overview-summary.html b/0.4.1-snapshot/overview-summary.html index 0c3106b5fe..6d8cd97e55 100644 --- a/0.4.1-snapshot/overview-summary.html +++ b/0.4.1-snapshot/overview-summary.html @@ -2,7 +2,7 @@ - + JGAlgo - Parent 0.4.1-SNAPSHOT API diff --git a/0.4.1-snapshot/overview-tree.html b/0.4.1-snapshot/overview-tree.html index bdbd5989b5..85d72c94ba 100644 --- a/0.4.1-snapshot/overview-tree.html +++ b/0.4.1-snapshot/overview-tree.html @@ -2,10 +2,10 @@ - + Class Hierarchy (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + @@ -180,6 +180,11 @@

    Class Hierarchy

  • com.jgalgo.alg.bipartite.BipartiteGraphs
  • +
  • com.jgalgo.alg.cycle.ChinesePostmanAbstract (implements com.jgalgo.alg.cycle.ChinesePostman) + +
  • com.jgalgo.alg.closure.ClosuresEnumeratorAbstract (implements com.jgalgo.alg.closure.ClosuresEnumerator)
  • com.jgalgo.alg.connect.MinimumEdgeCutSTAbstract (implements com.jgalgo.alg.connect.MinimumEdgeCutST)
  • +
  • com.jgalgo.alg.cycle.MinimumMeanCycleAbstract (implements com.jgalgo.alg.cycle.MinimumMeanCycle) + +
  • com.jgalgo.example.MinimumSpanningTreeExample
  • com.jgalgo.alg.connect.MinimumVertexCutAllGlobalAbstract (implements com.jgalgo.alg.connect.MinimumVertexCutAllGlobal)
      @@ -309,11 +342,21 @@

      Class Hierarchy

  • +
  • com.jgalgo.alg.dag.TopologicalOrderAlgoAbstract (implements com.jgalgo.alg.dag.TopologicalOrderAlgo) + +
  • com.jgalgo.alg.tree.Trees
  • com.jgalgo.alg.path.TspMetricMatchingAppx
  • com.jgalgo.alg.path.TspMetricMSTAppx
  • com.jgalgo.gen.UniformTreeGenerator<V,​E> (implements com.jgalgo.gen.GraphGenerator<V,​E>)
  • com.jgalgo.gen.UnionGraphGenerator<V,​E> (implements com.jgalgo.gen.GraphGenerator<V,​E>)
  • +
  • com.jgalgo.alg.cover.VertexCoverAbstract (implements com.jgalgo.alg.cover.VertexCover) + +
  • com.jgalgo.alg.connect.WeaklyConnectedComponentsAlgoAbstract (implements com.jgalgo.alg.connect.WeaklyConnectedComponentsAlgo)
    • com.jgalgo.alg.connect.WeaklyConnectedComponentsAlgoImpl
    • diff --git a/0.4.1-snapshot/package-search-index.zip b/0.4.1-snapshot/package-search-index.zip index 0f67673bbf..133bf80bb3 100644 Binary files a/0.4.1-snapshot/package-search-index.zip and b/0.4.1-snapshot/package-search-index.zip differ diff --git a/0.4.1-snapshot/serialized-form.html b/0.4.1-snapshot/serialized-form.html index 84b75c4dea..5e9ddb78c1 100644 --- a/0.4.1-snapshot/serialized-form.html +++ b/0.4.1-snapshot/serialized-form.html @@ -2,10 +2,10 @@ - + Serialized Form (JGAlgo - Parent 0.4.1-SNAPSHOT API) - + diff --git a/0.4.1-snapshot/type-search-index.js b/0.4.1-snapshot/type-search-index.js index 09a8a17acc..7c2f789636 100644 --- a/0.4.1-snapshot/type-search-index.js +++ b/0.4.1-snapshot/type-search-index.js @@ -1 +1 @@ -typeSearchIndex = [{"p":"com.jgalgo.graph","l":"AbstractGraph"},{"p":"com.jgalgo.alg","l":"AlgorithmBuilderBase"},{"l":"All Classes","url":"allclasses-index.html"},{"p":"com.jgalgo.gen","l":"BarabasiAlbertGraphGenerator"},{"p":"com.jgalgo.example","l":"BfsDfsExample"},{"p":"com.jgalgo.alg.traversal","l":"BfsIter"},{"p":"com.jgalgo.alg.connect","l":"BiConnectedComponentsAlgo"},{"p":"com.jgalgo.alg.connect","l":"BiConnectedComponentsAlgoAbstract"},{"p":"com.jgalgo.alg.connect","l":"BiConnectedComponentsAlgoHopcroftTarjan"},{"p":"com.jgalgo.alg.bipartite","l":"BipartiteGraphs"},{"p":"com.jgalgo.alg.clique","l":"MaximalCliquesEnumerator.Builder"},{"p":"com.jgalgo.alg.color","l":"ColoringAlgo.Builder"},{"p":"com.jgalgo.alg.connect","l":"StronglyConnectedComponentsAlgo.Builder"},{"p":"com.jgalgo.alg.cover","l":"EdgeCover.Builder"},{"p":"com.jgalgo.alg.cycle","l":"CyclesEnumerator.Builder"},{"p":"com.jgalgo.alg.cycle","l":"MinimumMeanCycle.Builder"},{"p":"com.jgalgo.alg.flow","l":"MaximumFlow.Builder"},{"p":"com.jgalgo.alg.flow","l":"MinimumCostFlow.Builder"},{"p":"com.jgalgo.alg.match","l":"MatchingAlgo.Builder"},{"p":"com.jgalgo.alg.path","l":"KShortestPathsST.Builder"},{"p":"com.jgalgo.alg.path","l":"ShortestPathAllPairs.Builder"},{"p":"com.jgalgo.alg.path","l":"ShortestPathHeuristicST.Builder"},{"p":"com.jgalgo.alg.path","l":"ShortestPathST.Builder"},{"p":"com.jgalgo.alg.path","l":"ShortestPathSingleSource.Builder"},{"p":"com.jgalgo.alg.span","l":"MinimumSpanningTree.Builder"},{"p":"com.jgalgo.alg.tree","l":"LowestCommonAncestorDynamic.Builder"},{"p":"com.jgalgo.alg.tree","l":"TreePathMaxima.Builder"},{"p":"com.jgalgo.alg.cycle","l":"ChinesePostman"},{"p":"com.jgalgo.alg.closure","l":"ClosuresEnumerator"},{"p":"com.jgalgo.alg.closure","l":"ClosuresEnumeratorAbstract"},{"p":"com.jgalgo.alg.closure","l":"ClosuresEnumeratorSchrageBaker"},{"p":"com.jgalgo.alg.color","l":"ColoringAlgo"},{"p":"com.jgalgo.alg.color","l":"ColoringAlgoAbstract"},{"p":"com.jgalgo.alg.color","l":"ColoringDSatur"},{"p":"com.jgalgo.example","l":"ColoringExample"},{"p":"com.jgalgo.alg.color","l":"ColoringGreedy"},{"p":"com.jgalgo.alg.color","l":"ColoringRecursiveLargestFirst"},{"p":"com.jgalgo.gen","l":"ComplementGraphGenerator"},{"p":"com.jgalgo.gen","l":"CompleteBipartiteGraphGenerator"},{"p":"com.jgalgo.gen","l":"CompleteGraphGenerator"},{"p":"com.jgalgo.alg.cores","l":"CoresAlgo"},{"p":"com.jgalgo.alg.cycle","l":"CyclesEnumerator"},{"p":"com.jgalgo.alg.tree","l":"LowestCommonAncestorStatic.DataStructure"},{"p":"com.jgalgo.alg.traversal","l":"DfsIter"},{"p":"com.jgalgo.gen","l":"DifferenceGraphGenerator"},{"p":"com.jgalgo.io","l":"Digraph6GraphReader"},{"p":"com.jgalgo.io","l":"Digraph6GraphWriter"},{"p":"com.jgalgo.io","l":"DimacsGraphReader"},{"p":"com.jgalgo.io","l":"DimacsGraphWriter"},{"p":"com.jgalgo.alg.distancemeasures","l":"DistanceMeasures"},{"p":"com.jgalgo.alg.cover","l":"DominatingSetAlgo"},{"p":"com.jgalgo.alg.cover","l":"EdgeCover"},{"p":"com.jgalgo.alg","l":"EdgeDirection"},{"p":"com.jgalgo.graph","l":"EdgeIter"},{"p":"com.jgalgo.example","l":"EdgeIterationExample"},{"p":"com.jgalgo.graph","l":"EdgeSet"},{"p":"com.jgalgo.gen","l":"EmptyGraphGenerator"},{"p":"com.jgalgo.alg.euler","l":"EulerianTourAlgo"},{"p":"com.jgalgo.alg.flow","l":"Flow"},{"p":"com.jgalgo.io","l":"GexfGraphReader"},{"p":"com.jgalgo.io","l":"GexfGraphWriter"},{"p":"com.jgalgo.io","l":"GmlGraphReader"},{"p":"com.jgalgo.io","l":"GmlGraphWriter"},{"p":"com.jgalgo.gen","l":"GnmBipartiteGraphGenerator"},{"p":"com.jgalgo.gen","l":"GnmGraphGenerator"},{"p":"com.jgalgo.gen","l":"GnpBipartiteGraphGenerator"},{"p":"com.jgalgo.gen","l":"GnpGraphGenerator"},{"p":"com.jgalgo.graph","l":"Graph"},{"p":"com.jgalgo.io","l":"Graph6GraphReader"},{"p":"com.jgalgo.io","l":"Graph6GraphWriter"},{"p":"com.jgalgo.graph","l":"GraphBuilder"},{"p":"com.jgalgo.graph","l":"GraphFactory"},{"p":"com.jgalgo.gen","l":"GraphGenerator"},{"p":"com.jgalgo.io","l":"GraphMlGraphReader"},{"p":"com.jgalgo.io","l":"GraphMlGraphWriter"},{"p":"com.jgalgo.io","l":"GraphReader"},{"p":"com.jgalgo.graph","l":"Graphs"},{"p":"com.jgalgo.io","l":"GraphWriter"},{"p":"com.jgalgo.adapt.guava","l":"GuavaGraphAdapter"},{"p":"com.jgalgo.adapt.guava","l":"GuavaMutableGraphAdapter"},{"p":"com.jgalgo.adapt.guava","l":"GuavaMutableNetworkAdapter"},{"p":"com.jgalgo.adapt.guava","l":"GuavaMutableValueGraphAdapter"},{"p":"com.jgalgo.adapt.guava","l":"GuavaNetworkAdapter"},{"p":"com.jgalgo.adapt.guava","l":"GuavaNetworkWrapper"},{"p":"com.jgalgo.adapt.guava","l":"GuavaValueGraphAdapter"},{"p":"com.jgalgo.alg.hamilton","l":"HamiltonianPathAlgo"},{"p":"com.jgalgo.graph","l":"GraphFactory.Hint"},{"p":"com.jgalgo.alg.tree","l":"LowestCommonAncestorStatic.IDataStructure"},{"p":"com.jgalgo.graph","l":"IdBuilder"},{"p":"com.jgalgo.graph","l":"IdBuilderInt"},{"p":"com.jgalgo.alg.distancemeasures","l":"IDistanceMeasures"},{"p":"com.jgalgo.graph","l":"IEdgeIter"},{"p":"com.jgalgo.graph","l":"IEdgeSet"},{"p":"com.jgalgo.alg.flow","l":"IFlow"},{"p":"com.jgalgo.alg.match","l":"IMatching"},{"p":"com.jgalgo.graph","l":"IndexGraph"},{"p":"com.jgalgo.graph","l":"IndexGraphBuilder"},{"p":"com.jgalgo.graph","l":"IndexGraphFactory"},{"p":"com.jgalgo.graph","l":"IndexIdMap"},{"p":"com.jgalgo.graph","l":"IndexIdMaps"},{"p":"com.jgalgo.graph","l":"IndexIntIdMap"},{"p":"com.jgalgo.graph","l":"IndexRemoveListener"},{"p":"com.jgalgo.alg.traversal","l":"BfsIter.Int"},{"p":"com.jgalgo.alg.traversal","l":"DfsIter.Int"},{"p":"com.jgalgo.alg.traversal","l":"RandomWalkIter.Int"},{"p":"com.jgalgo.gen","l":"IntersectionGraphGenerator"},{"p":"com.jgalgo.graph","l":"IntGraph"},{"p":"com.jgalgo.graph","l":"IntGraphBuilder"},{"p":"com.jgalgo.graph","l":"IntGraphFactory"},{"p":"com.jgalgo.alg.path","l":"IPath"},{"p":"com.jgalgo.alg.tree","l":"LowestCommonAncestorOffline.IQueries"},{"p":"com.jgalgo.alg.tree","l":"TreePathMaxima.IQueries"},{"p":"com.jgalgo.alg.connect","l":"BiConnectedComponentsAlgo.IResult"},{"p":"com.jgalgo.alg.cores","l":"CoresAlgo.IResult"},{"p":"com.jgalgo.alg.dag","l":"TopologicalOrderAlgo.IResult"},{"p":"com.jgalgo.alg.path","l":"ShortestPathAllPairs.IResult"},{"p":"com.jgalgo.alg.path","l":"ShortestPathSingleSource.IResult"},{"p":"com.jgalgo.alg.path","l":"VoronoiAlgo.IResult"},{"p":"com.jgalgo.alg.span","l":"MinimumSpanningTree.IResult"},{"p":"com.jgalgo.alg.span","l":"SteinerTreeAlgo.IResult"},{"p":"com.jgalgo.alg.tree","l":"LowestCommonAncestorOffline.IResult"},{"p":"com.jgalgo.alg.tree","l":"TreePathMaxima.IResult"},{"p":"com.jgalgo.alg.isomorphism","l":"IsomorphismIMapping"},{"p":"com.jgalgo.alg.isomorphism","l":"IsomorphismMapping"},{"p":"com.jgalgo.alg.isomorphism","l":"IsomorphismTester"},{"p":"com.jgalgo.alg","l":"IVertexBiPartition"},{"p":"com.jgalgo.alg","l":"IVertexPartition"},{"p":"com.jgalgo.graph","l":"IWeightFunction"},{"p":"com.jgalgo.graph","l":"IWeightFunctionInt"},{"p":"com.jgalgo.graph","l":"IWeights"},{"p":"com.jgalgo.graph","l":"IWeightsBool"},{"p":"com.jgalgo.graph","l":"IWeightsByte"},{"p":"com.jgalgo.graph","l":"IWeightsChar"},{"p":"com.jgalgo.graph","l":"IWeightsDouble"},{"p":"com.jgalgo.graph","l":"IWeightsFloat"},{"p":"com.jgalgo.graph","l":"IWeightsInt"},{"p":"com.jgalgo.graph","l":"IWeightsLong"},{"p":"com.jgalgo.graph","l":"IWeightsObj"},{"p":"com.jgalgo.graph","l":"IWeightsShort"},{"p":"com.jgalgo","l":"JGAlgoConfig"},{"p":"com.jgalgo.adapt.jgrapht","l":"JGraphTAdapter"},{"p":"com.jgalgo.adapt.jgrapht","l":"JGraphTWrapper"},{"p":"com.jgalgo.alg.connect","l":"KEdgeConnectedComponentsAlgo"},{"p":"com.jgalgo.alg.connect","l":"KEdgeConnectedComponentsAlgoAbstract"},{"p":"com.jgalgo.alg.connect","l":"KEdgeConnectedComponentsWang"},{"p":"com.jgalgo.alg.path","l":"KShortestPathsST"},{"p":"com.jgalgo.alg.connect","l":"KVertexConnectedComponentsAlgo"},{"p":"com.jgalgo.alg.connect","l":"KVertexConnectedComponentsAlgoAbstract"},{"p":"com.jgalgo.alg.connect","l":"KVertexConnectedComponentsWhiteMoody"},{"p":"com.jgalgo.io","l":"LedaGraphReader"},{"p":"com.jgalgo.io","l":"LedaGraphWriter"},{"p":"com.jgalgo.gen","l":"LineGraphGenerator"},{"p":"com.jgalgo.alg.tree","l":"LowestCommonAncestorDynamic"},{"p":"com.jgalgo.example","l":"LowestCommonAncestorExample"},{"p":"com.jgalgo.alg.tree","l":"LowestCommonAncestorOffline"},{"p":"com.jgalgo.alg.tree","l":"LowestCommonAncestorStatic"},{"p":"com.jgalgo.alg.match","l":"Matching"},{"p":"com.jgalgo.alg.match","l":"MatchingAlgo"},{"p":"com.jgalgo.alg.clique","l":"MaximalCliquesEnumerator"},{"p":"com.jgalgo.alg.clique","l":"MaximalCliquesEnumeratorAbstract"},{"p":"com.jgalgo.alg.clique","l":"MaximalCliquesEnumeratorBronKerbosch"},{"p":"com.jgalgo.alg.clique","l":"MaximalCliquesEnumeratorBronKerboschPivot"},{"p":"com.jgalgo.alg.clique","l":"MaximalIndependentSetsEnumerator"},{"p":"com.jgalgo.alg.clique","l":"MaximalIndependentSetsEnumeratorAbstract"},{"p":"com.jgalgo.alg.clique","l":"MaximalIndependentSetsEnumeratorComplementCliques"},{"p":"com.jgalgo.alg.flow","l":"MaximumFlow"},{"p":"com.jgalgo.example","l":"MaximumMatchingExample"},{"p":"com.jgalgo.alg.flow","l":"MinimumCostFlow"},{"p":"com.jgalgo.alg.span","l":"MinimumDirectedSpanningTree"},{"p":"com.jgalgo.alg.connect","l":"MinimumEdgeCutAllST"},{"p":"com.jgalgo.alg.connect","l":"MinimumEdgeCutAllSTAbstract"},{"p":"com.jgalgo.alg.connect","l":"MinimumEdgeCutAllSTPicardQueyranne"},{"p":"com.jgalgo.alg.connect","l":"MinimumEdgeCutGlobal"},{"p":"com.jgalgo.alg.connect","l":"MinimumEdgeCutGlobalAbstract"},{"p":"com.jgalgo.alg.connect","l":"MinimumEdgeCutGlobalStoerWagner"},{"p":"com.jgalgo.alg.connect","l":"MinimumEdgeCutST"},{"p":"com.jgalgo.alg.connect","l":"MinimumEdgeCutSTAbstract"},{"p":"com.jgalgo.alg.cycle","l":"MinimumMeanCycle"},{"p":"com.jgalgo.alg.span","l":"MinimumSpanningTree"},{"p":"com.jgalgo.example","l":"MinimumSpanningTreeExample"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutAllGlobal"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutAllGlobalAbstract"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutAllGlobalKanevsky"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutAllST"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutAllSTAbstract"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutAllSTEdgeCut"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutGlobal"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutGlobalAbstract"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutGlobalEsfahanianHakimi"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutST"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutSTAbstract"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutSTEdgeCut"},{"p":"com.jgalgo.alg.path","l":"NegativeCycleException"},{"p":"com.jgalgo.graph","l":"NoSuchEdgeException"},{"p":"com.jgalgo.graph","l":"NoSuchVertexException"},{"p":"com.jgalgo.alg.path","l":"Path"},{"p":"com.jgalgo.alg.tree","l":"LowestCommonAncestorOffline.Queries"},{"p":"com.jgalgo.alg.tree","l":"TreePathMaxima.Queries"},{"p":"com.jgalgo.alg","l":"RandomizedAlgorithm"},{"p":"com.jgalgo.alg.traversal","l":"RandomWalkIter"},{"p":"com.jgalgo.gen","l":"RecursiveMatrixGraphGenerator"},{"p":"com.jgalgo.graph","l":"IndexGraphBuilder.ReIndexedGraph"},{"p":"com.jgalgo.graph","l":"IndexGraphBuilder.ReIndexingMap"},{"p":"com.jgalgo.alg.connect","l":"BiConnectedComponentsAlgo.Result"},{"p":"com.jgalgo.alg.cores","l":"CoresAlgo.Result"},{"p":"com.jgalgo.alg.dag","l":"TopologicalOrderAlgo.Result"},{"p":"com.jgalgo.alg.path","l":"ShortestPathAllPairs.Result"},{"p":"com.jgalgo.alg.path","l":"ShortestPathSingleSource.Result"},{"p":"com.jgalgo.alg.path","l":"VoronoiAlgo.Result"},{"p":"com.jgalgo.alg.span","l":"MinimumSpanningTree.Result"},{"p":"com.jgalgo.alg.span","l":"SteinerTreeAlgo.Result"},{"p":"com.jgalgo.alg.tree","l":"LowestCommonAncestorOffline.Result"},{"p":"com.jgalgo.alg.tree","l":"TreePathMaxima.Result"},{"p":"com.jgalgo.alg.path","l":"ShortestPathAllPairs"},{"p":"com.jgalgo.example","l":"ShortestPathExample"},{"p":"com.jgalgo.alg.path","l":"ShortestPathHeuristicST"},{"p":"com.jgalgo.alg.path","l":"ShortestPathSingleSource"},{"p":"com.jgalgo.alg.path","l":"ShortestPathST"},{"p":"com.jgalgo.alg.path","l":"SimplePathsEnumerator"},{"p":"com.jgalgo.io","l":"Sparse6GraphReader"},{"p":"com.jgalgo.io","l":"Sparse6GraphWriter"},{"p":"com.jgalgo.alg.span","l":"SteinerTreeAlgo"},{"p":"com.jgalgo.alg.connect","l":"StronglyConnectedComponentsAlgo"},{"p":"com.jgalgo.alg.connect","l":"StronglyConnectedComponentsAlgoAbstract"},{"p":"com.jgalgo.alg.connect","l":"StronglyConnectedComponentsPathBasedDfs"},{"p":"com.jgalgo.alg.connect","l":"StronglyConnectedComponentsTarjan"},{"p":"com.jgalgo.gen","l":"SymmetricDifferenceGraphGenerator"},{"p":"com.jgalgo.alg.dag","l":"TopologicalOrderAlgo"},{"p":"com.jgalgo.alg.tree","l":"TreePathMaxima"},{"p":"com.jgalgo.alg.tree","l":"Trees"},{"p":"com.jgalgo.alg.path","l":"TspMetric"},{"p":"com.jgalgo.alg.path","l":"TspMetricMatchingAppx"},{"p":"com.jgalgo.alg.path","l":"TspMetricMSTAppx"},{"p":"com.jgalgo.gen","l":"UniformTreeGenerator"},{"p":"com.jgalgo.gen","l":"UnionGraphGenerator"},{"p":"com.jgalgo.alg.tree","l":"LowestCommonAncestorDynamic.Vertex"},{"p":"com.jgalgo.alg","l":"VertexBiPartition"},{"p":"com.jgalgo.alg.cover","l":"VertexCover"},{"p":"com.jgalgo.alg","l":"VertexPartition"},{"p":"com.jgalgo.alg.path","l":"VoronoiAlgo"},{"p":"com.jgalgo.alg.connect","l":"WeaklyConnectedComponentsAlgo"},{"p":"com.jgalgo.alg.connect","l":"WeaklyConnectedComponentsAlgoAbstract"},{"p":"com.jgalgo.alg.connect","l":"WeaklyConnectedComponentsAlgoImpl"},{"p":"com.jgalgo.graph","l":"WeightFunction"},{"p":"com.jgalgo.graph","l":"WeightFunctionInt"},{"p":"com.jgalgo.graph","l":"WeightFunctions"},{"p":"com.jgalgo.graph","l":"Weights"},{"p":"com.jgalgo.graph","l":"WeightsBool"},{"p":"com.jgalgo.graph","l":"WeightsByte"},{"p":"com.jgalgo.graph","l":"WeightsChar"},{"p":"com.jgalgo.graph","l":"WeightsDouble"},{"p":"com.jgalgo.graph","l":"WeightsFloat"},{"p":"com.jgalgo.graph","l":"WeightsInt"},{"p":"com.jgalgo.graph","l":"WeightsLong"},{"p":"com.jgalgo.graph","l":"WeightsObj"},{"p":"com.jgalgo.graph","l":"WeightsShort"}] \ No newline at end of file +typeSearchIndex = [{"p":"com.jgalgo.graph","l":"AbstractGraph"},{"p":"com.jgalgo.alg","l":"AlgorithmBuilderBase"},{"l":"All Classes","url":"allclasses-index.html"},{"p":"com.jgalgo.gen","l":"BarabasiAlbertGraphGenerator"},{"p":"com.jgalgo.example","l":"BfsDfsExample"},{"p":"com.jgalgo.alg.traversal","l":"BfsIter"},{"p":"com.jgalgo.alg.connect","l":"BiConnectedComponentsAlgo"},{"p":"com.jgalgo.alg.connect","l":"BiConnectedComponentsAlgoAbstract"},{"p":"com.jgalgo.alg.connect","l":"BiConnectedComponentsAlgoHopcroftTarjan"},{"p":"com.jgalgo.alg.bipartite","l":"BipartiteGraphs"},{"p":"com.jgalgo.alg.clique","l":"MaximalCliquesEnumerator.Builder"},{"p":"com.jgalgo.alg.color","l":"ColoringAlgo.Builder"},{"p":"com.jgalgo.alg.connect","l":"StronglyConnectedComponentsAlgo.Builder"},{"p":"com.jgalgo.alg.cover","l":"EdgeCover.Builder"},{"p":"com.jgalgo.alg.cycle","l":"CyclesEnumerator.Builder"},{"p":"com.jgalgo.alg.cycle","l":"MinimumMeanCycle.Builder"},{"p":"com.jgalgo.alg.flow","l":"MaximumFlow.Builder"},{"p":"com.jgalgo.alg.flow","l":"MinimumCostFlow.Builder"},{"p":"com.jgalgo.alg.match","l":"MatchingAlgo.Builder"},{"p":"com.jgalgo.alg.path","l":"KShortestPathsST.Builder"},{"p":"com.jgalgo.alg.path","l":"ShortestPathAllPairs.Builder"},{"p":"com.jgalgo.alg.path","l":"ShortestPathHeuristicST.Builder"},{"p":"com.jgalgo.alg.path","l":"ShortestPathST.Builder"},{"p":"com.jgalgo.alg.path","l":"ShortestPathSingleSource.Builder"},{"p":"com.jgalgo.alg.span","l":"MinimumSpanningTree.Builder"},{"p":"com.jgalgo.alg.tree","l":"LowestCommonAncestorDynamic.Builder"},{"p":"com.jgalgo.alg.tree","l":"TreePathMaxima.Builder"},{"p":"com.jgalgo.alg.cycle","l":"ChinesePostman"},{"p":"com.jgalgo.alg.cycle","l":"ChinesePostmanAbstract"},{"p":"com.jgalgo.alg.cycle","l":"ChinesePostmanImpl"},{"p":"com.jgalgo.alg.closure","l":"ClosuresEnumerator"},{"p":"com.jgalgo.alg.closure","l":"ClosuresEnumeratorAbstract"},{"p":"com.jgalgo.alg.closure","l":"ClosuresEnumeratorSchrageBaker"},{"p":"com.jgalgo.alg.color","l":"ColoringAlgo"},{"p":"com.jgalgo.alg.color","l":"ColoringAlgoAbstract"},{"p":"com.jgalgo.alg.color","l":"ColoringDSatur"},{"p":"com.jgalgo.example","l":"ColoringExample"},{"p":"com.jgalgo.alg.color","l":"ColoringGreedy"},{"p":"com.jgalgo.alg.color","l":"ColoringRecursiveLargestFirst"},{"p":"com.jgalgo.gen","l":"ComplementGraphGenerator"},{"p":"com.jgalgo.gen","l":"CompleteBipartiteGraphGenerator"},{"p":"com.jgalgo.gen","l":"CompleteGraphGenerator"},{"p":"com.jgalgo.alg.cores","l":"CoresAlgo"},{"p":"com.jgalgo.alg.cores","l":"CoresAlgoAbstract"},{"p":"com.jgalgo.alg.cores","l":"CoresAlgoImpl"},{"p":"com.jgalgo.alg.cycle","l":"CyclesEnumerator"},{"p":"com.jgalgo.alg.cycle","l":"CyclesEnumeratorAbstract"},{"p":"com.jgalgo.alg.cycle","l":"CyclesEnumeratorJohnson"},{"p":"com.jgalgo.alg.cycle","l":"CyclesEnumeratorTarjan"},{"p":"com.jgalgo.alg.tree","l":"LowestCommonAncestorStatic.DataStructure"},{"p":"com.jgalgo.alg.traversal","l":"DfsIter"},{"p":"com.jgalgo.gen","l":"DifferenceGraphGenerator"},{"p":"com.jgalgo.io","l":"Digraph6GraphReader"},{"p":"com.jgalgo.io","l":"Digraph6GraphWriter"},{"p":"com.jgalgo.io","l":"DimacsGraphReader"},{"p":"com.jgalgo.io","l":"DimacsGraphWriter"},{"p":"com.jgalgo.alg.distancemeasures","l":"DistanceMeasures"},{"p":"com.jgalgo.alg.cover","l":"DominatingSetAlgo"},{"p":"com.jgalgo.alg.cover","l":"DominatingSetAlgoAbstract"},{"p":"com.jgalgo.alg.cover","l":"DominatingSetAlgoGreedy"},{"p":"com.jgalgo.alg.cover","l":"EdgeCover"},{"p":"com.jgalgo.alg.cover","l":"EdgeCoverAbstract"},{"p":"com.jgalgo.alg.cover","l":"EdgeCoverCardinality"},{"p":"com.jgalgo.alg.cover","l":"EdgeCoverWeighted"},{"p":"com.jgalgo.alg","l":"EdgeDirection"},{"p":"com.jgalgo.graph","l":"EdgeIter"},{"p":"com.jgalgo.example","l":"EdgeIterationExample"},{"p":"com.jgalgo.graph","l":"EdgeSet"},{"p":"com.jgalgo.gen","l":"EmptyGraphGenerator"},{"p":"com.jgalgo.alg.euler","l":"EulerianTourAlgo"},{"p":"com.jgalgo.alg.flow","l":"Flow"},{"p":"com.jgalgo.io","l":"GexfGraphReader"},{"p":"com.jgalgo.io","l":"GexfGraphWriter"},{"p":"com.jgalgo.io","l":"GmlGraphReader"},{"p":"com.jgalgo.io","l":"GmlGraphWriter"},{"p":"com.jgalgo.gen","l":"GnmBipartiteGraphGenerator"},{"p":"com.jgalgo.gen","l":"GnmGraphGenerator"},{"p":"com.jgalgo.gen","l":"GnpBipartiteGraphGenerator"},{"p":"com.jgalgo.gen","l":"GnpGraphGenerator"},{"p":"com.jgalgo.graph","l":"Graph"},{"p":"com.jgalgo.io","l":"Graph6GraphReader"},{"p":"com.jgalgo.io","l":"Graph6GraphWriter"},{"p":"com.jgalgo.graph","l":"GraphBuilder"},{"p":"com.jgalgo.graph","l":"GraphFactory"},{"p":"com.jgalgo.gen","l":"GraphGenerator"},{"p":"com.jgalgo.io","l":"GraphMlGraphReader"},{"p":"com.jgalgo.io","l":"GraphMlGraphWriter"},{"p":"com.jgalgo.io","l":"GraphReader"},{"p":"com.jgalgo.graph","l":"Graphs"},{"p":"com.jgalgo.io","l":"GraphWriter"},{"p":"com.jgalgo.adapt.guava","l":"GuavaGraphAdapter"},{"p":"com.jgalgo.adapt.guava","l":"GuavaMutableGraphAdapter"},{"p":"com.jgalgo.adapt.guava","l":"GuavaMutableNetworkAdapter"},{"p":"com.jgalgo.adapt.guava","l":"GuavaMutableValueGraphAdapter"},{"p":"com.jgalgo.adapt.guava","l":"GuavaNetworkAdapter"},{"p":"com.jgalgo.adapt.guava","l":"GuavaNetworkWrapper"},{"p":"com.jgalgo.adapt.guava","l":"GuavaValueGraphAdapter"},{"p":"com.jgalgo.alg.hamilton","l":"HamiltonianPathAlgo"},{"p":"com.jgalgo.graph","l":"GraphFactory.Hint"},{"p":"com.jgalgo.alg.tree","l":"LowestCommonAncestorStatic.IDataStructure"},{"p":"com.jgalgo.graph","l":"IdBuilder"},{"p":"com.jgalgo.graph","l":"IdBuilderInt"},{"p":"com.jgalgo.alg.distancemeasures","l":"IDistanceMeasures"},{"p":"com.jgalgo.graph","l":"IEdgeIter"},{"p":"com.jgalgo.graph","l":"IEdgeSet"},{"p":"com.jgalgo.alg.flow","l":"IFlow"},{"p":"com.jgalgo.alg.match","l":"IMatching"},{"p":"com.jgalgo.graph","l":"IndexGraph"},{"p":"com.jgalgo.graph","l":"IndexGraphBuilder"},{"p":"com.jgalgo.graph","l":"IndexGraphFactory"},{"p":"com.jgalgo.graph","l":"IndexIdMap"},{"p":"com.jgalgo.graph","l":"IndexIdMaps"},{"p":"com.jgalgo.graph","l":"IndexIntIdMap"},{"p":"com.jgalgo.graph","l":"IndexRemoveListener"},{"p":"com.jgalgo.alg.traversal","l":"BfsIter.Int"},{"p":"com.jgalgo.alg.traversal","l":"DfsIter.Int"},{"p":"com.jgalgo.alg.traversal","l":"RandomWalkIter.Int"},{"p":"com.jgalgo.gen","l":"IntersectionGraphGenerator"},{"p":"com.jgalgo.graph","l":"IntGraph"},{"p":"com.jgalgo.graph","l":"IntGraphBuilder"},{"p":"com.jgalgo.graph","l":"IntGraphFactory"},{"p":"com.jgalgo.alg.path","l":"IPath"},{"p":"com.jgalgo.alg.tree","l":"LowestCommonAncestorOffline.IQueries"},{"p":"com.jgalgo.alg.tree","l":"TreePathMaxima.IQueries"},{"p":"com.jgalgo.alg.connect","l":"BiConnectedComponentsAlgo.IResult"},{"p":"com.jgalgo.alg.cores","l":"CoresAlgo.IResult"},{"p":"com.jgalgo.alg.dag","l":"TopologicalOrderAlgo.IResult"},{"p":"com.jgalgo.alg.path","l":"ShortestPathAllPairs.IResult"},{"p":"com.jgalgo.alg.path","l":"ShortestPathSingleSource.IResult"},{"p":"com.jgalgo.alg.path","l":"VoronoiAlgo.IResult"},{"p":"com.jgalgo.alg.span","l":"MinimumSpanningTree.IResult"},{"p":"com.jgalgo.alg.span","l":"SteinerTreeAlgo.IResult"},{"p":"com.jgalgo.alg.tree","l":"LowestCommonAncestorOffline.IResult"},{"p":"com.jgalgo.alg.tree","l":"TreePathMaxima.IResult"},{"p":"com.jgalgo.alg.isomorphism","l":"IsomorphismIMapping"},{"p":"com.jgalgo.alg.isomorphism","l":"IsomorphismMapping"},{"p":"com.jgalgo.alg.isomorphism","l":"IsomorphismTester"},{"p":"com.jgalgo.alg","l":"IVertexBiPartition"},{"p":"com.jgalgo.alg","l":"IVertexPartition"},{"p":"com.jgalgo.graph","l":"IWeightFunction"},{"p":"com.jgalgo.graph","l":"IWeightFunctionInt"},{"p":"com.jgalgo.graph","l":"IWeights"},{"p":"com.jgalgo.graph","l":"IWeightsBool"},{"p":"com.jgalgo.graph","l":"IWeightsByte"},{"p":"com.jgalgo.graph","l":"IWeightsChar"},{"p":"com.jgalgo.graph","l":"IWeightsDouble"},{"p":"com.jgalgo.graph","l":"IWeightsFloat"},{"p":"com.jgalgo.graph","l":"IWeightsInt"},{"p":"com.jgalgo.graph","l":"IWeightsLong"},{"p":"com.jgalgo.graph","l":"IWeightsObj"},{"p":"com.jgalgo.graph","l":"IWeightsShort"},{"p":"com.jgalgo","l":"JGAlgoConfig"},{"p":"com.jgalgo.adapt.jgrapht","l":"JGraphTAdapter"},{"p":"com.jgalgo.adapt.jgrapht","l":"JGraphTWrapper"},{"p":"com.jgalgo.alg.connect","l":"KEdgeConnectedComponentsAlgo"},{"p":"com.jgalgo.alg.connect","l":"KEdgeConnectedComponentsAlgoAbstract"},{"p":"com.jgalgo.alg.connect","l":"KEdgeConnectedComponentsWang"},{"p":"com.jgalgo.alg.path","l":"KShortestPathsST"},{"p":"com.jgalgo.alg.connect","l":"KVertexConnectedComponentsAlgo"},{"p":"com.jgalgo.alg.connect","l":"KVertexConnectedComponentsAlgoAbstract"},{"p":"com.jgalgo.alg.connect","l":"KVertexConnectedComponentsWhiteMoody"},{"p":"com.jgalgo.io","l":"LedaGraphReader"},{"p":"com.jgalgo.io","l":"LedaGraphWriter"},{"p":"com.jgalgo.gen","l":"LineGraphGenerator"},{"p":"com.jgalgo.alg.tree","l":"LowestCommonAncestorDynamic"},{"p":"com.jgalgo.example","l":"LowestCommonAncestorExample"},{"p":"com.jgalgo.alg.tree","l":"LowestCommonAncestorOffline"},{"p":"com.jgalgo.alg.tree","l":"LowestCommonAncestorStatic"},{"p":"com.jgalgo.alg.match","l":"Matching"},{"p":"com.jgalgo.alg.match","l":"MatchingAlgo"},{"p":"com.jgalgo.alg.clique","l":"MaximalCliquesEnumerator"},{"p":"com.jgalgo.alg.clique","l":"MaximalCliquesEnumeratorAbstract"},{"p":"com.jgalgo.alg.clique","l":"MaximalCliquesEnumeratorBronKerbosch"},{"p":"com.jgalgo.alg.clique","l":"MaximalCliquesEnumeratorBronKerboschPivot"},{"p":"com.jgalgo.alg.clique","l":"MaximalIndependentSetsEnumerator"},{"p":"com.jgalgo.alg.clique","l":"MaximalIndependentSetsEnumeratorAbstract"},{"p":"com.jgalgo.alg.clique","l":"MaximalIndependentSetsEnumeratorComplementCliques"},{"p":"com.jgalgo.alg.flow","l":"MaximumFlow"},{"p":"com.jgalgo.example","l":"MaximumMatchingExample"},{"p":"com.jgalgo.alg.flow","l":"MinimumCostFlow"},{"p":"com.jgalgo.alg.span","l":"MinimumDirectedSpanningTree"},{"p":"com.jgalgo.alg.connect","l":"MinimumEdgeCutAllST"},{"p":"com.jgalgo.alg.connect","l":"MinimumEdgeCutAllSTAbstract"},{"p":"com.jgalgo.alg.connect","l":"MinimumEdgeCutAllSTPicardQueyranne"},{"p":"com.jgalgo.alg.connect","l":"MinimumEdgeCutGlobal"},{"p":"com.jgalgo.alg.connect","l":"MinimumEdgeCutGlobalAbstract"},{"p":"com.jgalgo.alg.connect","l":"MinimumEdgeCutGlobalStoerWagner"},{"p":"com.jgalgo.alg.connect","l":"MinimumEdgeCutST"},{"p":"com.jgalgo.alg.connect","l":"MinimumEdgeCutSTAbstract"},{"p":"com.jgalgo.alg.cycle","l":"MinimumMeanCycle"},{"p":"com.jgalgo.alg.cycle","l":"MinimumMeanCycleAbstract"},{"p":"com.jgalgo.alg.cycle","l":"MinimumMeanCycleDasdanGupta"},{"p":"com.jgalgo.alg.cycle","l":"MinimumMeanCycleHoward"},{"p":"com.jgalgo.alg.span","l":"MinimumSpanningTree"},{"p":"com.jgalgo.example","l":"MinimumSpanningTreeExample"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutAllGlobal"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutAllGlobalAbstract"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutAllGlobalKanevsky"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutAllST"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutAllSTAbstract"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutAllSTEdgeCut"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutGlobal"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutGlobalAbstract"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutGlobalEsfahanianHakimi"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutST"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutSTAbstract"},{"p":"com.jgalgo.alg.connect","l":"MinimumVertexCutSTEdgeCut"},{"p":"com.jgalgo.alg.path","l":"NegativeCycleException"},{"p":"com.jgalgo.graph","l":"NoSuchEdgeException"},{"p":"com.jgalgo.graph","l":"NoSuchVertexException"},{"p":"com.jgalgo.alg.path","l":"Path"},{"p":"com.jgalgo.alg.tree","l":"LowestCommonAncestorOffline.Queries"},{"p":"com.jgalgo.alg.tree","l":"TreePathMaxima.Queries"},{"p":"com.jgalgo.alg","l":"RandomizedAlgorithm"},{"p":"com.jgalgo.alg.traversal","l":"RandomWalkIter"},{"p":"com.jgalgo.gen","l":"RecursiveMatrixGraphGenerator"},{"p":"com.jgalgo.graph","l":"IndexGraphBuilder.ReIndexedGraph"},{"p":"com.jgalgo.graph","l":"IndexGraphBuilder.ReIndexingMap"},{"p":"com.jgalgo.alg.connect","l":"BiConnectedComponentsAlgo.Result"},{"p":"com.jgalgo.alg.cores","l":"CoresAlgo.Result"},{"p":"com.jgalgo.alg.dag","l":"TopologicalOrderAlgo.Result"},{"p":"com.jgalgo.alg.path","l":"ShortestPathAllPairs.Result"},{"p":"com.jgalgo.alg.path","l":"ShortestPathSingleSource.Result"},{"p":"com.jgalgo.alg.path","l":"VoronoiAlgo.Result"},{"p":"com.jgalgo.alg.span","l":"MinimumSpanningTree.Result"},{"p":"com.jgalgo.alg.span","l":"SteinerTreeAlgo.Result"},{"p":"com.jgalgo.alg.tree","l":"LowestCommonAncestorOffline.Result"},{"p":"com.jgalgo.alg.tree","l":"TreePathMaxima.Result"},{"p":"com.jgalgo.alg.path","l":"ShortestPathAllPairs"},{"p":"com.jgalgo.example","l":"ShortestPathExample"},{"p":"com.jgalgo.alg.path","l":"ShortestPathHeuristicST"},{"p":"com.jgalgo.alg.path","l":"ShortestPathSingleSource"},{"p":"com.jgalgo.alg.path","l":"ShortestPathST"},{"p":"com.jgalgo.alg.path","l":"SimplePathsEnumerator"},{"p":"com.jgalgo.io","l":"Sparse6GraphReader"},{"p":"com.jgalgo.io","l":"Sparse6GraphWriter"},{"p":"com.jgalgo.alg.span","l":"SteinerTreeAlgo"},{"p":"com.jgalgo.alg.connect","l":"StronglyConnectedComponentsAlgo"},{"p":"com.jgalgo.alg.connect","l":"StronglyConnectedComponentsAlgoAbstract"},{"p":"com.jgalgo.alg.connect","l":"StronglyConnectedComponentsPathBasedDfs"},{"p":"com.jgalgo.alg.connect","l":"StronglyConnectedComponentsTarjan"},{"p":"com.jgalgo.gen","l":"SymmetricDifferenceGraphGenerator"},{"p":"com.jgalgo.alg.dag","l":"TopologicalOrderAlgo"},{"p":"com.jgalgo.alg.dag","l":"TopologicalOrderAlgoAbstract"},{"p":"com.jgalgo.alg.dag","l":"TopologicalOrderAlgoImpl"},{"p":"com.jgalgo.alg.tree","l":"TreePathMaxima"},{"p":"com.jgalgo.alg.tree","l":"Trees"},{"p":"com.jgalgo.alg.path","l":"TspMetric"},{"p":"com.jgalgo.alg.path","l":"TspMetricMatchingAppx"},{"p":"com.jgalgo.alg.path","l":"TspMetricMSTAppx"},{"p":"com.jgalgo.gen","l":"UniformTreeGenerator"},{"p":"com.jgalgo.gen","l":"UnionGraphGenerator"},{"p":"com.jgalgo.alg.tree","l":"LowestCommonAncestorDynamic.Vertex"},{"p":"com.jgalgo.alg","l":"VertexBiPartition"},{"p":"com.jgalgo.alg.cover","l":"VertexCover"},{"p":"com.jgalgo.alg.cover","l":"VertexCoverAbstract"},{"p":"com.jgalgo.alg.cover","l":"VertexCoverBarYehuda"},{"p":"com.jgalgo.alg","l":"VertexPartition"},{"p":"com.jgalgo.alg.path","l":"VoronoiAlgo"},{"p":"com.jgalgo.alg.connect","l":"WeaklyConnectedComponentsAlgo"},{"p":"com.jgalgo.alg.connect","l":"WeaklyConnectedComponentsAlgoAbstract"},{"p":"com.jgalgo.alg.connect","l":"WeaklyConnectedComponentsAlgoImpl"},{"p":"com.jgalgo.graph","l":"WeightFunction"},{"p":"com.jgalgo.graph","l":"WeightFunctionInt"},{"p":"com.jgalgo.graph","l":"WeightFunctions"},{"p":"com.jgalgo.graph","l":"Weights"},{"p":"com.jgalgo.graph","l":"WeightsBool"},{"p":"com.jgalgo.graph","l":"WeightsByte"},{"p":"com.jgalgo.graph","l":"WeightsChar"},{"p":"com.jgalgo.graph","l":"WeightsDouble"},{"p":"com.jgalgo.graph","l":"WeightsFloat"},{"p":"com.jgalgo.graph","l":"WeightsInt"},{"p":"com.jgalgo.graph","l":"WeightsLong"},{"p":"com.jgalgo.graph","l":"WeightsObj"},{"p":"com.jgalgo.graph","l":"WeightsShort"}] \ No newline at end of file diff --git a/0.4.1-snapshot/type-search-index.zip b/0.4.1-snapshot/type-search-index.zip index e4c4ea8f2d..dfc4ffd39e 100644 Binary files a/0.4.1-snapshot/type-search-index.zip and b/0.4.1-snapshot/type-search-index.zip differ