Uses of Class
algs42.Digraph

Packages that use Digraph

Package	Description
algs42

Uses of Digraph in algs42

Methods in algs42 that return Digraph

Modifier and Type	Method	Description
static Digraph	DigraphGenerator.binaryTree(int V)	Returns a complete binary tree digraph on V vertices.
static Digraph	DigraphGenerator.complete(int V)	Returns the complete digraph on V vertices.
static Digraph	DigraphGenerator.copy(Digraph G)
static Digraph	DigraphGenerator.cycle(int V)	Returns a cycle digraph on V vertices.
static Digraph	DigraphGenerator.dag(int V, int E)	Returns a random simple DAG containing V vertices and E edges.
static Digraph	DigraphGenerator.eulerianCycle(int V, int E)	Returns an Eulerian cycle digraph on V vertices.
static Digraph	DigraphGenerator.eulerianPath(int V, int E)	Returns an Eulerian path digraph on V vertices.
static Digraph	DigraphGenerator.fromIn(In in)
Digraph	SymbolDigraph.G()
static Digraph	MyEuler.inOutEqual(int V, int E)
static Digraph	DigraphGenerator.path(int V)	Returns a path digraph on V vertices.
static Digraph	DigraphGenerator.random(int V, int E)	Create a random digraph with V vertices and E edges.
Digraph	Digraph.reverse()	Return the reverse of the digraph.
static Digraph	DigraphGenerator.rootedInDAG(int V, int E)	Returns a random rooted-in DAG on V vertices and E edges.
static Digraph	DigraphGenerator.rootedInTree(int V)	Returns a random rooted-in tree on V vertices.
static Digraph	DigraphGenerator.rootedOutDAG(int V, int E)	Returns a random rooted-out DAG on V vertices and E edges.
static Digraph	DigraphGenerator.rootedOutTree(int V)	Returns a random rooted-out tree on V vertices.
static Digraph	DigraphGenerator.simple(int V, double p)	Returns a random simple digraph on V vertices, with an edge between any two vertices with probability p.
static Digraph	DigraphGenerator.simple(int V, int E)	Returns a random simple digraph containing V vertices and E edges.
static Digraph	DigraphGenerator.strong(int V, int E, int c)	Returns a random simple digraph on V vertices, E edges and (at most) c strong components.
static Digraph	DigraphGenerator.tournament(int V)	Returns a random tournament digraph on V vertices.

Methods in algs42 with parameters of type Digraph

Modifier and Type	Method	Description
static Digraph	DigraphGenerator.copy(Digraph G)
static boolean	MyEuler.isTour(Digraph G, Iterable<Integer> tour)

Constructors in algs42 with parameters of type Digraph

Modifier	Constructor	Description
	BreadthFirstDirectedPaths(Digraph G, int s)
	BreadthFirstDirectedPaths(Digraph G, Iterable<Integer> sources)
	DepthFirstDirectedPaths(Digraph G, int s)
	DepthFirstOrder(Digraph G)
	Digraph(Digraph G)	Initializes a new digraph that is a deep copy of the specified digraph.
	DirectedCycle(Digraph G)
	DirectedDFS(Digraph G, int s)
	DirectedDFS(Digraph G, Iterable<Integer> sources)
	DirectedEulerianCycle(Digraph G)	Computes an Eulerian cycle in the specified digraph, if one exists.
	DirectedEulerianPath(Digraph G)	Computes an Eulerian path in the specified digraph, if one exists.
	KosarajuSharirSCC(Digraph G)
	MyDegrees(Digraph G)
	MyEuler(Digraph G)
	MyGarbageCollector(Digraph G)
	Topological(Digraph G)
	TransitiveClosure(Digraph G)
	XBruteSCC(Digraph G)
	XGabowSCC(Digraph G)
	XKosarajuSharirReverseSCC(Digraph G)
	XShortestDirectedCycle(Digraph G)
	XTarjanSCC(Digraph G)
	XTopologicalQueue(Digraph G)