Hierarchy For All Packages

Package Hierarchies:

• org.jgrapht,
• org.jgrapht.alg,
• org.jgrapht.alg.clique,
• org.jgrapht.alg.color,
• org.jgrapht.alg.connectivity,
• org.jgrapht.alg.cycle,
• org.jgrapht.alg.decomposition,
• org.jgrapht.alg.densesubgraph,
• org.jgrapht.alg.flow,
• org.jgrapht.alg.flow.mincost,
• org.jgrapht.alg.independentset,
• org.jgrapht.alg.interfaces,
• org.jgrapht.alg.isomorphism,
• org.jgrapht.alg.lca,
• org.jgrapht.alg.matching,
• org.jgrapht.alg.matching.blossom.v5,
• org.jgrapht.alg.partition,
• org.jgrapht.alg.scoring,
• org.jgrapht.alg.shortestpath,
• org.jgrapht.alg.spanning,
• org.jgrapht.alg.tour,
• org.jgrapht.alg.transform,
• org.jgrapht.alg.util,
• org.jgrapht.alg.util.extension,
• org.jgrapht.alg.vertexcover,
• org.jgrapht.alg.vertexcover.util,
• org.jgrapht.event,
• org.jgrapht.generate,
• org.jgrapht.graph,
• org.jgrapht.graph.builder,
• org.jgrapht.graph.concurrent,
• org.jgrapht.graph.specifics,
• org.jgrapht.traverse,
• org.jgrapht.util

Class Hierarchy

