Uses of Interface
org.graph4j.Digraph

Packages that use Digraph

Package	Description
org.graph4j	The main interfaces and classes for representing and using graphs.
org.graph4j.connectivity	Algorithms for analyzing connectivity of graphs and digraphs.
org.graph4j.generators	Graph generators of various kinds.
org.graph4j.isomorphism	Algorithms for testing graph isomorphism.
org.graph4j.measures	Classes responsible with calculating various graph measures (degrees, number of traingles, etc.).
org.graph4j.ordering	Algorithms that produce various orderings of the vertices of a graph.
org.graph4j.realization	Algorithms for graph realization problems.
org.graph4j.support	Support algorithms for various type of graphs (bipartite, tournament, etc.).
org.graph4j.traversal	Implementations of the depth-first search (DFS) and breadth-first search (BFS) algorithms, using both iterator and visitor patterns.

Uses of Digraph in org.graph4j

Subinterfaces of Digraph in org.graph4j

Modifier and Type	Interface	Description
interface	DirectedMultigraph<V,E>	Multiple (parallel) edges are allowed.
interface	DirectedPseudograph<V,E>	Multiple (parallel) edges are allowed.
interface	Network<V,E>	Represents a single commodity transportation (flow) network.

Fields in org.graph4j declared as Digraph

Modifier and Type	Field	Description
protected final Digraph	DirectedGraphAlgorithm.graph

Methods in org.graph4j that return Digraph

Modifier and Type	Method	Description
Digraph	GraphBuilder.buildDigraph()	Builds a directed graph, without multiple edges or self loops.
Digraph<V,E>	Digraph.complement()	Creates the complement of the digraph.
Digraph<V,E>	Digraph.copy()	Creates an identical copy of the digraph.
static Digraph	GraphUtils.createAcyclicOrientation(Graph graph)	Creates the acyclic orientation of an undirected graph.
static Digraph<Edge,Object>	GraphUtils.createLineGraph(Digraph digraph)	Creates the line graph of a directed graph.
default Digraph<V,E>	Digraph.subgraph(int... vertices)
Digraph<V,E>	Digraph.subgraph(Collection<Edge> edges)
Digraph<V,E>	Digraph.subgraph(VertexSet vertexSet)
static Digraph	GraphUtils.toDigraph(Graph graph)	The corresponding directed graph of an undirected graph G has all the vertices of G and a pair of symmetrical arcs for each edge of G.
static Digraph	GraphUtils.transpose(Digraph digraph)	Creates the transpose of a directed graph.

Methods in org.graph4j with parameters of type Digraph

Modifier and Type	Method	Description
static Digraph<Edge,Object>	GraphUtils.createLineGraph(Digraph digraph)	Creates the line graph of a directed graph.
static boolean	GraphTests.isArborescence(Digraph digraph)	Determines if a directed graph is an arborescence (also called poly-tree), that is a directed rooted tree in which all edges point away from the root.
static boolean	GraphTests.isBranching(Digraph digraph)	Determines if a directed graph is a branching (also called poly-forest), that is a collection of disjoint arborescences.
static boolean	GraphTests.isStronglyConnected(Digraph digraph)	Determines if a directed graph is strongly connected, that is for every pair of vertices u and v, there exists both directed paths from u to v and from v to u.
static boolean	GraphTests.isUnilateralConnected(Digraph digraph)	Determines if a directed graph is unilateral connected, that is for every pair of vertices u and v, there exists either a directed path from u to v or one from v to u.
static boolean	GraphTests.isWeaklyConnected(Digraph digraph)	Determines if a directed graph is weakly connected, that is its support graph is connected.
static Digraph	GraphUtils.transpose(Digraph digraph)	Creates the transpose of a directed graph.

Constructors in org.graph4j with parameters of type Digraph

Modifier	Constructor	Description
	DirectedGraphAlgorithm(Digraph graph)

Uses of Digraph in org.graph4j.connectivity

Methods in org.graph4j.connectivity that return Digraph

