Is there a way to have the Ford-Fulkerson algorithm return not just the maximum flow possible in a graph, but also the s-t path with maximum possible flow on each of its edg
