Dinic's Algorithm For Unit Capacity Graph

Revision en1, by 013, 2016-04-21 13:26:15

Here it is written that Dinic's algorithm can run in O(min{V3 / 2, E1 / 2}E) time for graphs with unit capacity edges. Do I need to modify dinic's code in order to achieve that time bound? If yes can anyone give me an example code.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English 013 2016-04-21 13:26:15 343 Initial revision (published)