Minimum spanning arborescence?
Hi,
I find algorithms for minimum spanning arborescence (MST for directed graph) are missing.
It would be good if they can be considered in the future.
Thanks!
Han
Please use the issue tracker only to report bugs (i.e. errors in the library that need to be fixed) or feature requests.
For questions about how to compile, install or use the library, please use instead the mailing list at https://graph-tool.skewed.de/mailing
(If unsure, use the mailing list first.)
When opening new issues, please choose the BUG template from the drop-down menu, and fill out the required information.
Hi,
I find algorithms for minimum spanning arborescence (MST for directed graph) are missing.
It would be good if they can be considered in the future.
Thanks!
Han