search

Team-Kek / Notebook

Implementations of algorithms that might be useful in ICPC.
1 stars 0 forks source link

Max flow algorithms #3

Open ZacharyForman opened 8 years ago

maxhwardg commented 8 years ago

Dfs, bfs, pfs and min cost Max flow are recommended.

ZacharyForman commented 8 years ago

What's the difference between {dfs, bfs, pfs} beyond runtime for max flow?

maxhwardg commented 8 years ago

It's only worst case run-time. That's it. It can sometimes be important, and it also means you get DFS/BFS/PFS templates in your notebook at no extra cost.

maxhwardg commented 8 years ago

Also, min-cost max-flow means you get Johnson's algorithm and/or Bellman-Ford for free, since both can be subroutines.