New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Edmonds' algorithm #201

Open

tecosaur opened this issue Dec 16, 2022 · 0 comments

Labels

tecosaur commented Dec 16, 2022

Graphs.jl currently has three spanning trees algorithms (https://juliagraphs.org/Graphs.jl/dev/algorithms/spanningtrees/):

It would be nice to also have the Chu–Liu/Edmonds' algorithm for the minimum spanning arborescence (i.e. Directed MST). The best approach seems to be this one https://doi.org/10.1007/BF02579168 from Gabow, Galil, Spencer, and Tarjan.

gdalle added the enhancement label

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment