/** 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();

    g.addVertex("Pickens");
    g.addVertex("Rosman");
    g.addVertex("Easley");
    g.addVertex("Brevard");
    g.addVertex("Furman");
    g.addEdge("Pickens", "Rosman", 25);
    g.addEdge("Furman", "Pickens", 17);
    g.addEdge("Easley", "Pickens", 8);
    g.addEdge("Rosman", "Brevard", 10);
    g.addEdge("Furman", "Rosman", 40);

    System.out.println(g);

    System.out.println("Neighbors of Furman:");
    Iterator iter = g.neighborIterator("Furman");
    while(iter.hasNext())
      System.out.println("\t" + iter.next());

    // Now let's travel around the graph using a breadth-first search!
    System.out.println("\nBFS starting at Furman:");
    iter = g.BFSIterator("Furman");
    while(iter.hasNext())
      System.out.println("\t" + iter.next());

    // Now let's try DFS.
    System.out.println("\nDFS starting at Furman:");
    iter = g.DFSIterator("Furman");
    while(iter.hasNext())
      System.out.println("\t" + iter.next());
  }
}