The package edmonds-alg contains a C++-implementation of Edmonds's optimum branching algorithm as described by Tarjan in 1977.
Be the first to post a text review of Edmonds's algorithm. Rate and review a project by clicking thumbs up or thumbs down in the right column.
Version 1.1.0 of edmonds-alg has now been released and is available for download. Most notably, an example has been added to the documentation showing how to create a graph and call the algorithm.
The code has been completely rewritten to use the concepts in the Boost Graph Library (BGL).
Be the first person to add a text review.
Copyright © 2009 Geeknet, Inc. All rights reserved. Terms of Use
Thanks for your rating!
Would you also like to write a review?
Thanks for your review!
Get credit for your review by logging in via OpenID. Click your account provider: