Hierarchy For All Packages
- com.jgalgo,
- com.jgalgo.adapt.guava,
- com.jgalgo.adapt.jgrapht,
- com.jgalgo.alg.bipartite,
- com.jgalgo.alg.clique,
- com.jgalgo.alg.closure,
- com.jgalgo.alg.color,
- com.jgalgo.alg.common,
- com.jgalgo.alg.connect,
- com.jgalgo.alg.cores,
- com.jgalgo.alg.cover,
- com.jgalgo.alg.cycle,
- com.jgalgo.alg.dag,
- com.jgalgo.alg.distancemeasures,
- com.jgalgo.alg.euler,
- com.jgalgo.alg.flow,
- com.jgalgo.alg.hamilton,
- com.jgalgo.alg.isomorphism,
- com.jgalgo.alg.match,
- com.jgalgo.alg.shortestpath,
- com.jgalgo.alg.span,
- com.jgalgo.alg.traversal,
- com.jgalgo.alg.tree,
- com.jgalgo.example,
- com.jgalgo.gen,
- com.jgalgo.graph,
- com.jgalgo.io
Class Hierarchy
- java.lang.Object
- com.google.common.graph.AbstractGraph<N> (implements com.google.common.graph.Graph<N>)
- com.jgalgo.adapt.guava.GuavaGraphAdapter<V,
E> - com.jgalgo.adapt.guava.GuavaMutableGraphAdapter<V,
E> (implements com.google.common.graph.MutableGraph<N>)
- com.jgalgo.adapt.guava.GuavaMutableGraphAdapter<V,
- com.jgalgo.adapt.guava.GuavaGraphAdapter<V,
- com.jgalgo.graph.AbstractGraph<V,
E> (implements com.jgalgo.graph.Graph<V, E>) - com.jgalgo.adapt.guava.GuavaNetworkWrapper<V,
E> - com.jgalgo.adapt.jgrapht.JGraphTWrapper<V,
E>
- com.jgalgo.adapt.guava.GuavaNetworkWrapper<V,
- org.jgrapht.graph.AbstractGraph<V,
E> (implements org.jgrapht.Graph<V, E>) - com.jgalgo.adapt.jgrapht.JGraphTAdapter<V,
E>
- com.jgalgo.adapt.jgrapht.JGraphTAdapter<V,
- com.google.common.graph.AbstractNetwork<N,
E> (implements com.google.common.graph.Network<N, E>) - com.jgalgo.adapt.guava.GuavaNetworkAdapter<V,
E> - com.jgalgo.adapt.guava.GuavaMutableNetworkAdapter<V,
E> (implements com.google.common.graph.MutableNetwork<N, E>)
- com.jgalgo.adapt.guava.GuavaMutableNetworkAdapter<V,
- com.jgalgo.adapt.guava.GuavaNetworkAdapter<V,
- com.google.common.graph.AbstractValueGraph<N,
V> (implements com.google.common.graph.ValueGraph<N, V>) - com.jgalgo.adapt.guava.GuavaValueGraphAdapter<V,
E, ValueT> - com.jgalgo.adapt.guava.GuavaMutableValueGraphAdapter<V,
E, ValueT> (implements com.google.common.graph.MutableValueGraph<N, V>)
- com.jgalgo.adapt.guava.GuavaMutableValueGraphAdapter<V,
- com.jgalgo.adapt.guava.GuavaValueGraphAdapter<V,
- com.jgalgo.gen.BarabasiAlbertGraphGenerator<V,
E> (implements com.jgalgo.gen.GraphGenerator<V, E>) - com.jgalgo.example.BfsDfsExample
- com.jgalgo.alg.connect.BiConnectedComponentsAlgoAbstract (implements com.jgalgo.alg.connect.BiConnectedComponentsAlgo)
- com.jgalgo.alg.connect.BiConnectedComponentsAlgoHopcroftTarjan
- com.jgalgo.alg.bipartite.BipartiteGraphs
- com.jgalgo.alg.cycle.ChinesePostmanAbstract (implements com.jgalgo.alg.cycle.ChinesePostman)
- com.jgalgo.alg.cycle.ChinesePostmanImpl
- com.jgalgo.alg.closure.ClosuresEnumeratorAbstract (implements com.jgalgo.alg.closure.ClosuresEnumerator)
- com.jgalgo.alg.closure.ClosuresEnumeratorSchrageBaker
- com.jgalgo.alg.color.ColoringAlgoAbstract (implements com.jgalgo.alg.color.ColoringAlgo)
- com.jgalgo.alg.color.ColoringDSatur
- com.jgalgo.alg.color.ColoringGreedy (implements com.jgalgo.alg.common.RandomizedAlgorithm)
- com.jgalgo.alg.color.ColoringRecursiveLargestFirst
- com.jgalgo.example.ColoringExample
- com.jgalgo.gen.ComplementGraphGenerator<V,
E> (implements com.jgalgo.gen.GraphGenerator<V, E>) - com.jgalgo.gen.CompleteBipartiteGraphGenerator<V,
E> (implements com.jgalgo.gen.GraphGenerator<V, E>) - com.jgalgo.gen.CompleteGraphGenerator<V,
E> (implements com.jgalgo.gen.GraphGenerator<V, E>) - com.jgalgo.alg.cores.CoresAlgoAbstract (implements com.jgalgo.alg.cores.CoresAlgo)
- com.jgalgo.alg.cores.CoresAlgoImpl
- com.jgalgo.alg.cycle.CyclesEnumeratorAbstract (implements com.jgalgo.alg.cycle.CyclesEnumerator)
- com.jgalgo.alg.cycle.CyclesEnumeratorJohnson
- com.jgalgo.alg.cycle.CyclesEnumeratorTarjan
- com.jgalgo.gen.DifferenceGraphGenerator<V,
E> (implements com.jgalgo.gen.GraphGenerator<V, E>) - com.jgalgo.io.Digraph6GraphReader
- com.jgalgo.io.Digraph6GraphWriter
- com.jgalgo.io.DimacsGraphReader
- com.jgalgo.io.DimacsGraphWriter
- com.jgalgo.alg.cover.DominatingSetAlgoAbstract (implements com.jgalgo.alg.cover.DominatingSetAlgo)
- com.jgalgo.alg.cover.DominatingSetAlgoGreedy (implements com.jgalgo.alg.common.RandomizedAlgorithm)
- com.jgalgo.alg.cover.EdgeCoverAbstract (implements com.jgalgo.alg.cover.EdgeCover)
- com.jgalgo.alg.cover.EdgeCoverCardinality
- com.jgalgo.alg.cover.EdgeCoverWeighted
- com.jgalgo.example.EdgeIterationExample
- com.jgalgo.gen.EmptyGraphGenerator<V,
E> (implements com.jgalgo.gen.GraphGenerator<V, E>) - com.jgalgo.io.GexfGraphReader<V,
E> - com.jgalgo.io.GexfGraphWriter<V,
E> - com.jgalgo.io.GmlGraphReader<V,
E> - com.jgalgo.io.GmlGraphWriter<V,
E> - com.jgalgo.gen.GnmBipartiteGraphGenerator<V,
E> (implements com.jgalgo.gen.GraphGenerator<V, E>) - com.jgalgo.gen.GnmGraphGenerator<V,
E> (implements com.jgalgo.gen.GraphGenerator<V, E>) - com.jgalgo.gen.GnpBipartiteGraphGenerator<V,
E> (implements com.jgalgo.gen.GraphGenerator<V, E>) - com.jgalgo.gen.GnpGraphGenerator<V,
E> (implements com.jgalgo.gen.GraphGenerator<V, E>) - com.jgalgo.io.Graph6GraphReader
- com.jgalgo.io.Graph6GraphWriter
- com.jgalgo.io.GraphMlGraphReader<V,
E> - com.jgalgo.io.GraphMlGraphWriter<V,
E> - com.jgalgo.graph.Graphs
- com.jgalgo.alg.hamilton.HamiltonianPathAlgoAbstract (implements com.jgalgo.alg.hamilton.HamiltonianPathAlgo)
- com.jgalgo.alg.hamilton.HamiltonianPathAlgoAbstractBasedCycle
- com.jgalgo.alg.hamilton.HamiltonianPathRubin
- com.jgalgo.alg.hamilton.HamiltonianPathAlgoAbstractBasedCycle
- com.jgalgo.graph.IndexGraphBuilder.ReIndexedGraph
- com.jgalgo.graph.IndexGraphBuilder.ReIndexingMap
- com.jgalgo.graph.IndexIdMaps
- com.jgalgo.gen.IntersectionGraphGenerator<V,
E> (implements com.jgalgo.gen.GraphGenerator<V, E>) - com.jgalgo.alg.isomorphism.IsomorphismTesterAbstract (implements com.jgalgo.alg.isomorphism.IsomorphismTester)
- com.jgalgo.alg.isomorphism.IsomorphismTesterVf2
- com.jgalgo.JGAlgoConfig
- com.jgalgo.alg.connect.KEdgeConnectedComponentsAlgoAbstract (implements com.jgalgo.alg.connect.KEdgeConnectedComponentsAlgo)
- com.jgalgo.alg.connect.KEdgeConnectedComponentsWang (implements com.jgalgo.alg.common.RandomizedAlgorithm)
- com.jgalgo.alg.shortestpath.KShortestPathsStAbstract (implements com.jgalgo.alg.shortestpath.KShortestPathsSt)
- com.jgalgo.alg.shortestpath.KShortestPathsStBasedPathsTree
- com.jgalgo.alg.shortestpath.KShortestPathsStHershbergerMaxelSuri
- com.jgalgo.alg.shortestpath.KShortestPathsStKatohIbarakiMine
- com.jgalgo.alg.shortestpath.KShortestPathsStYen
- com.jgalgo.alg.shortestpath.KShortestPathsStBasedPathsTree
- com.jgalgo.alg.connect.KVertexConnectedComponentsAlgoAbstract (implements com.jgalgo.alg.connect.KVertexConnectedComponentsAlgo)
- com.jgalgo.alg.connect.KVertexConnectedComponentsWhiteMoody
- com.jgalgo.io.LedaGraphReader
- com.jgalgo.io.LedaGraphWriter
- com.jgalgo.gen.LineGraphGenerator<V,
E> (implements com.jgalgo.gen.GraphGenerator<V, E>) - com.jgalgo.alg.tree.LowestCommonAncestorDynamicGabowInts (implements com.jgalgo.alg.tree.LowestCommonAncestorDynamic)
- com.jgalgo.alg.tree.LowestCommonAncestorDynamicGabowLongs (implements com.jgalgo.alg.tree.LowestCommonAncestorDynamic)
- com.jgalgo.alg.tree.LowestCommonAncestorDynamicGabowSimple (implements com.jgalgo.alg.tree.LowestCommonAncestorDynamic)
- com.jgalgo.example.LowestCommonAncestorExample
- com.jgalgo.alg.tree.LowestCommonAncestorOfflineAbstract (implements com.jgalgo.alg.tree.LowestCommonAncestorOffline)
- com.jgalgo.alg.tree.LowestCommonAncestorOfflineUnionFind
- com.jgalgo.alg.tree.LowestCommonAncestorStaticAbstract (implements com.jgalgo.alg.tree.LowestCommonAncestorStatic)
- com.jgalgo.alg.tree.LowestCommonAncestorStaticRmq
- com.jgalgo.alg.match.MatchingAlgoAbstract (implements com.jgalgo.alg.match.MatchingAlgo)
- com.jgalgo.alg.match.MatchingAlgoAbstractBasedMaximum
- com.jgalgo.alg.match.MatchingWeightedBipartiteHungarianMethod
- com.jgalgo.alg.match.MatchingWeightedBipartiteSssp
- com.jgalgo.alg.match.MatchingWeightedGabow1990
- com.jgalgo.alg.match.MatchingWeightedGabow1990Simpler
- com.jgalgo.alg.match.MatchingAlgoAbstractBasedMinimum
- com.jgalgo.alg.match.MatchingWeightedBlossomV
- com.jgalgo.alg.match.MatchingAlgoAbstractCardinality
- com.jgalgo.alg.match.MatchingCardinalityBipartiteHopcroftKarp
- com.jgalgo.alg.match.MatchingCardinalityGabow1976
- com.jgalgo.alg.match.MatchingAlgoAbstractBasedMaximum
- com.jgalgo.alg.clique.MaximalCliquesEnumeratorAbstract (implements com.jgalgo.alg.clique.MaximalCliquesEnumerator)
- com.jgalgo.alg.clique.MaximalCliquesEnumeratorBronKerbosch
- com.jgalgo.alg.clique.MaximalCliquesEnumeratorBronKerboschPivot
- com.jgalgo.alg.clique.MaximalIndependentSetsEnumeratorAbstract (implements com.jgalgo.alg.clique.MaximalIndependentSetsEnumerator)
- com.jgalgo.alg.clique.MaximalIndependentSetsEnumeratorComplementCliques
- com.jgalgo.example.MaximumMatchingExample
- com.jgalgo.alg.flow.MinimumCostFlowAbstract (implements com.jgalgo.alg.flow.MinimumCostFlow)
- com.jgalgo.alg.flow.MinimumCostFlowAbstractBasedSourceSink
- com.jgalgo.alg.flow.MinimumCostFlowCycleCanceling
- com.jgalgo.alg.flow.MinimumCostFlowAbstractBasedSupply
- com.jgalgo.alg.flow.MinimumCostFlowCostScaling
- com.jgalgo.alg.flow.MinimumCostFlowAbstractBasedSourceSink
- com.jgalgo.alg.span.MinimumDirectedSpanningTreeAbstract (implements com.jgalgo.alg.span.MinimumDirectedSpanningTree)
- com.jgalgo.alg.span.MinimumDirectedSpanningTreeTarjan
- com.jgalgo.alg.connect.MinimumEdgeCutAllStAbstract (implements com.jgalgo.alg.connect.MinimumEdgeCutAllSt)
- com.jgalgo.alg.connect.MinimumEdgeCutAllStPicardQueyranne
- com.jgalgo.alg.connect.MinimumEdgeCutGlobalAbstract (implements com.jgalgo.alg.connect.MinimumEdgeCutGlobal)
- com.jgalgo.alg.connect.MinimumEdgeCutGlobalStoerWagner
- com.jgalgo.alg.connect.MinimumEdgeCutStAbstract (implements com.jgalgo.alg.connect.MinimumEdgeCutSt)
- com.jgalgo.alg.flow.MaximumFlowAbstract (implements com.jgalgo.alg.flow.MaximumFlow)
- com.jgalgo.alg.flow.MaximumFlowAbstractWithoutResidualNet
- com.jgalgo.alg.flow.MaximumFlowEdmondsKarp
- com.jgalgo.alg.flow.MaximumFlowPushRelabel
- com.jgalgo.alg.flow.MaximumFlowAbstractWithResidualNet
- com.jgalgo.alg.flow.MaximumFlowDinic
- com.jgalgo.alg.flow.MaximumFlowDinicDynamicTrees
- com.jgalgo.alg.flow.MaximumFlowPushRelabelDynamicTrees
- com.jgalgo.alg.flow.MaximumFlowAbstractWithoutResidualNet
- com.jgalgo.alg.flow.MaximumFlowAbstract (implements com.jgalgo.alg.flow.MaximumFlow)
- com.jgalgo.alg.cycle.MinimumMeanCycleAbstract (implements com.jgalgo.alg.cycle.MinimumMeanCycle)
- com.jgalgo.alg.cycle.MinimumMeanCycleDasdanGupta
- com.jgalgo.alg.cycle.MinimumMeanCycleHoward
- com.jgalgo.alg.span.MinimumSpanningTreeAbstract (implements com.jgalgo.alg.span.MinimumSpanningTree)
- com.jgalgo.alg.span.MinimumSpanningTreeBoruvka
- com.jgalgo.alg.span.MinimumSpanningTreeFredmanTarjan
- com.jgalgo.alg.span.MinimumSpanningTreeKargerKleinTarjan (implements com.jgalgo.alg.common.RandomizedAlgorithm)
- com.jgalgo.alg.span.MinimumSpanningTreeKruskal
- com.jgalgo.alg.span.MinimumSpanningTreePrim
- com.jgalgo.alg.span.MinimumSpanningTreeYao
- com.jgalgo.example.MinimumSpanningTreeExample
- com.jgalgo.alg.connect.MinimumVertexCutAllGlobalAbstract (implements com.jgalgo.alg.connect.MinimumVertexCutAllGlobal)
- com.jgalgo.alg.connect.MinimumVertexCutAllGlobalKanevsky
- com.jgalgo.alg.connect.MinimumVertexCutAllStAbstract (implements com.jgalgo.alg.connect.MinimumVertexCutAllSt)
- com.jgalgo.alg.connect.MinimumVertexCutAllStEdgeCut
- com.jgalgo.alg.connect.MinimumVertexCutGlobalAbstract (implements com.jgalgo.alg.connect.MinimumVertexCutGlobal)
- com.jgalgo.alg.connect.MinimumVertexCutGlobalEsfahanianHakimi
- com.jgalgo.alg.connect.MinimumVertexCutStAbstract (implements com.jgalgo.alg.connect.MinimumVertexCutSt)
- com.jgalgo.alg.connect.MinimumVertexCutStEdgeCut
- com.jgalgo.gen.RecursiveMatrixGraphGenerator<V,
E> (implements com.jgalgo.gen.GraphGenerator<V, E>) - com.jgalgo.alg.shortestpath.ShortestPathAllPairsAbstract (implements com.jgalgo.alg.shortestpath.ShortestPathAllPairs)
- com.jgalgo.alg.shortestpath.ShortestPathAllPairsCardinality
- com.jgalgo.alg.shortestpath.ShortestPathAllPairsFloydWarshall
- com.jgalgo.alg.shortestpath.ShortestPathAllPairsJohnson
- com.jgalgo.example.ShortestPathExample
- com.jgalgo.alg.shortestpath.ShortestPathHeuristicStAbstract (implements com.jgalgo.alg.shortestpath.ShortestPathHeuristicSt)
- com.jgalgo.alg.shortestpath.ShortestPathAStar
- com.jgalgo.alg.shortestpath.ShortestPathSingleSourceAbstract (implements com.jgalgo.alg.shortestpath.ShortestPathSingleSource)
- com.jgalgo.alg.shortestpath.ShortestPathSingleSourceBellmanFord
- com.jgalgo.alg.shortestpath.ShortestPathSingleSourceCardinality
- com.jgalgo.alg.shortestpath.ShortestPathSingleSourceDag
- com.jgalgo.alg.shortestpath.ShortestPathSingleSourceDial
- com.jgalgo.alg.shortestpath.ShortestPathSingleSourceDijkstra
- com.jgalgo.alg.shortestpath.ShortestPathSingleSourceGoldberg
- com.jgalgo.alg.shortestpath.ShortestPathStAbstract (implements com.jgalgo.alg.shortestpath.ShortestPathSt)
- com.jgalgo.alg.shortestpath.ShortestPathStBidirectionalBfs
- com.jgalgo.alg.shortestpath.ShortestPathStBidirectionalDijkstra
- com.jgalgo.alg.shortestpath.SimplePathsEnumeratorAbstract (implements com.jgalgo.alg.shortestpath.SimplePathsEnumerator)
- com.jgalgo.alg.shortestpath.SimplePathsEnumeratorSedgewick
- com.jgalgo.io.Sparse6GraphReader
- com.jgalgo.io.Sparse6GraphWriter
- com.jgalgo.alg.span.SteinerTreeAlgoAbstract (implements com.jgalgo.alg.span.SteinerTreeAlgo)
- com.jgalgo.alg.span.SteinerTreeMehlhorn
- com.jgalgo.alg.connect.StronglyConnectedComponentsAlgoAbstract (implements com.jgalgo.alg.connect.StronglyConnectedComponentsAlgo)
- com.jgalgo.alg.connect.StronglyConnectedComponentsPathBasedDfs
- com.jgalgo.alg.connect.StronglyConnectedComponentsTarjan
- com.jgalgo.gen.SymmetricDifferenceGraphGenerator<V,
E> (implements com.jgalgo.gen.GraphGenerator<V, E>) - java.lang.Throwable (implements java.io.Serializable)
- java.lang.Exception
- java.lang.RuntimeException
- java.lang.IllegalArgumentException
- com.jgalgo.graph.NoSuchEdgeException
- com.jgalgo.graph.NoSuchVertexException
- com.jgalgo.alg.shortestpath.NegativeCycleException
- java.lang.IllegalArgumentException
- java.lang.RuntimeException
- java.lang.Exception
- com.jgalgo.alg.dag.TopologicalOrderAlgoAbstract (implements com.jgalgo.alg.dag.TopologicalOrderAlgo)
- com.jgalgo.alg.dag.TopologicalOrderAlgoImpl
- com.jgalgo.alg.tree.TreePathMaximaAbstract (implements com.jgalgo.alg.tree.TreePathMaxima)
- com.jgalgo.alg.tree.TreePathMaximaHagerup
- com.jgalgo.alg.tree.Trees
- com.jgalgo.alg.shortestpath.TspAbstract (implements com.jgalgo.alg.shortestpath.Tsp)
- com.jgalgo.alg.shortestpath.TspMetricMatchingAppx
- com.jgalgo.alg.shortestpath.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.cover.VertexCoverBarYehuda
- com.jgalgo.alg.shortestpath.VoronoiAlgoAbstract (implements com.jgalgo.alg.shortestpath.VoronoiAlgo)
- com.jgalgo.alg.shortestpath.VoronoiAlgoDijkstra
- com.jgalgo.alg.connect.WeaklyConnectedComponentsAlgoAbstract (implements com.jgalgo.alg.connect.WeaklyConnectedComponentsAlgo)
- com.jgalgo.alg.connect.WeaklyConnectedComponentsAlgoImpl
- com.jgalgo.graph.WeightFunctions
- com.google.common.graph.AbstractGraph<N> (implements com.google.common.graph.Graph<N>)
Interface Hierarchy
- com.jgalgo.alg.common.AlgorithmBuilderBase
- com.jgalgo.alg.match.MatchingAlgo.Builder
- com.jgalgo.alg.flow.MinimumCostFlow.Builder
- com.jgalgo.alg.shortestpath.ShortestPathAllPairs.Builder
- com.jgalgo.alg.shortestpath.ShortestPathSingleSource.Builder
- com.jgalgo.alg.connect.BiConnectedComponentsAlgo
- com.jgalgo.alg.connect.BiConnectedComponentsAlgo.Result<V,
E> - com.jgalgo.alg.connect.BiConnectedComponentsAlgo.IResult
- com.jgalgo.alg.cycle.ChinesePostman
- com.jgalgo.alg.closure.ClosuresEnumerator
- com.jgalgo.alg.color.ColoringAlgo
- java.util.Comparator<T>
- it.unimi.dsi.fastutil.ints.IntComparator
- com.jgalgo.graph.IWeightFunction (also extends com.jgalgo.graph.WeightFunction<K>)
- com.jgalgo.graph.IWeightFunctionInt (also extends com.jgalgo.graph.WeightFunctionInt<K>)
- com.jgalgo.graph.IWeightsByte (also extends com.jgalgo.graph.IWeights<T>, com.jgalgo.graph.WeightsByte<K>)
- com.jgalgo.graph.IWeightsInt (also extends com.jgalgo.graph.IWeights<T>, com.jgalgo.graph.WeightsInt<K>)
- com.jgalgo.graph.IWeightsShort (also extends com.jgalgo.graph.IWeights<T>, com.jgalgo.graph.WeightsShort<K>)
- com.jgalgo.graph.IWeightsDouble (also extends com.jgalgo.graph.IWeights<T>, com.jgalgo.graph.WeightsDouble<K>)
- com.jgalgo.graph.IWeightsFloat (also extends com.jgalgo.graph.IWeights<T>, com.jgalgo.graph.WeightsFloat<K>)
- com.jgalgo.graph.IWeightsLong (also extends com.jgalgo.graph.IWeights<T>, com.jgalgo.graph.WeightsLong<K>)
- com.jgalgo.graph.IWeightFunctionInt (also extends com.jgalgo.graph.WeightFunctionInt<K>)
- com.jgalgo.graph.IWeightFunction (also extends com.jgalgo.graph.WeightFunction<K>)
- com.jgalgo.graph.WeightFunction<K>
- com.jgalgo.graph.IWeightFunction (also extends it.unimi.dsi.fastutil.ints.IntComparator)
- com.jgalgo.graph.IWeightFunctionInt (also extends com.jgalgo.graph.WeightFunctionInt<K>)
- com.jgalgo.graph.IWeightsByte (also extends com.jgalgo.graph.IWeights<T>, com.jgalgo.graph.WeightsByte<K>)
- com.jgalgo.graph.IWeightsInt (also extends com.jgalgo.graph.IWeights<T>, com.jgalgo.graph.WeightsInt<K>)
- com.jgalgo.graph.IWeightsShort (also extends com.jgalgo.graph.IWeights<T>, com.jgalgo.graph.WeightsShort<K>)
- com.jgalgo.graph.IWeightsDouble (also extends com.jgalgo.graph.IWeights<T>, com.jgalgo.graph.WeightsDouble<K>)
- com.jgalgo.graph.IWeightsFloat (also extends com.jgalgo.graph.IWeights<T>, com.jgalgo.graph.WeightsFloat<K>)
- com.jgalgo.graph.IWeightsLong (also extends com.jgalgo.graph.IWeights<T>, com.jgalgo.graph.WeightsLong<K>)
- com.jgalgo.graph.IWeightFunctionInt (also extends com.jgalgo.graph.WeightFunctionInt<K>)
- com.jgalgo.graph.WeightFunctionInt<K>
- com.jgalgo.graph.IWeightFunctionInt (also extends com.jgalgo.graph.IWeightFunction)
- com.jgalgo.graph.IWeightsByte (also extends com.jgalgo.graph.IWeights<T>, com.jgalgo.graph.WeightsByte<K>)
- com.jgalgo.graph.IWeightsInt (also extends com.jgalgo.graph.IWeights<T>, com.jgalgo.graph.WeightsInt<K>)
- com.jgalgo.graph.IWeightsShort (also extends com.jgalgo.graph.IWeights<T>, com.jgalgo.graph.WeightsShort<K>)
- com.jgalgo.graph.WeightsByte<K> (also extends com.jgalgo.graph.Weights<K,
T>) - com.jgalgo.graph.IWeightsByte (also extends com.jgalgo.graph.IWeightFunctionInt, com.jgalgo.graph.IWeights<T>)
- com.jgalgo.graph.WeightsInt<K> (also extends com.jgalgo.graph.Weights<K,
T>) - com.jgalgo.graph.IWeightsInt (also extends com.jgalgo.graph.IWeightFunctionInt, com.jgalgo.graph.IWeights<T>)
- com.jgalgo.graph.WeightsShort<K> (also extends com.jgalgo.graph.Weights<K,
T>) - com.jgalgo.graph.IWeightsShort (also extends com.jgalgo.graph.IWeightFunctionInt, com.jgalgo.graph.IWeights<T>)
- com.jgalgo.graph.IWeightFunctionInt (also extends com.jgalgo.graph.IWeightFunction)
- com.jgalgo.graph.WeightsDouble<K> (also extends com.jgalgo.graph.Weights<K,
T>) - com.jgalgo.graph.IWeightsDouble (also extends com.jgalgo.graph.IWeightFunction, com.jgalgo.graph.IWeights<T>)
- com.jgalgo.graph.WeightsFloat<K> (also extends com.jgalgo.graph.Weights<K,
T>) - com.jgalgo.graph.IWeightsFloat (also extends com.jgalgo.graph.IWeightFunction, com.jgalgo.graph.IWeights<T>)
- com.jgalgo.graph.WeightsLong<K> (also extends com.jgalgo.graph.Weights<K,
T>) - com.jgalgo.graph.IWeightsLong (also extends com.jgalgo.graph.IWeightFunction, com.jgalgo.graph.IWeights<T>)
- com.jgalgo.graph.IWeightFunction (also extends it.unimi.dsi.fastutil.ints.IntComparator)
- it.unimi.dsi.fastutil.ints.IntComparator
- com.jgalgo.alg.cores.CoresAlgo
- com.jgalgo.alg.cores.CoresAlgo.Result<V,
E> - com.jgalgo.alg.cores.CoresAlgo.IResult
- com.jgalgo.alg.cycle.CyclesEnumerator
- com.jgalgo.alg.distancemeasures.DistanceMeasures<V,
E> - com.jgalgo.alg.distancemeasures.IDistanceMeasures
- com.jgalgo.alg.cover.DominatingSetAlgo
- com.jgalgo.alg.cover.EdgeCover
- com.jgalgo.alg.euler.EulerianTourAlgo
- com.jgalgo.alg.flow.Flow<V,
E> - com.jgalgo.alg.flow.IFlow
- com.jgalgo.graph.Graph<V,
E> - com.jgalgo.graph.IntGraph
- com.jgalgo.graph.IndexGraph
- com.jgalgo.graph.IntGraph
- com.jgalgo.graph.GraphBuilder<V,
E> - com.jgalgo.graph.IntGraphBuilder
- com.jgalgo.graph.IndexGraphBuilder
- com.jgalgo.graph.IntGraphBuilder
- com.jgalgo.graph.GraphFactory<V,
E> - com.jgalgo.graph.IntGraphFactory
- com.jgalgo.graph.IndexGraphFactory
- com.jgalgo.graph.IntGraphFactory
- com.jgalgo.gen.GraphGenerator<V,
E> - com.jgalgo.io.GraphReader<V,
E> - com.jgalgo.io.GraphWriter<V,
E> - com.jgalgo.alg.hamilton.HamiltonianPathAlgo
- com.jgalgo.graph.IdBuilder<K>
- com.jgalgo.graph.IdBuilderInt
- com.jgalgo.graph.IndexIdMap<K>
- com.jgalgo.graph.IndexIntIdMap
- com.jgalgo.graph.IndexRemoveListener
- com.jgalgo.alg.isomorphism.IsomorphismMapping<V1,
E1, V2, E2> - com.jgalgo.alg.isomorphism.IsomorphismIMapping
- com.jgalgo.alg.isomorphism.IsomorphismTester
- java.lang.Iterable<T>
- java.util.Collection<E>
- it.unimi.dsi.fastutil.ints.IntCollection (also extends it.unimi.dsi.fastutil.ints.IntIterable)
- java.util.Set<E>
- it.unimi.dsi.fastutil.ints.IntIterable
- it.unimi.dsi.fastutil.ints.IntCollection (also extends java.util.Collection<E>)
- java.util.Collection<E>
- java.util.Iterator<E>
- com.jgalgo.alg.traversal.BfsIter<V,
E> - com.jgalgo.alg.traversal.BfsIter.Int (also extends it.unimi.dsi.fastutil.ints.IntIterator)
- com.jgalgo.alg.traversal.DfsIter<V,
E> - com.jgalgo.alg.traversal.DfsIter.Int (also extends it.unimi.dsi.fastutil.ints.IntIterator)
- com.jgalgo.graph.EdgeIter<V,
E> - com.jgalgo.graph.IEdgeIter (also extends it.unimi.dsi.fastutil.ints.IntIterator)
- java.util.PrimitiveIterator<T,
T_CONS> - java.util.PrimitiveIterator.OfInt
- it.unimi.dsi.fastutil.ints.IntIterator
- com.jgalgo.alg.traversal.BfsIter.Int (also extends com.jgalgo.alg.traversal.BfsIter<V,
E>) - com.jgalgo.alg.traversal.DfsIter.Int (also extends com.jgalgo.alg.traversal.DfsIter<V,
E>) - com.jgalgo.graph.IEdgeIter (also extends com.jgalgo.graph.EdgeIter<V,
E>) - com.jgalgo.alg.traversal.RandomWalkIter.Int (also extends com.jgalgo.alg.traversal.RandomWalkIter<V,
E>)
- com.jgalgo.alg.traversal.BfsIter.Int (also extends com.jgalgo.alg.traversal.BfsIter<V,
- it.unimi.dsi.fastutil.ints.IntIterator
- java.util.PrimitiveIterator.OfInt
- com.jgalgo.alg.traversal.RandomWalkIter<V,
E> (also extends com.jgalgo.alg.common.RandomizedAlgorithm) - com.jgalgo.alg.traversal.RandomWalkIter.Int (also extends it.unimi.dsi.fastutil.ints.IntIterator)
- com.jgalgo.alg.traversal.BfsIter<V,
- com.jgalgo.alg.connect.KEdgeConnectedComponentsAlgo
- com.jgalgo.alg.shortestpath.KShortestPathsSt
- com.jgalgo.alg.connect.KVertexConnectedComponentsAlgo
- com.jgalgo.alg.tree.LowestCommonAncestorDynamic
- com.jgalgo.alg.tree.LowestCommonAncestorDynamic.Vertex
- com.jgalgo.alg.tree.LowestCommonAncestorOffline
- com.jgalgo.alg.tree.LowestCommonAncestorOffline.Queries<V,
E> - com.jgalgo.alg.tree.LowestCommonAncestorOffline.IQueries
- com.jgalgo.alg.tree.LowestCommonAncestorOffline.Result<V,
E> - com.jgalgo.alg.tree.LowestCommonAncestorOffline.IResult
- com.jgalgo.alg.tree.LowestCommonAncestorStatic
- com.jgalgo.alg.tree.LowestCommonAncestorStatic.DataStructure<V,
E> - com.jgalgo.alg.tree.LowestCommonAncestorStatic.IDataStructure
- com.jgalgo.alg.match.Matching<V,
E> - com.jgalgo.alg.match.IMatching
- com.jgalgo.alg.match.MatchingAlgo
- com.jgalgo.alg.clique.MaximalCliquesEnumerator
- com.jgalgo.alg.clique.MaximalIndependentSetsEnumerator
- com.jgalgo.alg.flow.MaximumFlow
- com.jgalgo.alg.flow.MinimumCostFlow
- com.jgalgo.alg.span.MinimumDirectedSpanningTree
- com.jgalgo.alg.connect.MinimumEdgeCutAllSt
- com.jgalgo.alg.connect.MinimumEdgeCutGlobal
- com.jgalgo.alg.connect.MinimumEdgeCutSt
- com.jgalgo.alg.cycle.MinimumMeanCycle
- com.jgalgo.alg.span.MinimumSpanningTree
- com.jgalgo.alg.span.MinimumSpanningTree.Result<V,
E> - com.jgalgo.alg.span.MinimumSpanningTree.IResult
- com.jgalgo.alg.connect.MinimumVertexCutAllGlobal
- com.jgalgo.alg.connect.MinimumVertexCutAllSt
- com.jgalgo.alg.connect.MinimumVertexCutGlobal
- com.jgalgo.alg.connect.MinimumVertexCutSt
- com.jgalgo.alg.common.Path<V,
E> - com.jgalgo.alg.common.IPath
- com.jgalgo.alg.common.RandomizedAlgorithm
- com.jgalgo.alg.traversal.RandomWalkIter<V,
E> (also extends java.util.Iterator<E>) - com.jgalgo.alg.traversal.RandomWalkIter.Int (also extends it.unimi.dsi.fastutil.ints.IntIterator)
- com.jgalgo.alg.traversal.RandomWalkIter<V,
- com.jgalgo.alg.shortestpath.ShortestPathAllPairs
- com.jgalgo.alg.shortestpath.ShortestPathAllPairs.Result<V,
E> - com.jgalgo.alg.shortestpath.ShortestPathAllPairs.IResult
- com.jgalgo.alg.shortestpath.ShortestPathHeuristicSt
- com.jgalgo.alg.shortestpath.ShortestPathSingleSource
- com.jgalgo.alg.shortestpath.ShortestPathSingleSource.Result<V,
E> - com.jgalgo.alg.shortestpath.ShortestPathSingleSource.IResult
- com.jgalgo.alg.shortestpath.ShortestPathSt
- com.jgalgo.alg.shortestpath.SimplePathsEnumerator
- com.jgalgo.alg.span.SteinerTreeAlgo
- com.jgalgo.alg.span.SteinerTreeAlgo.Result<V,
E> - com.jgalgo.alg.span.SteinerTreeAlgo.IResult
- com.jgalgo.alg.connect.StronglyConnectedComponentsAlgo
- com.jgalgo.alg.dag.TopologicalOrderAlgo
- com.jgalgo.alg.dag.TopologicalOrderAlgo.Result<V,
E> - com.jgalgo.alg.dag.TopologicalOrderAlgo.IResult
- com.jgalgo.alg.tree.TreePathMaxima
- com.jgalgo.alg.tree.TreePathMaxima.Queries<V,
E> - com.jgalgo.alg.tree.TreePathMaxima.IQueries
- com.jgalgo.alg.tree.TreePathMaxima.Result<V,
E> - com.jgalgo.alg.tree.TreePathMaxima.IResult
- com.jgalgo.alg.shortestpath.Tsp
- com.jgalgo.alg.cover.VertexCover
- com.jgalgo.alg.common.VertexPartition<V,
E> - com.jgalgo.alg.common.IVertexPartition
- com.jgalgo.alg.common.IVertexBiPartition (also extends com.jgalgo.alg.common.VertexBiPartition<V,
E>)
- com.jgalgo.alg.common.IVertexBiPartition (also extends com.jgalgo.alg.common.VertexBiPartition<V,
- com.jgalgo.alg.common.VertexBiPartition<V,
E> - com.jgalgo.alg.common.IVertexBiPartition (also extends com.jgalgo.alg.common.IVertexPartition)
- com.jgalgo.alg.common.IVertexPartition
- com.jgalgo.alg.shortestpath.VoronoiAlgo
- com.jgalgo.alg.shortestpath.VoronoiAlgo.Result<V,
E> - com.jgalgo.alg.shortestpath.VoronoiAlgo.IResult
- com.jgalgo.alg.connect.WeaklyConnectedComponentsAlgo
- com.jgalgo.graph.Weights<K,
T> - com.jgalgo.graph.IWeights<T>
- com.jgalgo.graph.IWeightsBool (also extends com.jgalgo.graph.WeightsBool<K>)
- com.jgalgo.graph.IWeightsByte (also extends com.jgalgo.graph.IWeightFunctionInt, com.jgalgo.graph.WeightsByte<K>)
- com.jgalgo.graph.IWeightsChar (also extends com.jgalgo.graph.WeightsChar<K>)
- com.jgalgo.graph.IWeightsDouble (also extends com.jgalgo.graph.IWeightFunction, com.jgalgo.graph.WeightsDouble<K>)
- com.jgalgo.graph.IWeightsFloat (also extends com.jgalgo.graph.IWeightFunction, com.jgalgo.graph.WeightsFloat<K>)
- com.jgalgo.graph.IWeightsInt (also extends com.jgalgo.graph.IWeightFunctionInt, com.jgalgo.graph.WeightsInt<K>)
- com.jgalgo.graph.IWeightsLong (also extends com.jgalgo.graph.IWeightFunction, com.jgalgo.graph.WeightsLong<K>)
- com.jgalgo.graph.IWeightsObj<T> (also extends com.jgalgo.graph.WeightsObj<K,
T>) - com.jgalgo.graph.IWeightsShort (also extends com.jgalgo.graph.IWeightFunctionInt, com.jgalgo.graph.WeightsShort<K>)
- com.jgalgo.graph.WeightsBool<K>
- com.jgalgo.graph.IWeightsBool (also extends com.jgalgo.graph.IWeights<T>)
- com.jgalgo.graph.WeightsByte<K> (also extends com.jgalgo.graph.WeightFunctionInt<K>)
- com.jgalgo.graph.IWeightsByte (also extends com.jgalgo.graph.IWeightFunctionInt, com.jgalgo.graph.IWeights<T>)
- com.jgalgo.graph.WeightsChar<K>
- com.jgalgo.graph.IWeightsChar (also extends com.jgalgo.graph.IWeights<T>)
- com.jgalgo.graph.WeightsDouble<K> (also extends com.jgalgo.graph.WeightFunction<K>)
- com.jgalgo.graph.IWeightsDouble (also extends com.jgalgo.graph.IWeightFunction, com.jgalgo.graph.IWeights<T>)
- com.jgalgo.graph.WeightsFloat<K> (also extends com.jgalgo.graph.WeightFunction<K>)
- com.jgalgo.graph.IWeightsFloat (also extends com.jgalgo.graph.IWeightFunction, com.jgalgo.graph.IWeights<T>)
- com.jgalgo.graph.WeightsInt<K> (also extends com.jgalgo.graph.WeightFunctionInt<K>)
- com.jgalgo.graph.IWeightsInt (also extends com.jgalgo.graph.IWeightFunctionInt, com.jgalgo.graph.IWeights<T>)
- com.jgalgo.graph.WeightsLong<K> (also extends com.jgalgo.graph.WeightFunction<K>)
- com.jgalgo.graph.IWeightsLong (also extends com.jgalgo.graph.IWeightFunction, com.jgalgo.graph.IWeights<T>)
- com.jgalgo.graph.WeightsObj<K,
T> - com.jgalgo.graph.IWeightsObj<T> (also extends com.jgalgo.graph.IWeights<T>)
- com.jgalgo.graph.WeightsShort<K> (also extends com.jgalgo.graph.WeightFunctionInt<K>)
- com.jgalgo.graph.IWeightsShort (also extends com.jgalgo.graph.IWeightFunctionInt, com.jgalgo.graph.IWeights<T>)
- com.jgalgo.graph.IWeights<T>
Enum Hierarchy
- java.lang.Object
- java.lang.Enum<E> (implements java.lang.Comparable<T>, java.lang.constant.Constable, java.io.Serializable)
- com.jgalgo.alg.common.EdgeDirection
- com.jgalgo.graph.GraphFactory.Hint
- java.lang.Enum<E> (implements java.lang.Comparable<T>, java.lang.constant.Constable, java.io.Serializable)