Novy alg. pro max tok

[Necroman]

Jen takova zajimavost, byl udajne ubjeven efektivnejsi postup pro nalezeni nejvetsiho toku v grafu:

http://web.mit.edu/newsoffice/2010/max- ... -0927.html
If N is the number of nodes in a graph, and L is the number of links between them, then the execution of the fastest previous max-flow algorithm was proportional to (N + L)^(3/2). The execution of the new algorithm is proportional to (N + L)^(4/3). For a network like the Internet, which has hundreds of billions of nodes, the new algorithm could solve the max-flow problem hundreds of times faster than its predecessor.