How to solve this?

Правка en3, от Alexrider726, 2023-07-01 10:09:12

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://mirror.codeforces.com/blog/entry/117814

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский Alexrider726 2023-07-01 10:09:12 2 Tiny change: 'ing Floyd-Marshall al' -> 'ing Floyd-Warshall al'
en2 Английский Alexrider726 2023-07-01 10:06:52 10 (published)
en1 Английский Alexrider726 2023-07-01 10:05:33 398 Initial revision (saved to drafts)