Hierarchy For Package org.jgrapht.alg.interfaces

Package Hierarchies:

• All Packages

Class Hierarchy

• java.lang.Object
  • java.util.AbstractCollection<E> (implements java.util.Collection<E>)
    • java.util.AbstractSet<E> (implements java.util.Set<E>)
      • 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.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl<V,E> (implements org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree<V,E>, java.io.Serializable)
  • org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasisImpl<V,E> (implements org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasis<V,E>, java.io.Serializable)
  • 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.interfaces.MatchingAlgorithm.MatchingImpl<V,E> (implements org.jgrapht.alg.interfaces.MatchingAlgorithm.Matching<V,E>, java.io.Serializable)
  • org.jgrapht.alg.interfaces.PartitioningAlgorithm.PartitioningImpl<V> (implements org.jgrapht.alg.interfaces.PartitioningAlgorithm.Partitioning<V>, java.io.Serializable)
  • org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTreeImpl<E> (implements java.io.Serializable, org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTree<E>)
  • org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm.PathDecompositionImpl<V,E> (implements java.io.Serializable, org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm.PathDecomposition<V,E>)
  • org.jgrapht.alg.interfaces.VertexColoringAlgorithm.ColoringImpl<V> (implements java.io.Serializable, org.jgrapht.alg.interfaces.VertexColoringAlgorithm.Coloring<V>)

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.alg.interfaces.EulerianCycleAlgorithm<V,E>
• 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.alg.interfaces.HamiltonianCycleAlgorithm<V,E>
• org.jgrapht.alg.interfaces.IndependentSetAlgorithm<V>
• java.lang.Iterable<T>
  • org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree<V,E> (also extends org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTree<E>)
  • java.util.Collection<E>
    • 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.MatchingAlgorithm.Matching<V,E>
  • org.jgrapht.alg.interfaces.MaximalCliqueEnumerationAlgorithm<V,E>
  • org.jgrapht.alg.interfaces.PartitioningAlgorithm.Partitioning<V>
  • 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.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.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.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.alg.interfaces.StrongConnectivityAlgorithm<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>