CS009-2
Chapter 13 Homework

1. Give 2 examples of things that can be described as graphs; in 
   each case, identify what are the nodes (vertices) and what are 
   the arcs (edges).
    
2. What is a tree?

3. Graph A is an undirected graph with nodes {1,2,3,4} and 
   links { {1,2}, {2,3}, {3,4}, {4,1}, {2,4} }.  Draw graph A.

4. Graph B is an undirected graph with nodes {1,2,3,4,5,6,7} and 
   links { {1,2}, {1,3}, {2,4}, {2,5}, {3,6}, {3,7} }.  If we started 
   at node 1  which algorithm would get to node 5 first, DFS or BFS? 

5. Give the adjacency matrix for Graph A in #3.
 
6. Given Graph B in #4, in the book, write down the order in which the nodes
would be visited by each of DFS and BFS.