[graph] Dinic's algorithm and BGL
Hello. In the Boost Graph Library i can't find Dinic's algorithm (https://en.wikipedia.org/wiki/Dinic%27s_algorithm). I think there isn't implementation of this algo in the library. Why? Best regards, Alexander Zaitsev.
On Wed, Aug 24, 2016 at 12:34 PM, Зайцев Александр
Hello.
In the Boost Graph Library i can't find Dinic's algorithm ( https://en.wikipedia.org/wiki/Dinic%27s_algorithm). I think there isn't implementation of this algo in the library. Why?
It's difficult to say why any particular piece of functionality is *not* present in a library. However, if it interests you, why not implement it yourself following the Boost guidelines ( http://www.boost.org/development/requirements.html) and submit it as a PR to Graph? Best Regards, Jeff
Thanks for the answer. Maybe in the future i can implement it.
--
Best regards, Alexander Zaitsev
29.08.2016, 18:22, "Jeff Trull"
On Wed, Aug 24, 2016 at 12:34 PM, Зайцев Александр
wrote: Hello.
In the Boost Graph Library i can't find Dinic's algorithm ( https://en.wikipedia.org/wiki/Dinic%27s_algorithm). I think there isn't implementation of this algo in the library. Why?
It's difficult to say why any particular piece of functionality is *not* present in a library. However, if it interests you, why not implement it yourself following the Boost guidelines ( http://www.boost.org/development/requirements.html) and submit it as a PR to Graph?
Best Regards, Jeff
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
-- С уважением, Зайцев Александр.
participants (2)
-
Jeff Trull
-
Зайцев Александр