Given the capacities of edges in a directed graph, find the maximum amount of flow that you can pass through a single path from the source to the sink, for every possible choice of source and sink vertices.Can anyone give me an idea of how to approach this question using Floyd-Warshall algorithm. I am very curious after reading https://codeforces.net/blog/entry/117814