Subject: Re: [boost] [graph] Dinic's algorithm and BGL
From: ÐÐ°Ð¹ÑÐµÐ² ÐÐ»ÐµÐºÑÐ°Ð½Ð´Ñ (zamazan4ik_at_[hidden])
Date: 2016-08-29 14:23:21
Thanks for the answer. Maybe in the future i can implement it.
-- Best regards, Alexander Zaitsev 29.08.2016, 18:22, "Jeff Trull" <edaskel_at_[hidden]>: > On Wed, Aug 24, 2016 at 12:34 PM, ÐÐ°Ð¹ÑÐµÐ² ÐÐ»ÐµÐºÑÐ°Ð½Ð´Ñ <zamazan4ik_at_[hidden]> > 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 --Â Ð¡ ÑÐ²Ð°Ð¶ÐµÐ½Ð¸ÐµÐ¼, ÐÐ°Ð¹ÑÐµÐ² ÐÐ»ÐµÐºÑÐ°Ð½Ð´Ñ.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk