Name the program for this assignment "udgraph.cc." The purpose of this program is to give you experience with graphs. Graphs are an important mathematical concept that have significant applications in computer sicience and other fields. In this assignment you will implement the ADT graph as a C++ class by using an adjacency-list to represent the graph. The graph will be unweighted and undirected. Include DFS and BFS traversals. Your program should also determine the DFS and BFS spanning trees for a connected graph. Run your program on the sample test graph provided. See sample test graph: A 2 B F B 3 A C F C 3 B D F D 2 C E E 2 D F F 4 A B C E
## Deliverables
Enter name of the file that contains the graph: graph_input I: The Graph's Adjacency-List Representation: 1. A -- B F 2. B -- A C F 3. C -- B D F 4. D -- C E 5. E -- D F 6. F -- A B C E II: Contents of BFS Queue = ABFCED III: Contents of DFS Queue = ABCDEF IV: The Graph is Connected V: BFS Spanning Tree: AF->FE->CD->BC->AB VI: DFS Spanning Tree: EF->DE->CD->BC->AB
## Platform
Visual C++ Windows XP