private static void dfsR(int node){
		if(visited[node] == true) return;
		visited[node] = true;
			for(Integer neighbor:gR.get(node)){
				dfsR(neighbor);
			}
		removed[node] = true;
		if(cost[node]<min){
			min = cost[node];
			minCount=1;
		} else if (cost[node]==min){
			minCount++;
		}
	}