n a clique, there is an edge between any two nodes. In this homework, you are asked to find and print the nodes of the largest clique you can find in an undirected graph within three minutes. For example, if you find a 700-node-clique and a 800-node-clique, you have to print the nodes in the 800-node-clique.
The input starts with a number n (1<n<100,000), indicating that there are n nodes and nodes’ id is from 0 to n-1 in the undirected graph.
Then, the edges in the graph are given. Each line has one edge, and the format of each line is:
node_id1 node_id2
Each line contains two node_ids, indicating that there is an edge between these two vertices.
For example
0 1
0 2
It means that there is an edge between node 0 and node 1, and there is an edge between node 0 and node 1.
The input terminates with an EOF. Each test case contains only one set of n and edges in the graph.
Please output the node id in the clique in increasing order, separated by '\n'.
You need to output '\n' at the end of the line.
The time limit of each test case is 3 minutes. A brutal-force algorithm may cause TLE in the third test case.