• java.lang.Object
  • org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree<V,E> (implements org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm<V,E>)
    • org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree<V,E>
    • org.jgrapht.alg.spanning.EsauWilliamsCapacitatedMinimumSpanningTree<V,E>
  • org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation (implements java.lang.Cloneable)
  • java.util.AbstractCollection<E> (implements java.util.Collection<E>)
    • java.util.AbstractList<E> (implements java.util.List<E>)
      • java.util.ArrayList<E> (implements java.lang.Cloneable, java.util.List<E>, java.util.RandomAccess, java.io.Serializable)
        • org.jgrapht.util.ArrayUnenforcedSet<E> (implements java.util.Set<E>)
    • java.util.AbstractSet<E> (implements java.util.Set<E>)
      • org.jgrapht.util.UnmodifiableUnionSet<E> (implements java.io.Serializable)
      • org.jgrapht.util.WeightedUnmodifiableSet<E> (implements java.io.Serializable)
        • org.jgrapht.alg.interfaces.CliqueAlgorithm.CliqueImpl<V> (implements org.jgrapht.alg.interfaces.CliqueAlgorithm.Clique<V>)
        • org.jgrapht.alg.interfaces.IndependentSetAlgorithm.IndependentSetImpl<V> (implements org.jgrapht.alg.interfaces.IndependentSetAlgorithm.IndependentSet<V>)
        • org.jgrapht.alg.interfaces.SpannerAlgorithm.SpannerImpl<E> (implements java.io.Serializable, org.jgrapht.alg.interfaces.SpannerAlgorithm.Spanner<E>)
        • org.jgrapht.alg.interfaces.VertexCoverAlgorithm.VertexCoverImpl<V> (implements org.jgrapht.alg.interfaces.VertexCoverAlgorithm.VertexCover<V>)
  • org.jgrapht.alg.cycle.AbstractFundamentalCycleBasis<V,E> (implements org.jgrapht.alg.interfaces.CycleBasisAlgorithm<V,E>)
    • org.jgrapht.alg.cycle.QueueBFSFundamentalCycleBasis<V,E>
    • org.jgrapht.alg.cycle.StackBFSFundamentalCycleBasis<V,E>
  • org.jgrapht.graph.AbstractGraph<V,E> (implements org.jgrapht.Graph<V,E>)
    • org.jgrapht.graph.AbstractBaseGraph<V,E> (implements java.lang.Cloneable, org.jgrapht.Graph<V,E>, java.io.Serializable)
      • org.jgrapht.graph.DefaultDirectedGraph<V,E>
        • org.jgrapht.graph.DefaultDirectedWeightedGraph<V,E>
      • org.jgrapht.graph.DefaultUndirectedGraph<V,E>
        • org.jgrapht.graph.DefaultUndirectedWeightedGraph<V,E>
      • org.jgrapht.graph.DirectedAcyclicGraph<V,E> (implements java.lang.Iterable<T>)
      • org.jgrapht.graph.DirectedMultigraph<V,E>
        • org.jgrapht.graph.DirectedWeightedMultigraph<V,E>
      • org.jgrapht.graph.DirectedPseudograph<V,E>
        • org.jgrapht.graph.DirectedWeightedPseudograph<V,E>
      • org.jgrapht.graph.Multigraph<V,E>
        • org.jgrapht.graph.WeightedMultigraph<V,E>
      • org.jgrapht.graph.Pseudograph<V,E>
        • org.jgrapht.graph.WeightedPseudograph<V,E>
      • org.jgrapht.graph.SimpleDirectedGraph<V,E>
        • org.jgrapht.graph.SimpleDirectedWeightedGraph<V,E>
      • org.jgrapht.graph.SimpleGraph<V,E>
        • org.jgrapht.alg.connectivity.BlockCutpointGraph<V,E>
        • org.jgrapht.graph.SimpleWeightedGraph<V,E>
    • org.jgrapht.graph.AsGraphUnion<V,E> (implements java.io.Serializable)
    • org.jgrapht.graph.AsSubgraph<V,E> (implements java.io.Serializable)
    • org.jgrapht.graph.GraphDelegator<V,E> (implements org.jgrapht.Graph<V,E>, java.io.Serializable)
      • org.jgrapht.graph.concurrent.AsSynchronizedGraph<V,E> (implements org.jgrapht.Graph<V,E>, java.io.Serializable)
      • org.jgrapht.graph.AsUndirectedGraph<V,E> (implements org.jgrapht.Graph<V,E>, java.io.Serializable)
      • org.jgrapht.graph.AsUnmodifiableGraph<V,E> (implements java.io.Serializable)
      • org.jgrapht.graph.AsUnweightedGraph<V,E> (implements org.jgrapht.Graph<V,E>, java.io.Serializable)
      • org.jgrapht.graph.AsWeightedGraph<V,E> (implements org.jgrapht.Graph<V,E>, java.io.Serializable)
      • org.jgrapht.graph.DefaultListenableGraph<V,E> (implements java.lang.Cloneable, org.jgrapht.ListenableGraph<V,E>)
      • org.jgrapht.graph.EdgeReversedGraph<V,E> (implements org.jgrapht.Graph<V,E>)
      • org.jgrapht.graph.ParanoidGraph<V,E>
    • org.jgrapht.graph.MaskSubgraph<V,E> (implements java.io.Serializable)
  • org.jgrapht.graph.builder.AbstractGraphBuilder<V,E,G,B>
    • org.jgrapht.graph.builder.GraphBuilder<V,E,G>
  • org.jgrapht.traverse.AbstractGraphIterator<V,E> (implements org.jgrapht.traverse.GraphIterator<V,E>)
    • org.jgrapht.traverse.CrossComponentIterator<V,E,D>
      • org.jgrapht.traverse.BreadthFirstIterator<V,E>
      • org.jgrapht.traverse.ClosestFirstIterator<V,E>
      • org.jgrapht.traverse.DepthFirstIterator<V,E>
    • org.jgrapht.traverse.DegeneracyOrderingIterator<V,E>
    • org.jgrapht.traverse.LexBreadthFirstIterator<V,E>
    • org.jgrapht.traverse.MaximumCardinalityIterator<V,E>
    • org.jgrapht.traverse.RandomWalkIterator<V,E>
    • org.jgrapht.traverse.TopologicalOrderIterator<V,E>
  • org.jgrapht.alg.isomorphism.AHUForestIsomorphismInspector<V,E> (implements org.jgrapht.alg.isomorphism.IsomorphismInspector<V,E>)
  • org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation<V,E>
  • org.jgrapht.alg.isomorphism.AHURootedTreeIsomorphismInspector<V,E> (implements org.jgrapht.alg.isomorphism.IsomorphismInspector<V,E>)
  • org.jgrapht.alg.isomorphism.AHUUnrootedTreeIsomorphismInspector<V,E> (implements org.jgrapht.alg.isomorphism.IsomorphismInspector<V,E>)
  • org.jgrapht.alg.util.AliasMethodSampler
  • org.jgrapht.alg.shortestpath.AllDirectedPaths<V,E>
  • org.jgrapht.alg.scoring.AlphaCentrality<V,E> (implements org.jgrapht.alg.interfaces.VertexScoringAlgorithm<V,D>)
  • org.jgrapht.alg.shortestpath.ALTAdmissibleHeuristic<V,E> (implements org.jgrapht.alg.interfaces.AStarAdmissibleHeuristic<V>)
  • org.jgrapht.alg.util.AlwaysEqualComparator<T> (implements java.util.Comparator<T>)
  • org.jgrapht.graph.specifics.ArrayUnenforcedSetEdgeSetFactory<V,E> (implements org.jgrapht.graph.EdgeSetFactory<V,E>, java.io.Serializable)
  • org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder<V,E>
  • org.jgrapht.alg.shortestpath.AStarShortestPath<V,E>
  • org.jgrapht.generate.BarabasiAlbertForestGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.generate.BarabasiAlbertGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.alg.vertexcover.BarYehudaEvenTwoApproxVCImpl<V,E> (implements org.jgrapht.alg.interfaces.VertexCoverAlgorithm<V>)
  • org.jgrapht.alg.shortestpath.BaseBidirectionalShortestPathAlgorithm<V,E>
    • org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath<V,E>
    • org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath<V,E>
  • org.jgrapht.graph.BaseIntrusiveEdgesSpecifics<V,E,IE> (implements java.io.Serializable)
    • org.jgrapht.graph.UniformIntrusiveEdgesSpecifics<V,E> (implements org.jgrapht.graph.IntrusiveEdgesSpecifics<V,E>)
    • org.jgrapht.graph.WeightedIntrusiveEdgesSpecifics<V,E> (implements org.jgrapht.graph.IntrusiveEdgesSpecifics<V,E>)
  • org.jgrapht.alg.shortestpath.BellmanFordShortestPath<V,E>
  • org.jgrapht.alg.cycle.BergeGraphInspector<V,E>
  • org.jgrapht.alg.scoring.BetweennessCentrality<V,E> (implements org.jgrapht.alg.interfaces.VertexScoringAlgorithm<V,D>)
  • org.jgrapht.alg.shortestpath.BFSShortestPath<V,E>
  • org.jgrapht.alg.shortestpath.BhandariKDisjointShortestPaths<V,E>
  • org.jgrapht.alg.connectivity.BiconnectivityInspector<V,E>
  • org.jgrapht.alg.lca.BinaryLiftingLCAFinder<V,E> (implements org.jgrapht.alg.interfaces.LowestCommonAncestorAlgorithm<V>)
  • org.jgrapht.alg.partition.BipartitePartitioning<V,E> (implements org.jgrapht.alg.interfaces.PartitioningAlgorithm<V>)
  • org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
  • org.jgrapht.alg.spanning.BoruvkaMinimumSpanningTree<V,E> (implements org.jgrapht.alg.interfaces.SpanningTreeAlgorithm<E>)
  • org.jgrapht.alg.clique.BronKerboschCliqueFinder<V,E>
  • org.jgrapht.alg.color.BrownBacktrackColoring<V,E> (implements org.jgrapht.alg.interfaces.VertexColoringAlgorithm<V>)
  • org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl<V,E> (implements org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree<V,E>, java.io.Serializable)
  • org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow<V,E> (implements org.jgrapht.alg.interfaces.MinimumCostFlowAlgorithm<V,E>)
  • org.jgrapht.alg.cycle.ChinesePostman<V,E>
  • org.jgrapht.alg.color.ChordalGraphColoring<V,E> (implements org.jgrapht.alg.interfaces.VertexColoringAlgorithm<V>)
  • org.jgrapht.alg.independentset.ChordalGraphIndependentSetFinder<V,E> (implements org.jgrapht.alg.interfaces.IndependentSetAlgorithm<V>)
  • org.jgrapht.alg.clique.ChordalGraphMaxCliqueFinder<V,E> (implements org.jgrapht.alg.interfaces.CliqueAlgorithm<V>)
  • org.jgrapht.alg.cycle.ChordalGraphMinimalVertexSeparatorFinder<V,E>
  • org.jgrapht.alg.cycle.ChordalityInspector<V,E>
  • org.jgrapht.alg.tour.ChristofidesThreeHalvesApproxMetricTSP<V,E> (implements org.jgrapht.alg.interfaces.HamiltonianCycleAlgorithm<V,E>)
  • org.jgrapht.alg.vertexcover.ClarksonTwoApproxVCImpl<V,E> (implements org.jgrapht.alg.interfaces.VertexCoverAlgorithm<V>)
  • org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition<V,E>
  • org.jgrapht.alg.scoring.ClosenessCentrality<V,E> (implements org.jgrapht.alg.interfaces.VertexScoringAlgorithm<V,D>)
    • org.jgrapht.alg.scoring.HarmonicCentrality<V,E>
  • org.jgrapht.alg.scoring.ClusteringCoefficient<V,E> (implements org.jgrapht.alg.interfaces.VertexScoringAlgorithm<V,D>)
  • org.jgrapht.alg.color.ColorRefinementAlgorithm<V,E> (implements org.jgrapht.alg.interfaces.VertexColoringAlgorithm<V>)
  • org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector<V,E> (implements org.jgrapht.alg.isomorphism.IsomorphismInspector<V,E>)
  • org.jgrapht.generate.ComplementGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.generate.CompleteBipartiteGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.generate.CompleteGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.alg.connectivity.ConnectivityInspector<V,E> (implements org.jgrapht.event.GraphListener<V,E>)
  • org.jgrapht.alg.scoring.Coreness<V,E> (implements org.jgrapht.alg.interfaces.VertexScoringAlgorithm<V,D>)
  • org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasisImpl<V,E> (implements org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasis<V,E>, java.io.Serializable)
  • org.jgrapht.alg.cycle.CycleDetector<V,E>
  • org.jgrapht.alg.cycle.Cycles
  • org.jgrapht.graph.DefaultEdge
  • org.jgrapht.graph.DefaultEdgeFunction<E,T> (implements java.util.function.Function<T,R>, java.io.Serializable)
  • org.jgrapht.graph.DefaultGraphMapping<V,E> (implements org.jgrapht.GraphMapping<V,E>)
  • org.jgrapht.graph.DefaultGraphSpecificsStrategy<V,E> (implements org.jgrapht.graph.GraphSpecificsStrategy<V,E>)
  • org.jgrapht.graph.DefaultGraphType (implements org.jgrapht.GraphType, java.io.Serializable)
  • org.jgrapht.graph.DefaultGraphType.Builder
  • org.jgrapht.graph.DefaultWeightedEdge
  • org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath<V,E>
  • org.jgrapht.alg.shortestpath.DijkstraShortestPath<V,E>
  • org.jgrapht.graph.DirectedAcyclicGraph.Region (implements java.io.Serializable)
  • org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexBiMap<V> (implements org.jgrapht.graph.DirectedAcyclicGraph.TopoOrderMap<V>)
  • org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexMap (implements org.jgrapht.graph.DirectedAcyclicGraph.TopoOrderMap<V>)
  • org.jgrapht.graph.DirectedAcyclicGraph.VisitedArrayImpl (implements org.jgrapht.graph.DirectedAcyclicGraph.VisitedStrategy, org.jgrapht.graph.DirectedAcyclicGraph.VisitedStrategyFactory)
  • org.jgrapht.graph.DirectedAcyclicGraph.VisitedArrayListImpl (implements org.jgrapht.graph.DirectedAcyclicGraph.VisitedStrategy, org.jgrapht.graph.DirectedAcyclicGraph.VisitedStrategyFactory)
  • org.jgrapht.graph.DirectedAcyclicGraph.VisitedBitSetImpl (implements org.jgrapht.graph.DirectedAcyclicGraph.VisitedStrategy, org.jgrapht.graph.DirectedAcyclicGraph.VisitedStrategyFactory)
  • org.jgrapht.graph.DirectedAcyclicGraph.VisitedHashSetImpl (implements org.jgrapht.graph.DirectedAcyclicGraph.VisitedStrategy, org.jgrapht.graph.DirectedAcyclicGraph.VisitedStrategyFactory)
  • org.jgrapht.graph.specifics.DirectedEdgeContainer<V,E> (implements java.io.Serializable)
  • org.jgrapht.graph.specifics.DirectedSpecifics<V,E> (implements java.io.Serializable, org.jgrapht.graph.specifics.Specifics<V,E>)
    • org.jgrapht.graph.specifics.FastLookupDirectedSpecifics<V,E>
  • org.jgrapht.alg.decomposition.DulmageMendelsohnDecomposition<V,E>
  • org.jgrapht.alg.decomposition.DulmageMendelsohnDecomposition.Decomposition<V,E>
  • org.jgrapht.alg.vertexcover.EdgeBasedTwoApproxVCImpl<V,E> (implements org.jgrapht.alg.interfaces.VertexCoverAlgorithm<V>)
  • org.jgrapht.alg.matching.EdmondsMaximumCardinalityMatching<V,E> (implements org.jgrapht.alg.interfaces.MatchingAlgorithm<V,E>)
  • org.jgrapht.generate.EmptyGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.alg.shortestpath.EppsteinKShortestPath<V,E> (implements org.jgrapht.alg.interfaces.KShortestPathAlgorithm<V,E>)
  • org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator<V,E> (implements java.util.Iterator<E>)
  • org.jgrapht.alg.lca.EulerTourRMQLCAFinder<V,E> (implements org.jgrapht.alg.interfaces.LowestCommonAncestorAlgorithm<V>)
  • java.util.EventObject (implements java.io.Serializable)
    • org.jgrapht.event.ConnectedComponentTraversalEvent
    • org.jgrapht.event.EdgeTraversalEvent<E>
    • org.jgrapht.event.GraphChangeEvent
      • org.jgrapht.event.GraphEdgeChangeEvent<V,E>
      • org.jgrapht.event.GraphVertexChangeEvent<V>
    • org.jgrapht.event.VertexTraversalEvent<V>
  • org.jgrapht.alg.util.extension.ExtensionManager<T,B>
  • org.jgrapht.graph.FastLookupGraphSpecificsStrategy<V,E> (implements org.jgrapht.graph.GraphSpecificsStrategy<V,E>)
  • org.jgrapht.util.FibonacciHeap<T>
  • org.jgrapht.util.FibonacciHeapNode<T>
  • org.jgrapht.alg.util.FixedSizeIntegerQueue
  • org.jgrapht.alg.interfaces.FlowAlgorithm.FlowImpl<E> (implements org.jgrapht.alg.interfaces.FlowAlgorithm.Flow<E>)
    • org.jgrapht.alg.interfaces.MaximumFlowAlgorithm.MaximumFlowImpl<E> (implements org.jgrapht.alg.interfaces.MaximumFlowAlgorithm.MaximumFlow<E>)
    • org.jgrapht.alg.interfaces.MinimumCostFlowAlgorithm.MinimumCostFlowImpl<E> (implements org.jgrapht.alg.interfaces.MinimumCostFlowAlgorithm.MinimumCostFlow<E>)
  • org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths<V,E>
  • org.jgrapht.alg.connectivity.GabowStrongConnectivityInspector<V,E>
  • org.jgrapht.generate.GeneralizedPetersenGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.generate.GnmRandomBipartiteGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.generate.GnmRandomGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.generate.GnpRandomBipartiteGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.generate.GnpRandomGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase<V,E> (implements org.jgrapht.alg.interfaces.MaximumDensitySubgraphAlgorithm<V,E>)
    • org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithm<V,E>
    • org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight<V,E>
    • org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmNodeWeights<V,E>
  • org.jgrapht.alg.shortestpath.GraphMeasurer<V,E>
  • org.jgrapht.GraphMetrics
  • org.jgrapht.Graphs
  • org.jgrapht.GraphTests
  • org.jgrapht.graph.builder.GraphTypeBuilder<V,E>
  • org.jgrapht.graph.GraphWalk<V,E> (implements org.jgrapht.GraphPath<V,E>, java.io.Serializable)
  • org.jgrapht.alg.color.GreedyColoring<V,E> (implements org.jgrapht.alg.interfaces.VertexColoringAlgorithm<V>)
    • org.jgrapht.alg.color.LargestDegreeFirstColoring<V,E>
    • org.jgrapht.alg.color.RandomGreedyColoring<V,E>
    • org.jgrapht.alg.color.SmallestDegreeLastColoring<V,E>
  • org.jgrapht.alg.matching.GreedyMaximumCardinalityMatching<V,E> (implements org.jgrapht.alg.interfaces.MatchingAlgorithm<V,E>)
  • org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner<V,E> (implements org.jgrapht.alg.interfaces.SpannerAlgorithm<E>)
  • org.jgrapht.alg.vertexcover.GreedyVCImpl<V,E> (implements org.jgrapht.alg.interfaces.VertexCoverAlgorithm<V>)
  • org.jgrapht.alg.matching.GreedyWeightedMatching<V,E> (implements org.jgrapht.alg.interfaces.MatchingAlgorithm<V,E>)
  • org.jgrapht.generate.GridGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.alg.flow.GusfieldEquivalentFlowTree<V,E> (implements org.jgrapht.alg.interfaces.MaximumFlowAlgorithm<V,E>)
  • org.jgrapht.alg.flow.GusfieldGomoryHuCutTree<V,E> (implements org.jgrapht.alg.interfaces.MaximumFlowAlgorithm<V,E>, org.jgrapht.alg.interfaces.MinimumSTCutAlgorithm<V,E>)
  • org.jgrapht.alg.cycle.HawickJamesSimpleCycles<V,E> (implements org.jgrapht.alg.cycle.DirectedSimpleCycles<V,E>)
  • org.jgrapht.alg.decomposition.HeavyPathDecomposition<V,E> (implements org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm<V,E>)
  • org.jgrapht.alg.decomposition.HeavyPathDecomposition.InternalState
  • org.jgrapht.alg.lca.HeavyPathLCAFinder<V,E> (implements org.jgrapht.alg.interfaces.LowestCommonAncestorAlgorithm<V>)
  • org.jgrapht.alg.tour.HeldKarpTSP<V,E> (implements org.jgrapht.alg.interfaces.HamiltonianCycleAlgorithm<V,E>)
  • org.jgrapht.alg.cycle.HierholzerEulerianCycle<V,E> (implements org.jgrapht.alg.interfaces.EulerianCycleAlgorithm<V,E>)
  • org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
  • org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
  • org.jgrapht.alg.matching.HopcroftKarpMaximumCardinalityBipartiteMatching<V,E> (implements org.jgrapht.alg.interfaces.MatchingAlgorithm<V,E>)
  • org.jgrapht.generate.HyperCubeGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.alg.isomorphism.IsomorphicGraphMapping<V,E> (implements org.jgrapht.GraphMapping<V,E>)
  • org.jgrapht.alg.shortestpath.JohnsonShortestPaths<V,E>
  • org.jgrapht.alg.cycle.JohnsonSimpleCycles<V,E> (implements org.jgrapht.alg.cycle.DirectedSimpleCycles<V,E>)
  • org.jgrapht.generate.KleinbergSmallWorldGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedMatching<V,E> (implements org.jgrapht.alg.interfaces.MatchingAlgorithm<V,E>)
  • org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching<V,E> (implements org.jgrapht.alg.interfaces.MatchingAlgorithm<V,E>)
  • org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.DualSolution<V,E>
  • org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
  • org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector<V,E>
  • org.jgrapht.alg.spanning.KruskalMinimumSpanningTree<V,E> (implements org.jgrapht.alg.interfaces.SpanningTreeAlgorithm<E>)
  • org.jgrapht.alg.shortestpath.KShortestSimplePaths<V,E> (implements org.jgrapht.alg.interfaces.KShortestPathAlgorithm<V,E>)
  • org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching<V,E> (implements org.jgrapht.alg.interfaces.MatchingAlgorithm<V,E>)
  • org.jgrapht.generate.LinearGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.generate.LinearizedChordDiagramGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.alg.transform.LineGraphConverter<V,E,EE>
  • org.jgrapht.alg.shortestpath.ListMultiObjectiveSingleSourcePathsImpl<V,E> (implements org.jgrapht.alg.interfaces.MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths<V,E>, java.io.Serializable)
  • org.jgrapht.alg.shortestpath.ListSingleSourcePathsImpl<V,E> (implements java.io.Serializable, org.jgrapht.alg.interfaces.ShortestPathAlgorithm.SingleSourcePaths<V,E>)
  • org.jgrapht.alg.shortestpath.MartinShortestPath<V,E>
  • org.jgrapht.alg.interfaces.MatchingAlgorithm.MatchingImpl<V,E> (implements org.jgrapht.alg.interfaces.MatchingAlgorithm.Matching<V,E>, java.io.Serializable)
  • org.jgrapht.util.MathUtil
  • org.jgrapht.alg.flow.MaximumFlowAlgorithmBase<V,E> (implements org.jgrapht.alg.interfaces.MaximumFlowAlgorithm<V,E>, org.jgrapht.alg.interfaces.MinimumSTCutAlgorithm<V,E>)
    • org.jgrapht.alg.flow.DinicMFImpl<V,E>
    • org.jgrapht.alg.flow.EdmondsKarpMFImpl<V,E>
    • org.jgrapht.alg.flow.PushRelabelMFImpl<V,E>
  • org.jgrapht.alg.matching.MaximumWeightBipartiteMatching<V,E> (implements org.jgrapht.alg.interfaces.MatchingAlgorithm<V,E>)
  • org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem.MinimumCostFlowProblemImpl<V,E> (implements org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem<V,E>)
  • org.jgrapht.alg.lca.NaiveLCAFinder<V,E> (implements org.jgrapht.alg.interfaces.LowestCommonAncestorAlgorithm<V>)
  • org.jgrapht.generate.NamedGraphGenerator<V,E>
  • org.jgrapht.alg.util.NeighborCache<V,E> (implements org.jgrapht.event.GraphListener<V,E>)
  • java.lang.Number (implements java.io.Serializable)
    • org.jgrapht.util.ModifiableInteger (implements java.lang.Comparable<T>)
  • org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset<V,E>
  • org.jgrapht.alg.scoring.PageRank<V,E> (implements org.jgrapht.alg.interfaces.VertexScoringAlgorithm<V,D>)
  • org.jgrapht.alg.util.Pair<A,B> (implements java.io.Serializable)
    • org.jgrapht.alg.util.UnorderedPair<A,B> (implements java.io.Serializable)
  • org.jgrapht.alg.tour.PalmerHamiltonianCycle<V,E> (implements org.jgrapht.alg.interfaces.HamiltonianCycleAlgorithm<V,E>)
  • org.jgrapht.alg.interfaces.PartitioningAlgorithm.PartitioningImpl<V> (implements org.jgrapht.alg.interfaces.PartitioningAlgorithm.Partitioning<V>, java.io.Serializable)
  • org.jgrapht.alg.matching.PathGrowingWeightedMatching<V,E> (implements org.jgrapht.alg.interfaces.MatchingAlgorithm<V,E>)
  • org.jgrapht.alg.cycle.PatonCycleBase<V,E> (implements org.jgrapht.alg.interfaces.CycleBasisAlgorithm<V,E>)
  • org.jgrapht.alg.clique.PivotBronKerboschCliqueFinder<V,E>
    • org.jgrapht.alg.clique.DegeneracyBronKerboschCliqueFinder<V,E>
  • org.jgrapht.generate.PlantedPartitionGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.util.PrefetchIterator<E> (implements java.util.Enumeration<E>, java.util.Iterator<E>)
  • org.jgrapht.alg.spanning.PrimMinimumSpanningTree<V,E> (implements org.jgrapht.alg.interfaces.SpanningTreeAlgorithm<E>)
  • org.jgrapht.generate.PruferTreeGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.alg.flow.PushRelabelMFImpl.VertexExtension
  • org.jgrapht.util.RadixSort
  • org.jgrapht.generate.RandomRegularGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.alg.vertexcover.util.RatioVertex<V> (implements java.lang.Comparable<T>)
  • org.jgrapht.alg.vertexcover.RecursiveExactVCImpl<V,E> (implements org.jgrapht.alg.interfaces.VertexCoverAlgorithm<V>)
  • org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover
  • org.jgrapht.generate.RingGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.alg.color.SaturationDegreeColoring<V,E> (implements org.jgrapht.alg.interfaces.VertexColoringAlgorithm<V>)
  • org.jgrapht.generate.ScaleFreeGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTreeImpl<E> (implements java.io.Serializable, org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTree<E>)
  • org.jgrapht.generate.StarGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.alg.StoerWagnerMinimumCut<V,E>
  • org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight (implements java.lang.Comparable<T>)
  • org.jgrapht.util.SupplierUtil
  • org.jgrapht.alg.shortestpath.SuurballeKDisjointShortestPaths<V,E>
  • org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles<V,E> (implements org.jgrapht.alg.cycle.DirectedSimpleCycles<V,E>)
  • org.jgrapht.alg.lca.TarjanLCAFinder<V,E> (implements org.jgrapht.alg.interfaces.LowestCommonAncestorAlgorithm<V>)
  • org.jgrapht.alg.cycle.TarjanSimpleCycles<V,E> (implements org.jgrapht.alg.cycle.DirectedSimpleCycles<V,E>)
  • java.lang.Throwable (implements java.io.Serializable)
    • java.lang.Exception
      • java.lang.RuntimeException
        • org.jgrapht.alg.isomorphism.IsomorphismUndecidableException
        • org.jgrapht.alg.shortestpath.NegativeCycleDetectedException
  • org.jgrapht.alg.cycle.TiernanSimpleCycles<V,E> (implements org.jgrapht.alg.cycle.DirectedSimpleCycles<V,E>)
  • org.jgrapht.alg.util.ToleranceDoubleComparator (implements java.util.Comparator<T>)
  • org.jgrapht.alg.TransitiveClosure
  • org.jgrapht.alg.TransitiveReduction
  • org.jgrapht.event.TraversalListenerAdapter<V,E> (implements org.jgrapht.event.TraversalListener<V,E>)
  • org.jgrapht.alg.shortestpath.TreeMeasurer<V,E>
  • org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl<V,E> (implements java.io.Serializable, org.jgrapht.alg.interfaces.ShortestPathAlgorithm.SingleSourcePaths<V,E>)
  • org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm.PathDecompositionImpl<V,E> (implements java.io.Serializable, org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm.PathDecomposition<V,E>)
  • org.jgrapht.alg.tour.TwoApproxMetricTSP<V,E> (implements org.jgrapht.alg.interfaces.HamiltonianCycleAlgorithm<V,E>)
  • org.jgrapht.alg.tour.TwoOptHeuristicTSP<V,E> (implements org.jgrapht.alg.interfaces.HamiltonianCycleAlgorithm<V,E>)
  • org.jgrapht.util.TypeUtil
  • org.jgrapht.graph.specifics.UndirectedEdgeContainer<V,E> (implements java.io.Serializable)
  • org.jgrapht.graph.specifics.UndirectedSpecifics<V,E> (implements java.io.Serializable, org.jgrapht.graph.specifics.Specifics<V,E>)
    • org.jgrapht.graph.specifics.FastLookupUndirectedSpecifics<V,E>
  • org.jgrapht.alg.util.UnionFind<T>
  • org.jgrapht.alg.interfaces.VertexColoringAlgorithm.ColoringImpl<V> (implements java.io.Serializable, org.jgrapht.alg.interfaces.VertexColoringAlgorithm.Coloring<V>)
  • org.jgrapht.alg.util.VertexDegreeComparator<V,E> (implements java.util.Comparator<T>)
  • org.jgrapht.util.VertexToIntegerMapping<V>
  • org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector<V,E> (implements org.jgrapht.alg.isomorphism.IsomorphismInspector<V,E>)
    • org.jgrapht.alg.isomorphism.VF2GraphIsomorphismInspector<V,E>
    • org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismInspector<V,E>
  • org.jgrapht.generate.WattsStrogatzGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.alg.cycle.WeakChordalityInspector<V,E>
  • org.jgrapht.generate.WheelGraphGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.generate.WindmillGraphsGenerator<V,E> (implements org.jgrapht.generate.GraphGenerator<V,E,T>)
  • org.jgrapht.alg.shortestpath.YenKShortestPath<V,E> (implements org.jgrapht.alg.interfaces.KShortestPathAlgorithm<V,E>)
  • org.jgrapht.alg.shortestpath.YenShortestPathIterator<V,E> (implements java.util.Iterator<E>)

Interface Hierarchy

• org.jgrapht.alg.interfaces.AStarAdmissibleHeuristic<V>
• org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm<V,E>
• org.jgrapht.alg.interfaces.CliqueAlgorithm<V>
• org.jgrapht.alg.interfaces.CycleBasisAlgorithm<V,E>
• org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasis<V,E>
• org.jgrapht.graph.DirectedAcyclicGraph.VisitedStrategy
• org.jgrapht.alg.cycle.DirectedSimpleCycles<V,E>
• org.jgrapht.graph.EdgeSetFactory<V,E>
• org.jgrapht.alg.interfaces.EulerianCycleAlgorithm<V,E>
• java.util.EventListener
  • org.jgrapht.event.GraphListener<V,E>
  • org.jgrapht.event.VertexSetListener<V>
    • org.jgrapht.event.GraphListener<V,E>
• org.jgrapht.alg.util.extension.Extension
• org.jgrapht.alg.util.extension.ExtensionFactory<B>
• org.jgrapht.alg.interfaces.FlowAlgorithm<V,E>
  • org.jgrapht.alg.interfaces.MaximumFlowAlgorithm<V,E>
  • org.jgrapht.alg.interfaces.MinimumCostFlowAlgorithm<V,E>
• org.jgrapht.alg.interfaces.FlowAlgorithm.Flow<E>
  • org.jgrapht.alg.interfaces.MaximumFlowAlgorithm.MaximumFlow<E>
  • org.jgrapht.alg.interfaces.MinimumCostFlowAlgorithm.MinimumCostFlow<E>
