public void traverse(Graph G) {
this.G = G;
visitedCount = 0;
visited = new ArrayList<Integer>();
for (int i = 0; i < G.V.size(); i++) {
if (!visited.contains(G.V.get(i).getV())) {
System.out.println("vertex: " + G.V.get(i).getV());
bfsVisit(G.V.get(i));
}
}
}
public Cut minCut(Graph g, EdgeFunction cap, int s, int t) {
maxFlow(g, cap, s, t);
BFS.bfsInit(gr);
BFS.bfsVisit(gr, s);
return new Cut(BFS.visited, flowValue);
}
