The maximum flow2006-02-08

Sources program, located in the maximum flow graph. Sources presented at 2 languages: C + + and Delphi (Pascal). Search maximum flow method of Ford-Falkersona. Search queue along the way. Graf kept contiguity list. The required memory - 6E +4 V (where E - the number of arcs in box; V - the number tops). The complexity of the algorithm - O (E ^ 2 * V).

Leave Comment

( Your nick or real name. Will be shown in comment's header )
( Your e-mail. Used for connection with administration. Will NOT be shown )
Site, ICQ or Jabber:
( This field wil be shown in comment's header near your name )
( How do you evaluate the material? By default assessment does not put )
Insert integer, shown on picture Image :
Comment's Text: