How to solve this? 
Difference between en1 and en2, changed 10 character(s)
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-Marshall algorithm. I am very curious after reading [this].(https://mirror.codeforces.com/blog/entry/117814)

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English Alexrider726 2023-07-01 10:09:12 2 Tiny change: 'ing Floyd-Marshall al' -> 'ing Floyd-Warshall al'
en2 English Alexrider726 2023-07-01 10:06:52 10 (published)
en1 English Alexrider726 2023-07-01 10:05:33 398 Initial revision (saved to drafts)