Returns tne maximum number of edge - disjoint paths from s to t . This function is copy of goo . gl / wtQ4Ks forFulkerson ( ) discussed at http :
static int findDisjointPaths ( int [ , ] graph , int s , int t ) { int u , v ;