Class EdgeWeightedDigraph

java.lang.Object

EdgeWeightedDigraph

public class EdgeWeightedDigraph
extends java.lang.Object

The EdgeWeightedDigraph class represents an directed graph of vertices named 0 through V-1, where each edge has a real-valued weight. It supports the following operations: add an edge to the digraph, iterate over all of edges leaving a vertex. Parallel edges and self-loops are permitted.

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

Constructor Summary

Constructors

Constructor and Description
EdgeWeightedDigraph(EdgeWeightedDigraph G) Copy constructor.
EdgeWeightedDigraph(In in) Create an edge-weighted digraph from input stream.
EdgeWeightedDigraph(int V) Create an empty edge-weighted digraph with V vertices.
EdgeWeightedDigraph(int V, int E) Create a edge-weighted digraph with V vertices and E edges.

Method Summary

Methods

Modifier and Type	Method and Description
void	addEdge(DirectedEdge e) Add the directed edge e to this digraph.
java.lang.Iterable<DirectedEdge>	adj(int v) Return the edges incident from vertex v as an Iterable.
int	E() Return the number of edges in this digraph.
java.lang.Iterable<DirectedEdge>	edges() Return all edges in this digraph as an Iterable.
static void	main(java.lang.String[] args) Test client.
int	outdegree(int v) Return number of edges incident from v.
java.lang.String	toString() Return a string representation of this digraph.
int	V() Return the number of vertices in this digraph.

Methods inherited from class java.lang.Object

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

Constructor Detail

EdgeWeightedDigraph

public EdgeWeightedDigraph(int V)

Create an empty edge-weighted digraph with V vertices.

EdgeWeightedDigraph

public EdgeWeightedDigraph(int V,
                   int E)

Create a edge-weighted digraph with V vertices and E edges.

EdgeWeightedDigraph

public EdgeWeightedDigraph(In in)

Create an edge-weighted digraph from input stream.

EdgeWeightedDigraph

public EdgeWeightedDigraph(EdgeWeightedDigraph G)

Copy constructor.

Method Detail

V

public int V()

Return the number of vertices in this digraph.

E

public int E()

Return the number of edges in this digraph.

addEdge

public void addEdge(DirectedEdge e)

Add the directed edge e to this digraph.

adj

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

Return the edges incident from vertex v as an Iterable. To iterate over the edges incident from vertex v in digraph G, use foreach notation: for (DirectedEdge e : G.adj(v)).

edges

public java.lang.Iterable<DirectedEdge> edges()

Return all edges in this digraph as an Iterable. To iterate over the edges in the digraph, use foreach notation: for (DirectedEdge e : G.edges()).

outdegree

public int outdegree(int v)

Return number of edges incident from v.

toString

public java.lang.String toString()

Return a string representation of this digraph.

Overrides:

toString in class java.lang.Object

main

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

Test client.