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.interfaces	Algorithm related interfaces.
org.jgrapht.alg.scoring	Vertex and/or edge scoring algorithms.
org.jgrapht.alg.shortestpath	Shortest-path related algorithms.
org.jgrapht.experimental.dag	Experimental package with directed acyclic graphs.
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	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.addIncomingEdges(DirectedGraph<V,E> graph, V target, java.lang.Iterable<V> sources)	Add edges from multiple source vertices to one target vertex.
static <V,E> void	Graphs.addOutgoingEdges(DirectedGraph<V,E> graph, V source, java.lang.Iterable<V> targets)	Add edges from one source vertex to multiple target vertices.
static <V,E> boolean	GraphTests.isStronglyConnected(DirectedGraph<V,E> graph)	Test whether a directed graph is strongly connected.
static <V,E> boolean	GraphTests.isWeaklyConnected(DirectedGraph<V,E> graph)	Test whether a directed graph is weakly connected.
static <V,E> java.util.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> boolean	Graphs.removeVertexAndPreserveConnectivity(DirectedGraph<V,E> graph, java.lang.Iterable<V> vertices)	Removes all the given vertices from the given graph.
static <V,E> boolean	Graphs.removeVertexAndPreserveConnectivity(DirectedGraph<V,E> graph, V vertex)	Removes the given vertex from the given graph.
static <V,E> boolean	Graphs.removeVerticesAndPreserveConnectivity(DirectedGraph<V,E> graph, java.util.function.Predicate<V> predicate)	Filters vertices from the given graph and subsequently removes them.
static <V,E> java.util.List<V>	Graphs.successorListOf(DirectedGraph<V,E> g, V vertex)	Returns a list of vertices that are the direct successors of a specified vertex.
static <V,E> boolean	Graphs.vertexHasPredecessors(DirectedGraph<V,E> graph, V vertex)	Check if a vertex has any direct predecessors.
static <V,E> boolean	Graphs.vertexHasSuccessors(DirectedGraph<V,E> graph, V vertex)	Check if a vertex has any direct successors.

Uses of DirectedGraph in org.jgrapht.alg

Fields in org.jgrapht.alg declared as DirectedGraph

Modifier and Type	Field	Description
private DirectedGraph<V,DefaultEdge>	BlockCutpointGraph.dfsTree	DFS (Depth-First-Search) tree.
private DirectedGraph<V,E>	AllDirectedPaths.graph	Deprecated.
private DirectedGraph<V,E>	BidirectionalDijkstraShortestPath.AlgorithmDetails.DirectedSpecifics.graph
(package private) DirectedGraph<V,E>	CycleDetector.graph	Graph on which cycle detection is being performed.
private DirectedGraph<V,E>	DirectedNeighborIndex.graph
private DirectedGraph<V,E>	GabowStrongConnectivityInspector.graph
private DirectedGraph<V,E>	KosarajuStrongConnectivityInspector.graph
private DirectedGraph<V,E>	NaiveLcaFinder.graph

Methods in org.jgrapht.alg that return DirectedGraph

Modifier and Type	Method	Description
DirectedGraph<V,E>	GabowStrongConnectivityInspector.getGraph()	Returns the graph inspected
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	Description
private void	GabowStrongConnectivityInspector.dfsVisit(DirectedGraph<V,E> visitedGraph, GabowStrongConnectivityInspector.VertexNumber<V> v)
private void	KosarajuStrongConnectivityInspector.dfsVisit(DirectedGraph<V,E> visitedGraph, KosarajuStrongConnectivityInspector.VertexData<V> vertexData, java.util.Set<V> vertices)
<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	Description
AllDirectedPaths(DirectedGraph<V,E> graph)	Deprecated. Create a new instance
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.
DirectedSpecifics(DirectedGraph<V,E> g)
GabowStrongConnectivityInspector(DirectedGraph<V,E> directedGraph)	The constructor of GabowStrongConnectivityInspector class.
KosarajuStrongConnectivityInspector(DirectedGraph<V,E> directedGraph)	The constructor of the StrongConnectivityAlgorithm class.
NaiveLcaFinder(DirectedGraph<V,E> graph)	Create a new instance of the native LCA finder.

Uses of DirectedGraph in org.jgrapht.alg.cycle

Fields in org.jgrapht.alg.cycle declared as DirectedGraph

Modifier and Type	Field	Description
private DirectedGraph<V,E>	HawickJamesSimpleCycles.graph
private DirectedGraph<V,E>	JohnsonSimpleCycles.graph
private DirectedGraph<V,E>	SzwarcfiterLauerSimpleCycles.graph
private DirectedGraph<V,E>	TarjanSimpleCycles.graph
private DirectedGraph<V,E>	TiernanSimpleCycles.graph

Methods in org.jgrapht.alg.cycle that return DirectedGraph

Modifier and Type	Method	Description
DirectedGraph<V,E>	DirectedSimpleCycles.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>	JohnsonSimpleCycles.getGraph()	Returns the graph on which the simple cycle search algorithm is executed by this object.
DirectedGraph<V,E>	SzwarcfiterLauerSimpleCycles.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>	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	Description
private boolean	JohnsonSimpleCycles.findCyclesInSCG(int startIndex, int vertexIndex, DirectedGraph<V,E> scg)
void	DirectedSimpleCycles.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	JohnsonSimpleCycles.setGraph(DirectedGraph<V,E> graph)	Sets the graph on which the simple cycle search algorithm is executed by this object.
void	SzwarcfiterLauerSimpleCycles.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	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	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.interfaces