• org.jgrapht.Graph<V,E>
  • org.jgrapht.ListenableGraph<V,E>
• org.jgrapht.generate.GraphGenerator<V,E,T>
• org.jgrapht.GraphMapping<V,E>
• org.jgrapht.GraphPath<V,E>
• org.jgrapht.GraphType
• org.jgrapht.alg.interfaces.HamiltonianCycleAlgorithm<V,E>
• org.jgrapht.alg.interfaces.IndependentSetAlgorithm<V>
• org.jgrapht.alg.isomorphism.IsomorphismInspector<V,E>
• java.lang.Iterable<T>
  • org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree<V,E> (also extends org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTree<E>)
  • org.jgrapht.alg.interfaces.CliqueAlgorithm.Clique<V>
  • java.util.Collection<E>
    • org.jgrapht.alg.interfaces.CliqueAlgorithm.Clique<V>
    • org.jgrapht.alg.interfaces.IndependentSetAlgorithm.IndependentSet<V>
    • java.util.Set<E>
      • org.jgrapht.alg.interfaces.CliqueAlgorithm.Clique<V>
      • org.jgrapht.alg.interfaces.IndependentSetAlgorithm.IndependentSet<V>
      • org.jgrapht.alg.interfaces.SpannerAlgorithm.Spanner<E>
      • org.jgrapht.alg.interfaces.VertexCoverAlgorithm.VertexCover<V>
    • org.jgrapht.alg.interfaces.SpannerAlgorithm.Spanner<E>
    • org.jgrapht.alg.interfaces.VertexCoverAlgorithm.VertexCover<V>
  • org.jgrapht.alg.interfaces.IndependentSetAlgorithm.IndependentSet<V>
  • org.jgrapht.alg.interfaces.MatchingAlgorithm.Matching<V,E>
  • org.jgrapht.alg.interfaces.MaximalCliqueEnumerationAlgorithm<V,E>
  • org.jgrapht.alg.interfaces.PartitioningAlgorithm.Partitioning<V>
  • java.util.Set<E>
    • org.jgrapht.alg.interfaces.CliqueAlgorithm.Clique<V>
    • org.jgrapht.alg.interfaces.IndependentSetAlgorithm.IndependentSet<V>
    • org.jgrapht.alg.interfaces.SpannerAlgorithm.Spanner<E>
    • org.jgrapht.alg.interfaces.VertexCoverAlgorithm.VertexCover<V>
  • org.jgrapht.alg.interfaces.SpannerAlgorithm.Spanner<E>
  • org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTree<E>
    • org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree<V,E> (also extends java.lang.Iterable<T>)
  • org.jgrapht.alg.interfaces.VertexCoverAlgorithm.VertexCover<V>
