CSCI 2300 Lab 4 Fall 2011, 9/28/11

This lab is about graphs and algorithms and divide and conquer algorithms. You are welcome to start working on the lab ahead of time.
  1. Implement any O(n2) algorithm to find pluraility of a given set of n numbers. You are allowed to compare all pairs or use the algorithm described in Section 3 of the paper. Plurality
  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. Add a connectedness functionality to the DFS function in graph class to test whether a given graph is connected or not (use the DFS procedure to do this).