//
// Call Tomita on each component of the graph in turn
//

import java.util.*;
import java.io.*;

public class Prosser22 extends Tomita22 {
    
    private boolean[] visited;        // has a vertex been visited by dfs
    
    Prosser22 (String fname) throws IOException {super(fname);}

    void search(){
	D                     = new BitSet(n);
	BitSet C              = new BitSet(n);
	BitSet P              = new BitSet(n);
	BitSet X              = new BitSet(n);
	visited               = new boolean[n];
	searchTime            = System.currentTimeMillis();
	for (int v=0;v<n;v++)
	    if (!visited[v]){
		dfs(v,P);
		C.set(0,n,false);
		X.set(0,n,false);
	    try{expand(C,P,X);} catch (TimeOutException e){cliques = -cliques;}
	}
	searchTime = System.currentTimeMillis() - searchTime;
    }

    void dfs(int u,BitSet P){
	P.set(0,n,false);
	Stack<Integer> S = new Stack<Integer>();
	visited[u]       = true;
	S.push(u);
	while (!S.isEmpty()){
	    int v = S.pop();
	    for (int w=0;w<n;w++) if (N[v].get(w) && !visited[w]) {visited[w] = true; S.push(w);}
	    P.set(v,true);
	}
    }

}