Modifier and Type	Method	Description
Digraph<Digraph,Integer>	StrongConnectivityAlgorithm.createCondensation()	Each strongly connected component is contracted to a single vertex, the resulting graph is a directed acyclic graph, the condensation.
Digraph<Digraph,Integer>	TarjanStrongConnectivity.createCondensation()

Methods in org.graph4j.connectivity that return types with arguments of type Digraph

Modifier and Type	Method	Description
Digraph<Digraph,Integer>	StrongConnectivityAlgorithm.createCondensation()	Each strongly connected component is contracted to a single vertex, the resulting graph is a directed acyclic graph, the condensation.
Digraph<Digraph,Integer>	TarjanStrongConnectivity.createCondensation()
List<Digraph>	StrongConnectivityAlgorithm.getStronglyConnectedComponents()
List<Digraph>	TarjanStrongConnectivity.getStronglyConnectedComponents()

Methods in org.graph4j.connectivity with parameters of type Digraph

Modifier and Type	Method	Description
static StrongConnectivityAlgorithm	StrongConnectivityAlgorithm.getInstance(Digraph digraph)

Constructors in org.graph4j.connectivity with parameters of type Digraph

Modifier	Constructor	Description
	TarjanStrongConnectivity(Digraph digraph)

Uses of Digraph in org.graph4j.generators

Methods in org.graph4j.generators that return Digraph

Modifier and Type	Method	Description
Digraph	TournamentGenerator.createAcyclic()	Creates an acyclic tournament.
Digraph	RandomTreeGenerator.createArborescence()	Creates a random arborescence.
Digraph	RandomDAGGenerator.createDAG()
Digraph	AbstractBipartiteGenerator.createDigraph(Boolean leftToRight)
Digraph	CompleteGraphGenerator.createDigraph()
Digraph	CycleGenerator.createDigraph(boolean clockwise)
Digraph	GridGenerator.createDigraph()	Edges are oriented from left to right and top to bottom.
Digraph	PathGenerator.createDigraph(boolean leftToRight)
Digraph	RandomGnmBipartiteGenerator.createDigraph()
Digraph	RandomGnmGraphGenerator.createDigraph()
Digraph	RandomGnpBipartiteGenerator.createDigraph()
Digraph	RandomGnpGraphGenerator.createDigraph()
Digraph	RandomHamiltonianGenerator.createDigraph()
Digraph	RegularGraphGenerator.createDigraph()
Digraph	StarGenerator.createDigraph(boolean outward)
Digraph	WheelGenerator.createDigraph(boolean clockwise, boolean outward)	Creates a directed wheel graph.
Digraph	TournamentGenerator.createRandom()	Creates a random tournament.
static Digraph	GraphGenerator.randomArborescence(int numVertices)	Generates a random arborescence.
static Digraph	GraphGenerator.randomDAG(int numVertices, double edgeProbability)	Generates a random directed acyclic graph (DAG).
static Digraph	GraphGenerator.randomTournament(int numVertices)	Generates a random tournament graph.

Uses of Digraph in org.graph4j.isomorphism

Fields in org.graph4j.isomorphism declared as Digraph

Modifier and Type	Field	Description
protected final Digraph	OrderedDigraph.dg
protected final Digraph	AbstractGraphIsomorphism.dg1
protected final Digraph	AbstractGraphIsomorphism.dg2

Methods in org.graph4j.isomorphism that return Digraph

Modifier and Type	Method	Description
Digraph	OrderedDigraph.getGraph()

Methods in org.graph4j.isomorphism with parameters of type Digraph

Modifier and Type	Method	Description
protected abstract State	AbstractGraphIsomorphism.getStateInstance(Digraph g1, Digraph g2, boolean cache)
protected State	UllmanExactGraphIsomorphism.getStateInstance(Digraph g1, Digraph g2, boolean cache)
protected State	UllmanSubGraphIsomorphism.getStateInstance(Digraph g1, Digraph g2, boolean cache)
protected State	VF2ExactGraphIsomorphism.getStateInstance(Digraph g1, Digraph g2, boolean cache)
protected State	VF2SubGraphIsomorphism.getStateInstance(Digraph g1, Digraph g2, boolean cache)

