/** Let's make use of our Graph class.  Create some vertices and edges,
 *  and show the representation.
 */
import java.util.*;

public class Driver
{
  public static void main(String [] args)
  {
    Graph g = new Graph();

    Vertex b = new Vertex("Boston");
    Vertex c = new Vertex("Chicago");
    Vertex d = new Vertex("Denver");
    Vertex h = new Vertex("Houston");
    Vertex m = new Vertex("Miami");
    Vertex p = new Vertex("Pittsburgh");
    Vertex s = new Vertex("Seattle");
    g.addVertex(b);
    g.addVertex(c);
    g.addVertex(d);
    g.addVertex(h);
    g.addVertex(m);
    g.addVertex(p);
    g.addVertex(s);
    g.addEdge(b, c, 983);
    g.addEdge(b, p, 597);
    g.addEdge(c, p, 457);
    g.addEdge(h, s, 2348);
    g.addEdge(m, s, 3389);
    g.addEdge(p, s, 2317);
    g.addEdge(h, p, 1395);
    g.addEdge(c, m, 1390);
    g.addEdge(c, s, 2052);
    g.addEdge(b, h, 1886);

    System.out.println("Here is the graph:");
    System.out.println(g);

    // 1.  Let's delete some things from the graph.

    g.deleteEdge(m, s);
    g.deleteVertex(c);
    
    System.out.println("\nThe graph after deleting an edge & a vertex:");
    System.out.println(g);

    // 2.  Let's iterate over all vertices in the entire graph...

    System.out.println("\nPractice with vertex iterator.");
    Iterator iter = g.vertexIterator();
    while (iter.hasNext())
      System.out.println("next vertex:  " + iter.next());
  }
}