CSCI 2300 Lab 4 Fall 2014, 9/24/2014

This lab is about graphs and algorithms. You are welcome to start working on the lab ahead of time. Please read beginning of Chapter 3.
  1. Please take a look at Graph (Friendship Graph) List the nodes, List number of edges, degress of each node and average degree. If your browser does not display the svg files here is an image graph (same graph) (Interested readers may look at Frienship you can count on )
  2. Add a DFS procedure to the Graph Class (Sample) and Sample Data (input) for unweighted graph. and display the DFS spanning tree and the prenumbering and postnumbering of vertices (Please read the given Graph Class carefully and see the different functions associated with Graph Class - You are welcome to use your own Graph Class).
  3. Find the maximum number of edges a connected undirected graph with n nodes can have. What is the maximum degree in such a graph and what is the average degree in such a graph?
  4. Do Exercise 3.6 a and b of DG (page 102 in PDF version and page 96 in print version)