search

jeremy-murphy / graph-ancestry

Generic graph (and tree) algorithms.
GNU General Public License v3.0
1 stars 0 forks source link

New algorithm for max-flow #1

Open zamazan4ik opened 7 years ago

zamazan4ik commented 7 years ago

Hello. Do you want to implement new algorithm to Boost.Graph library? For example there a lot more effective algorithms for searching max flow on graph. E.g. you can implement Dinic algorithm.

zamazan4ik commented 7 years ago

maybe my repo can help you: https://github.com/ZaMaZaN4iK/Algorithms (sorry for Russian filenames and comments :( )

jeremy-murphy commented 7 years ago

Boost.Graph has a few max-flow algorithms already; why are these other ones better?

zamazan4ik commented 7 years ago

You can test it, of course :) But remember, that there are new algorithms for max-flow problems: link