## Uses of Interface
org.jgrapht.DirectedGraph

- Packages that use DirectedGraph
  Package | Description
  --- | ---
  org.jgrapht | The front-end API's interfaces and classes, including `Graph`, `DirectedGraph` and `UndirectedGraph`.
  org.jgrapht.alg | Algorithms provided with JGraphT.
  org.jgrapht.alg.cycle | Algorithms for enumeration of simple cycles in graphs.
  org.jgrapht.alg.flow |
  org.jgrapht.alg.interfaces |
  org.jgrapht.experimental.dag |
  org.jgrapht.ext | Extensions and integration means to other products.
  org.jgrapht.graph | Implementations of various graphs.
  org.jgrapht.graph.builder | Various builder for graphs.
  org.jgrapht.traverse | Graph traversal means.

- - ### Uses of DirectedGraph in org.jgrapht

    Methods in org.jgrapht with parameters of type DirectedGraph
    Modifier and Type | Method and Description
    --- | ---
    `static <V,E> void` | Graphs.`addGraphReversed(DirectedGraph<? super V,? super E> destination, DirectedGraph<V,E> source)` Adds all the vertices and all the edges of the specified source digraph to the specified destination digraph, reversing all of the edges.
    `static <V,E> void` | Graphs.`addGraphReversed(DirectedGraph<? super V,? super E> destination, DirectedGraph<V,E> source)` Adds all the vertices and all the edges of the specified source digraph to the specified destination digraph, reversing all of the edges.
    `static <V,E> List<V>` | Graphs.`predecessorListOf(DirectedGraph<V,E> g, V vertex)` Returns a list of vertices that are the direct predecessors of a specified vertex.
    `static <V,E> List<V>` | Graphs.`successorListOf(DirectedGraph<V,E> g, V vertex)` Returns a list of vertices that are the direct successors of a specified vertex.

  - ### Uses of DirectedGraph in org.jgrapht.alg

    Methods in org.jgrapht.alg that return DirectedGraph
    Modifier and Type | Method and Description
    --- | ---
    `DirectedGraph<V,E>` | GabowStrongConnectivityInspector.`getGraph()` Returns the graph inspected
    `DirectedGraph<V,E>` | StrongConnectivityInspector.`getGraph()` Deprecated. Returns the graph inspected by the StrongConnectivityAlgorithm.
    `DirectedGraph<V,E>` | KosarajuStrongConnectivityInspector.`getGraph()` Returns the graph inspected by the StrongConnectivityAlgorithm.

    Methods in org.jgrapht.alg with parameters of type DirectedGraph
    Modifier and Type | Method and Description
    --- | ---
    `<V,E> void` | TransitiveReduction.`reduce(DirectedGraph<V,E> directedGraph)` This method will remove all transitive edges from the graph passed as input parameter.

    Constructors in org.jgrapht.alg with parameters of type DirectedGraph
    Constructor and Description
    `AllDirectedPaths(DirectedGraph<V,E> graph)`
    `ConnectivityInspector(DirectedGraph<V,E> g)` Creates a connectivity inspector for the specified directed graph.
    `CycleDetector(DirectedGraph<V,E> graph)` Creates a cycle detector for the specified graph.
    `DirectedNeighborIndex(DirectedGraph<V,E> g)` Creates a neighbor index for the specified directed graph.
    `EdmondsKarpMaximumFlow(DirectedGraph<V,E> network)` Deprecated. Constructs `MaximumFlow` instance to work with a copy of `network`.
    `EdmondsKarpMaximumFlow(DirectedGraph<V,E> network, double epsilon)` Deprecated. Constructs `MaximumFlow` instance to work with a copy of `network`.
    `GabowStrongConnectivityInspector(DirectedGraph<V,E> directedGraph)` The constructor of GabowStrongConnectivityInspector class.
    `KosarajuStrongConnectivityInspector(DirectedGraph<V,E> directedGraph)` The constructor of the StrongConnectivityAlgorithm class.
    `MinSourceSinkCut(DirectedGraph<V,E> graph)`
    `MinSourceSinkCut(DirectedGraph<V,E> graph, double epsilon)`
    `NaiveLcaFinder(DirectedGraph<V,E> graph)` Find the Lowest Common Ancestor of a directed graph.
    `StrongConnectivityInspector(DirectedGraph<V,E> directedGraph)` Deprecated. The constructor of the StrongConnectivityAlgorithm class.

  - ### Uses of DirectedGraph in org.jgrapht.alg.cycle

    Methods in org.jgrapht.alg.cycle that return DirectedGraph
    Modifier and Type | Method and Description
    --- | ---
    `DirectedGraph<V,E>` | SzwarcfiterLauerSimpleCycles.`getGraph()` Returns the graph on which the simple cycle search algorithm is executed by this object.
    `DirectedGraph<V,E>` | HawickJamesSimpleCycles.`getGraph()` Returns the graph on which the simple cycle search algorithm is executed by this object.
    `DirectedGraph<V,E>` | TarjanSimpleCycles.`getGraph()` Returns the graph on which the simple cycle search algorithm is executed by this object.
    `DirectedGraph<V,E>` | JohnsonSimpleCycles.`getGraph()` Returns the graph on which the simple cycle search algorithm is executed by this object.
    `DirectedGraph<V,E>` | DirectedSimpleCycles.`getGraph()` Returns the graph on which the simple cycle search algorithm is executed by this object.
    `DirectedGraph<V,E>` | TiernanSimpleCycles.`getGraph()` Returns the graph on which the simple cycle search algorithm is executed by this object.

    Methods in org.jgrapht.alg.cycle with parameters of type DirectedGraph
    Modifier and Type | Method and Description
    --- | ---
    `void` | SzwarcfiterLauerSimpleCycles.`setGraph(DirectedGraph<V,E> graph)` Sets the graph on which the simple cycle search algorithm is executed by this object.
    `void` | HawickJamesSimpleCycles.`setGraph(DirectedGraph<V,E> graph)` Sets the graph on which the simple cycle search algorithm is executed by this object.
    `void` | TarjanSimpleCycles.`setGraph(DirectedGraph<V,E> graph)` Sets the graph on which the simple cycle search algorithm is executed by this object.
    `void` | JohnsonSimpleCycles.`setGraph(DirectedGraph<V,E> graph)` Sets the graph on which the simple cycle search algorithm is executed by this object.
    `void` | DirectedSimpleCycles.`setGraph(DirectedGraph<V,E> graph)` Sets the graph on which the simple cycle search algorithm is executed by this object.
    `void` | TiernanSimpleCycles.`setGraph(DirectedGraph<V,E> graph)` Sets the graph on which the simple cycle search algorithm is executed by this object.

    Constructors in org.jgrapht.alg.cycle with parameters of type DirectedGraph
    Constructor and Description
    `HawickJamesSimpleCycles(DirectedGraph<V,E> graph)` Create a simple cycle finder for the specified graph.
    `JohnsonSimpleCycles(DirectedGraph<V,E> graph)` Create a simple cycle finder for the specified graph.
    `SzwarcfiterLauerSimpleCycles(DirectedGraph<V,E> graph)` Create a simple cycle finder for the specified graph.
    `TarjanSimpleCycles(DirectedGraph<V,E> graph)` Create a simple cycle finder for the specified graph.
    `TiernanSimpleCycles(DirectedGraph<V,E> graph)` Create a simple cycle finder for the specified graph.

  - ### Uses of DirectedGraph in org.jgrapht.alg.flow

    Constructors in org.jgrapht.alg.flow with parameters of type DirectedGraph
    Constructor and Description
    `EdmondsKarpMaximumFlow(DirectedGraph<V,E> network)` Constructs `MaximumFlow` instance to work with a copy of `network`.
    `EdmondsKarpMaximumFlow(DirectedGraph<V,E> network, double epsilon)` Constructs `MaximumFlow` instance to work with a copy of `network`.
    `PushRelabelMaximumFlow(DirectedGraph<V,E> network)`

  - ### Uses of DirectedGraph in org.jgrapht.alg.interfaces

    Methods in org.jgrapht.alg.interfaces that return DirectedGraph
    Modifier and Type | Method and Description
    --- | ---
    `DirectedGraph<V,E>` | StrongConnectivityAlgorithm.`getGraph()` Returns the graph inspected by the StrongConnectivityAlgorithm.

  - ### Uses of DirectedGraph in org.jgrapht.experimental.dag

    Classes in org.jgrapht.experimental.dag that implement DirectedGraph
    Modifier and Type | Class and Description
    --- | ---
    `class` | `DirectedAcyclicGraph<V,E>` DirectedAcyclicGraph implements a DAG that can be modified (vertices & edges added and removed), is guaranteed to remain acyclic, and provides fast topological order iteration.

  - ### Uses of DirectedGraph in org.jgrapht.ext

    Methods in org.jgrapht.ext with parameters of type DirectedGraph
    Modifier and Type | Method and Description
    --- | ---
    `void` | GmlExporter.`export(Writer output, DirectedGraph<V,E> g)` Exports a directed graph into a plain text file in GML format.
    `void` | MatrixExporter.`exportAdjacencyMatrix(Writer output, DirectedGraph<V,E> g)` Exports the specified graph into a plain text file format containing a sparse representation of the graph's adjacency matrix.

  - ### Uses of DirectedGraph in org.jgrapht.graph

    Classes in org.jgrapht.graph that implement DirectedGraph
    Modifier and Type | Class and Description
    --- | ---
    `class` | `AsUnweightedDirectedGraph<V,E>` An unweighted view of the backing weighted graph specified in the constructor.
    `class` | `AsWeightedDirectedGraph<V,E>` A weighted view of the backing graph specified in the constructor.
    `class` | `DefaultDirectedGraph<V,E>` A directed graph.
    `class` | `DefaultDirectedWeightedGraph<V,E>` A directed weighted graph.
    `class` | `DirectedGraphUnion<V,E>`
    `class` | `DirectedMaskSubgraph<V,E>` A directed graph that is a `MaskSubgraph` on another graph.
    `class` | `DirectedMultigraph<V,E>` A directed multigraph.
    `class` | `DirectedPseudograph<V,E>` A directed pseudograph.
    `class` | `DirectedSubgraph<V,E>` A directed graph that is a subgraph on other graph.
    `class` | `DirectedWeightedMultigraph<V,E>` A directed weighted multigraph.
    `class` | `DirectedWeightedPseudograph<V,E>` A directed weighted pseudograph.
    `class` | `DirectedWeightedSubgraph<V,E>` A directed weighted graph that is a subgraph on other graph.
    `class` | `EdgeReversedGraph<V,E>` Provides an edge-reversed view g' of a directed graph g.
    `class` | `ListenableDirectedGraph<V,E>` A directed graph which is also `ListenableGraph`.
    `class` | `ListenableDirectedWeightedGraph<V,E>` A directed weighted graph which is also `ListenableGraph`.
    `class` | `MixedGraphUnion<V,E>`
    `class` | `SimpleDirectedGraph<V,E>` A simple directed graph.
    `class` | `SimpleDirectedWeightedGraph<V,E>` A simple directed weighted graph.
    `class` | `UnmodifiableDirectedGraph<V,E>` A directed graph that cannot be modified.

    Constructors in org.jgrapht.graph with parameters of type DirectedGraph
    Constructor and Description
    `AsUndirectedGraph(DirectedGraph<V,E> g)` Constructor for AsUndirectedGraph.
    `AsUnweightedDirectedGraph(DirectedGraph<V,E> g)` Constructor for AsUnweightedGraph.
    `AsWeightedDirectedGraph(DirectedGraph<V,E> g, Map<E,Double> weightMap)` Constructor for AsWeightedGraph.
    `DirectedGraphUnion(DirectedGraph<V,E> g1, DirectedGraph<V,E> g2)`
    `DirectedGraphUnion(DirectedGraph<V,E> g1, DirectedGraph<V,E> g2)`
    `DirectedGraphUnion(DirectedGraph<V,E> g1, DirectedGraph<V,E> g2, WeightCombiner operator)`
    `DirectedGraphUnion(DirectedGraph<V,E> g1, DirectedGraph<V,E> g2, WeightCombiner operator)`
    `DirectedMaskSubgraph(DirectedGraph<V,E> base, MaskFunctor<V,E> mask)`
    `DirectedSubgraph(DirectedGraph<V,E> base, Set<V> vertexSubset, Set<E> edgeSubset)` Creates a new directed subgraph.
    `EdgeReversedGraph(DirectedGraph<V,E> g)` Creates a new EdgeReversedGraph.
    `ListenableDirectedGraph(DirectedGraph<V,E> base)` Creates a new listenable directed graph.
    `MixedGraphUnion(UndirectedGraph<V,E> g1, DirectedGraph<V,E> g2)`
    `MixedGraphUnion(UndirectedGraph<V,E> g1, DirectedGraph<V,E> g2, WeightCombiner operator)`
    `UnmodifiableDirectedGraph(DirectedGraph<V,E> g)` Creates a new unmodifiable directed graph based on the specified backing graph.

  - ### Uses of DirectedGraph in org.jgrapht.graph.builder

    Classes in org.jgrapht.graph.builder with type parameters of type DirectedGraph
    Modifier and Type | Class and Description
    --- | ---
    `class` | `DirectedGraphBuilder<V,E,G extends DirectedGraph<V,E>>` A builder class for `Graph`.
    `class` | `DirectedGraphBuilderBase<V,E,G extends DirectedGraph<V,E>,B extends DirectedGraphBuilderBase<V,E,G,B>>` Base class for `DirectedGraphBuilder` for extending.
    `class` | `DirectedWeightedGraphBuilder<V,E,G extends DirectedGraph<V,E> & WeightedGraph<V,E>>` A builder class for directed weighted graphs}.
    `class` | `DirectedWeightedGraphBuilderBase<V,E,G extends DirectedGraph<V,E> & WeightedGraph<V,E>,B extends DirectedWeightedGraphBuilderBase<V,E,G,B>>` Base class for `DirectedWeightedGraphBuilder` for extending.

  - ### Uses of DirectedGraph in org.jgrapht.traverse

    Constructors in org.jgrapht.traverse with parameters of type DirectedGraph
    Constructor and Description
    `TopologicalOrderIterator(DirectedGraph<V,E> dg)` Creates a new topological order iterator over the directed graph specified, with arbitrary tie-breaking in case of partial order.
    `TopologicalOrderIterator(DirectedGraph<V,E> dg, Queue<V> queue)` Creates a new topological order iterator over the directed graph specified, with a user-supplied queue implementation to allow customized control over tie-breaking in case of partial order.

Copyright © 2016. All rights reserved.