Coursera-Algotithms学习

Week1 Job Interview Question

Social network connectivity. 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.

public class SocialNet {
    private int N;
    private String InputFileName;
    public SocialNet(int N,String InputFileName){
        this.N = N;
        this.InputFileName = InputFileName;
    }
    public String getTimeString(){
        WeightedQuickUnionUF wQUF = new WeightedQuickUnionUF(N);
        In fin = new In(InputFileName);
        while(fin.hasNextLine()){
            String[] lineSplit = fin.readLine().split(" ");
            wQUF.union(Integer.parseInt(lineSplit[1]), Integer.parseInt(lineSplit[2]));
            if(wQUF.count() == 1){
                return lineSplit[0];
            }
        }
        return "Never";
    }
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        SocialNet sn = new SocialNet(10,"SocialNetInput.txt");
        System.out.println(sn.getTimeString());
    }
}

 input File:

20130101 0 2
20130201 0 4
20130301 2 3
20130401 3 4
20130501 4 5
20130601 3 6
20130701 5 6
20130801 2 6
20130901 1 2
20131001 7 3
20131101 0 9
20131201 4 8
20131202 4 3