Constructors in org.graph4j.isomorphism with parameters of type Digraph

Modifier	Constructor	Description
	AbstractUllmanState(Digraph g1, Digraph g2)
	AbstractUllmanState(Digraph g1, Digraph g2, boolean cache)
	AbstractVF2State(Digraph g1, Digraph g2)
	AbstractVF2State(Digraph g1, Digraph g2, boolean cache)	Constructor for the initial state of the search algorithm.
	OrderedDigraph(Digraph dg)
	OrderedDigraph(Digraph dg, boolean cache)	Constructor that orders the vertices of the given digraph according to their degree.
	UllmanExactState(Digraph g1, Digraph g2)
	UllmanExactState(Digraph g1, Digraph g2, boolean cache)
	UllmanSubState(Digraph g1, Digraph g2)
	UllmanSubState(Digraph g1, Digraph g2, boolean cache)
	VF2ExactState(Digraph g1, Digraph g2)
	VF2ExactState(Digraph g1, Digraph g2, boolean cache)
	VF2SubState(Digraph g1, Digraph g2, boolean cache)

Uses of Digraph in org.graph4j.measures

Methods in org.graph4j.measures with parameters of type Digraph

Modifier and Type	Method	Description
static double	GraphMeasures.avgIndegree(Digraph digraph)	Determines the average indegree of vertices.
static double	GraphMeasures.avgOutdegree(Digraph digraph)	Determines the average outdegree of vertices.
static double	GraphMeasures.density(Digraph digraph)
static int[]	GraphMeasures.indegreeHistogram(Digraph digraph)	The indegree histogram counts how many vertices have a specific indegree in the digraph.
static int	GraphMeasures.maxIndegree(Digraph digraph)	Determines the maximum indegree of the vertices.
static int	GraphMeasures.maxIndegreeVertex(Digraph digraph)	Determines a vertex with maximum indegree.
static int	GraphMeasures.maxOutdegree(Digraph digraph)	Determines the maximum outdegree of the vertices.
static int	GraphMeasures.maxOutdegreeVertex(Digraph digraph)	Determines a vertex with maximum outdegree.
static int	GraphMeasures.minIndegree(Digraph digraph)	Determines the minimum indegree of the vertices.
static int	GraphMeasures.minIndegreeVertex(Digraph digraph)	Determines a vertex with minimum indegree.
static int	GraphMeasures.minOutdegree(Digraph digraph)	Determines the minimum outdegree of the vertices.
static int	GraphMeasures.minOutdegreeVertex(Digraph digraph)	Determines a vertex with minimum outdegree.
static int[]	GraphMeasures.outdegreeHistogram(Digraph digraph)	The outdegree histogram counts how many vertices have a specific outdegree in the digraph.

Uses of Digraph in org.graph4j.ordering

Methods in org.graph4j.ordering that return Digraph

Modifier and Type	Method	Description
Digraph	AcyclicOrientation.create()

Methods in org.graph4j.ordering with parameters of type Digraph

Modifier and Type	Method	Description
static int[]	VertexOrderings.topological(Digraph graph)	Computes a vertex ordering of a directed graph such that for every directed edge (u,v) from vertex u to vertex v, u comes before v in the ordering.

Constructors in org.graph4j.ordering with parameters of type Digraph

Modifier	Constructor	Description
	TopologicalOrdering(Digraph digraph)

Uses of Digraph in org.graph4j.realization

Methods in org.graph4j.realization that return Digraph

Modifier and Type	Method	Description
Digraph	DigraphRealizationAlgorithm.getDigraph()	Creates a directed graph with the specified in-degrees and out-degrees.
Digraph	KleitmanWangDigraphRealization.getDigraph()

Uses of Digraph in org.graph4j.support

Constructors in org.graph4j.support with parameters of type Digraph

Modifier	Constructor	Description
	TournamentSupport(Digraph graph)

Uses of Digraph in org.graph4j.traversal

Constructors in org.graph4j.traversal with parameters of type Digraph

Modifier	Constructor	Description
	TopologicalOrderIterator(Digraph graph)	Creates a topological order iterator for a directed graph.