Due

Assignment

1. Complete the implementation of the Connectivity class (.h file and supporting classes available in Examples)
2. Test the class using the implementation of the DenseGraph.
   1. Modify mainDG.cpp to create a graph of 30 vertices and 50 random edges.
   2. Output the graph and the number of connected components.
   3. Randomly choose 5 pairs of numbers and check if they are connected.
3. Analyze the class in terms of the space required for the private data fields and the time to execute each method including the constructor using Big-O.