• java.util.Iterator<E>
  • org.jgrapht.traverse.GraphIterator<V,E>
• org.jgrapht.alg.interfaces.KShortestPathAlgorithm<V,E>
• org.jgrapht.alg.interfaces.LowestCommonAncestorAlgorithm<V>
• org.jgrapht.alg.interfaces.MatchingAlgorithm<V,E>
• org.jgrapht.alg.interfaces.MaximumDensitySubgraphAlgorithm<V,E>
• org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem<V,E>
• org.jgrapht.alg.interfaces.MinimumSTCutAlgorithm<V,E>
• org.jgrapht.alg.interfaces.MultiObjectiveShortestPathAlgorithm<V,E>
• org.jgrapht.alg.interfaces.MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths<V,E>
• org.jgrapht.alg.interfaces.PartitioningAlgorithm<V>
• org.jgrapht.alg.shortestpath.PathValidator<V,E>
• org.jgrapht.util.PrefetchIterator.NextElementFunctor<EE>
• java.io.Serializable
  • org.jgrapht.graph.DirectedAcyclicGraph.TopoOrderMap<V>
  • org.jgrapht.graph.DirectedAcyclicGraph.VisitedStrategyFactory
  • org.jgrapht.graph.GraphSpecificsStrategy<V,E>
  • org.jgrapht.graph.IntrusiveEdgesSpecifics<V,E>
