int visited[]  = new int[m_nodes.size()];  for(int i=0; i<graphMatrix.length; i++) { if(visited[i]==0){ removeCycles2(i, visited); visited[i]=1; } }
int visited[]  = new int[m_nodes.size()];  for(int i=0; i<graphMatrix.length; i++) { if(visited[i]==0){ removeCycles2(i, visited); visited[i]=1; }
    protected void removeCycles() {	int visited[]  = new int[m_nodes.size()]; //visited[x]=1 is only  visited AND visited[x]=2 means node is visited  	                                          // and is on the current path	for(int i=0; i<graphMatrix.length; i++) {	    if(visited[i]==0){		removeCycles2(i, visited);		visited[i]=1;	    }	}    }