Class Digraph

java.lang.Object

Digraph

public class Digraph
extends java.lang.Object

The Digraph class represents an directed graph of vertices named 0 through V-1. It supports the following operations: add an edge to the graph, iterate over all of the neighbors incident to a vertex. Parallel edges and self-loops are permitted.

For additional documentation, see Section 4.2 of Algorithms, 4th Edition, by Robert Sedgewick and Kevin Wayne.

Constructor Summary

Constructors

Constructor and Description
Digraph(Digraph G) Copy constructor.
Digraph(In in) Create a digraph from input stream.
Digraph(int V) Create an empty digraph with V vertices.

Method Summary

Methods

Modifier and Type	Method and Description
void	addEdge(int v, int w) Add the directed edge v->w to the digraph.
java.lang.Iterable<java.lang.Integer>	adj(int v) Return the list of vertices pointed to from vertex v as an Iterable.
int	E() Return the number of edges in the digraph.
static void	main(java.lang.String[] args) Test client.
Digraph	reverse() Return the reverse of the digraph.
java.lang.String	toString() Return a string representation of the digraph.
int	V() Return the number of vertices in the digraph.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

Digraph

public Digraph(int V)

Create an empty digraph with V vertices.

Throws:

java.lang.IllegalArgumentException - if V < 0

Digraph

public Digraph(In in)

Create a digraph from input stream.

Digraph

public Digraph(Digraph G)

Copy constructor.

Method Detail

V

public int V()

Return the number of vertices in the digraph.

E

public int E()

Return the number of edges in the digraph.

addEdge

public void addEdge(int v,
           int w)

Add the directed edge v->w to the digraph.

Throws:

java.lang.IndexOutOfBoundsException - unless both 0 <= v < V and 0 <= w < V

adj

public java.lang.Iterable<java.lang.Integer> adj(int v)

Return the list of vertices pointed to from vertex v as an Iterable.

Throws:

java.lang.IndexOutOfBoundsException - unless 0 <= v < V

reverse

public Digraph reverse()

Return the reverse of the digraph.

toString

public java.lang.String toString()

Return a string representation of the digraph.

Overrides:

toString in class java.lang.Object

main

public static void main(java.lang.String[] args)

Test client.