public class TestDigraph {
    public static void main(String[] args) {

	Digraph g = new Digraph();
	g.addVertex("A");
	g.addVertex("B");
	g.addVertex("C");
	g.addVertex("D");
	g.addVertex("E");
	g.addVertex("F");
	g.addVertex("G");
	g.addVertex("H");
	g.addVertex("I");
	g.addEdge("A","B");
	g.addEdge("A","C");
	g.addEdge("B","D");
	g.addEdge("B","E");
	g.addEdge("C","F");
	g.addEdge("C","G");

	System.out.println(g);

	System.out.println(g.getBFS("A"));
	System.out.println(g.getDFS("A"));

	g.addEdge("B","G");

	System.out.println(g.search("I"));
	System.out.println(g.search("X"));

	System.out.println(g.getBFS("A"));
	System.out.println(g.getDFS("A"));

	Digraph g2 = new Digraph();
	g2.addVertex("A");
	g2.addVertex("B");
	g2.addVertex("C");
	g2.addVertex("D");
	g2.addVertex("E");
	g2.addVertex("F");
	g2.addVertex("G");
	g2.addVertex("H");
	g2.addVertex("I");
	g2.addEdge("A","D");
	g2.addEdge("A","B");
	g2.addEdge("A","E");
	g2.addEdge("B","E");
	g2.addEdge("C","B");
	g2.addEdge("D","G");
	g2.addEdge("E","F");
	g2.addEdge("E","H");
	g2.addEdge("F","C");
	g2.addEdge("F","H");
	g2.addEdge("G","H");
	g2.addEdge("H","I");
	g2.addEdge("I","F");
	

	System.out.println(g2.getBFS("A"));
	System.out.println(g2.getDFS("A"));
	System.out.println(g2.unweightedShortestPath("A","I"));
	
    }



}