• org.jgrapht.alg.interfaces.ShortestPathAlgorithm<V,E>
• org.jgrapht.alg.interfaces.ShortestPathAlgorithm.SingleSourcePaths<V,E>
• org.jgrapht.alg.interfaces.SpannerAlgorithm<E>
• org.jgrapht.alg.interfaces.SpanningTreeAlgorithm<E>
• org.jgrapht.graph.specifics.Specifics<V,E>
• org.jgrapht.alg.interfaces.StrongConnectivityAlgorithm<V,E>
• org.jgrapht.event.TraversalListener<V,E>
• org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm<V,E>
• org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm.PathDecomposition<V,E>
• org.jgrapht.alg.interfaces.VertexColoringAlgorithm<V>
• org.jgrapht.alg.interfaces.VertexColoringAlgorithm.Coloring<V>
• org.jgrapht.alg.interfaces.VertexCoverAlgorithm<V>
• org.jgrapht.alg.interfaces.VertexScoringAlgorithm<V,D>
• org.jgrapht.util.WeightCombiner

Enum Hierarchy

• java.lang.Object
  • java.lang.Enum<E> (implements java.lang.Comparable<T>, java.io.Serializable)
    • org.jgrapht.alg.util.VertexDegreeComparator.Order
    • org.jgrapht.alg.cycle.ChordalityInspector.IterationOrder
    • org.jgrapht.alg.matching.blossom.v5.ObjectiveSense
    • org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.DualUpdateStrategy
    • org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.InitializationType
    • org.jgrapht.traverse.DepthFirstIterator.VisitColor
    • org.jgrapht.generate.WindmillGraphsGenerator.Mode