// // Using adjacency lists // import java.util.*; import java.io.*; public class SparseEnumerate { static int[] degree; // degree of vertices static ArrayList[] A; // adjacency lists, sorted! static int n,m,maxDeg,minDeg,isolated; static void readGraph(String fname) throws IOException { MyIo fin = new MyIo(fname,", "); n = fin.getNextInt(); m = fin.getNextInt(); degree = new int[n]; A = new ArrayList[n]; for (int i=0;i(); m = 0; //for (int i=0;i 3) bk.timeLimit = 1000 * (long)Integer.parseInt(args[3]); long cpuTime = System.currentTimeMillis(); bk.search(); cpuTime = System.currentTimeMillis() - cpuTime; cpuTimeTotal = System.currentTimeMillis() - cpuTimeTotal; System.out.println(bk.cliques +" "+ bk.nodes +" "+ bk.searchTime +" "+ bk.sortTime +" "+ cpuTimeTotal); } }