Version 1.0.0 of edmonds-alg has now been released.
The code has been completely rewritten on top of concepts in the Boost Graph
Library. The algorithm is templatized to support various versions of the
algorithm, such as minium vs maximum weight branchings, and branchings vs
spanning trees. In the future, a special version for sparse graphs may be
implmented. The probability of this feature ever appearing will be
proportional to feedback and demand from users.
The web page of the project has also been updated to reflect the new
release. For instructions for downloading and installing see
http://edmonds-alg.sourceforge.net.
Cheers,
/Ali
|
