Assignment Set 8 (Uploaded on October 22, 2013)
Deadline date:  October 28, 2013

Assignment 1: 
Implement the following problem using C++: 
Given a social network containing N members and a log file containing 
M timestamps at which times pairs of members formed friendships, design 
an algorithm to determine the earliest time at which all members are 
connected (i.e., every member is a friend of a friend of a friend ... 
of a friend). Assume that the log file is sorted by timestamp and that 
friendship is an equivalence relation. The running time of your algorithm 
should be MlogN or better and use extra space proportional to N.


------------------------------------------------------------------------
At the top of each of your program files, add the following. If you are writing 
multi-file programs, then each file should have it. 

/*------------------------------------------------------------------
Name: 
Roll Number:
Date of Submission:
Deadline date:  
Program description:
Acknowledgements: 
--------------------------------------------------------------------*/