Uses of Class
edu.princeton.cs.algorithms.Digraph

Uses of Digraph in edu.princeton.cs.algorithms

Methods in edu.princeton.cs.algorithms that return Digraph

Modifier and Type	Method and 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.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.
Digraph	SymbolDigraph.G() Returns the digraph assoicated with the symbol graph.
static Digraph	DigraphGenerator.path(int V) Returns a path digraph on V vertices.
Digraph	Digraph.reverse() Returns 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 least) c strong components.
static Digraph	DigraphGenerator.tournament(int V) Returns a random tournament digraph on V vertices.

Constructors in edu.princeton.cs.algorithms with parameters of type Digraph

Constructor and Description
BreadthFirstDirectedPaths(Digraph G, int s) Computes the shortest path from s and every other vertex in graph G.
BreadthFirstDirectedPaths(Digraph G, Iterable<Integer> sources) Computes the shortest path from any one of the source vertices in sources to every other vertex in graph G.
DepthFirstDirectedPaths(Digraph G, int s) Computes a directed path from s to every other vertex in digraph G.
DepthFirstOrder(Digraph G) Determines a depth-first order for the digraph G.
Digraph(Digraph G) Initializes a new digraph that is a deep copy of G.
DirectedCycle(Digraph G) Determines whether the digraph G has a directed cycle and, if so, finds such a cycle.
DirectedDFS(Digraph G, int s) Computes the vertices in digraph G that are reachable from the source vertex s.
DirectedDFS(Digraph G, Iterable<Integer> sources) Computes the vertices in digraph G that are connected to any of the source vertices sources.
GabowSCC(Digraph G) Computes the strong components of the digraph G.
KosarajuSharirSCC(Digraph G) Computes the strong components of the digraph G.
TarjanSCC(Digraph G) Computes the strong components of the digraph G.
Topological(Digraph G) Determines whether the digraph G has a topological order and, if so, finds such a topological order.
TransitiveClosure(Digraph G) Computes the transitive closure of the digraph G.