Methods in org.jgrapht.alg.interfaces that return DirectedGraph

Modifier and Type	Method	Description
DirectedGraph<V,E>	StrongConnectivityAlgorithm.getGraph()	Returns the graph inspected by the StrongConnectivityAlgorithm.

Uses of DirectedGraph in org.jgrapht.alg.scoring

Fields in org.jgrapht.alg.scoring declared as DirectedGraph

Modifier and Type	Field	Description
private DirectedGraph<V,E>	PageRank.DirectedSpecifics.graph

Constructors in org.jgrapht.alg.scoring with parameters of type DirectedGraph

Constructor	Description
DirectedSpecifics(DirectedGraph<V,E> g)

Uses of DirectedGraph in org.jgrapht.alg.shortestpath

Fields in org.jgrapht.alg.shortestpath declared as DirectedGraph

Modifier and Type	Field	Description
private DirectedGraph<V,E>	AllDirectedPaths.graph
private DirectedGraph<V,E>	BidirectionalDijkstraShortestPath.DirectedSpecifics.graph
private DirectedGraph<V,E>	DijkstraClosestFirstIterator.DirectedSpecifics.graph

Constructors in org.jgrapht.alg.shortestpath with parameters of type DirectedGraph

Constructor	Description
AllDirectedPaths(DirectedGraph<V,E> graph)	Create a new instance
DirectedSpecifics(DirectedGraph<V,E> g)
DirectedSpecifics(DirectedGraph<V,E> g)

Uses of DirectedGraph in org.jgrapht.experimental.dag

Classes in org.jgrapht.experimental.dag that implement DirectedGraph

Modifier and Type	Class	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.graph

Classes in org.jgrapht.graph that implement DirectedGraph

Modifier and Type	Class	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>	A union of directed graphs.
class	DirectedMaskSubgraph<V,E>	A directed graph that is a MaskSubgraph of 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 of another 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 of another 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>	Read-only union of an undirected and a directed graph.
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.

Fields in org.jgrapht.graph declared as DirectedGraph

Modifier and Type	Field	Description
private DirectedGraph<V,E>	MixedGraphUnion.directedGraph

Constructors in org.jgrapht.graph with parameters of type DirectedGraph

Constructor	Description
AsUndirectedGraph(DirectedGraph<V,E> g)	Constructor for AsUndirectedGraph.
AsUnweightedDirectedGraph(DirectedGraph<V,E> g)	Constructor for AsUnweightedGraph.
AsWeightedDirectedGraph(DirectedGraph<V,E> g, java.util.Map<E,java.lang.Double> weightMap)	Constructor for AsWeightedGraph.
DirectedGraphUnion(DirectedGraph<V,E> g1, DirectedGraph<V,E> g2)	Construct a new directed graph union.
DirectedGraphUnion(DirectedGraph<V,E> g1, DirectedGraph<V,E> g2, WeightCombiner operator)	Construct a new directed graph union.
DirectedMaskSubgraph(DirectedGraph<V,E> base, java.util.function.Predicate<V> vertexMask, java.util.function.Predicate<E> edgeMask)	Create a new directed MaskSubgraph of another graph.
DirectedMaskSubgraph(DirectedGraph<V,E> base, MaskFunctor<V,E> mask)	Deprecated. in favor of using lambdas
DirectedSubgraph(DirectedGraph<V,E> base)	Creates a new directed induced subgraph with all vertices included.
DirectedSubgraph(DirectedGraph<V,E> base, java.util.Set<? extends V> vertexSubset)	Creates a new directed induced subgraph.
DirectedSubgraph(DirectedGraph<V,E> base, java.util.Set<? extends V> vertexSubset, java.util.Set<? extends 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)	Construct a new graph union.
MixedGraphUnion(UndirectedGraph<V,E> g1, DirectedGraph<V,E> g2, WeightCombiner operator)	Construct a new graph union.
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	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

Fields in org.jgrapht.traverse declared as DirectedGraph

Modifier and Type	Field	Description
private DirectedGraph<VV,EE>	AbstractGraphIterator.DirectedSpecifics.graph

Methods in org.jgrapht.traverse with parameters of type DirectedGraph

Modifier and Type	Method	Description
private static <V,E> V	TopologicalOrderIterator.initialize(DirectedGraph<V,E> dg, java.util.Queue<V> queue, java.util.Map<V,ModifiableInteger> inDegreeMap)	Initializes the internal traversal object structure.

Constructors in org.jgrapht.traverse with parameters of type DirectedGraph

Constructor	Description
DirectedSpecifics(DirectedGraph<VV,EE> g)	Creates a new DirectedSpecifics object.
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, java.util.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.
TopologicalOrderIterator(DirectedGraph<V,E> dg, java.util.Queue<V> queue, java.util.Map<V,ModifiableInteger> inDegreeMap)
TopologicalOrderIterator(DirectedGraph<V,E> dg, V start)