title: Minimum cut in a non directed graph with links without weight
body: <p>I need to found the minimum cut in a non directed graph. I know this is possible by using any flow algorithm, like Ford-Fulkerson, Edmonds Karp or Relable-to-Front. But since the links have no weight (or all have the same weight). Is this possible to solve by just using a DFS or a BFS? Note, I just need to know the number of links that are cut, no need to find which links.</p>
  
  <p>Thanks.</p>