edu.princeton.cs.introcs

Class Graph

java.lang.Object

edu.princeton.cs.introcs.Graph

public class Graph
extends Object

The Graph class represents an undirected graph of vertices with string names. It supports the following operations: add an edge, add a vertex, get all of the vertices, iterate over all of the neighbors adjacent to a vertex, is there a vertex, is there an edge between two vertices. Self-loops are permitted; parallel edges are discarded.

For additional documentation, see Section 4.5 of Introduction to Programming in Java: An Interdisciplinary Approach by Robert Sedgewick and Kevin Wayne.

Constructor Summary

Constructors

Constructor and Description
Graph() Create an empty graph with no vertices or edges.
Graph(In in, String delimiter) Create an graph from given input stream using given delimiter.

Method Summary

Methods

Modifier and Type	Method and Description
void	addEdge(String v, String w) Add edge v-w to this graph (if it is not already an edge)
void	addVertex(String v) Add vertex v to this graph (if it is not already a vertex)
Iterable<String>	adjacentTo(String v) Return the set of neighbors of vertex v as in Iterable.
int	degree(String v) Degree of this vertex.
int	E() Number of edges.
boolean	hasEdge(String v, String w) Is v-w an edge in this graph?
boolean	hasVertex(String v) Is v a vertex in this graph?
static void	main(String[] args)
String	toString() Return a string representation of the graph.
int	V() Number of vertices.
Iterable<String>	vertices() Return the set of vertices as an Iterable.

Methods inherited from class java.lang.Object

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

Constructor Detail

Graph

public Graph()

Create an empty graph with no vertices or edges.

Graph

public Graph(In in,
     String delimiter)

Create an graph from given input stream using given delimiter.

Method Detail

V

public int V()

Number of vertices.

E

public int E()

Number of edges.

degree

public int degree(String v)

Degree of this vertex.

addEdge

public void addEdge(String v,
           String w)

Add edge v-w to this graph (if it is not already an edge)

addVertex

public void addVertex(String v)

Add vertex v to this graph (if it is not already a vertex)

vertices

public Iterable<String> vertices()

Return the set of vertices as an Iterable.

adjacentTo

public Iterable<String> adjacentTo(String v)

Return the set of neighbors of vertex v as in Iterable.

hasVertex

public boolean hasVertex(String v)

Is v a vertex in this graph?

hasEdge

public boolean hasEdge(String v,
              String w)

Is v-w an edge in this graph?

toString

public String toString()

Return a string representation of the graph.

Overrides:

toString in class Object

main

public static void main(String[] args)