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. problems that need to be fixed). For questions about how to use the library, please use the mailing list at https://graph-tool.skewed.de/mailing
When opening new issues, please choose the BUG template from the drop-down menu, and fill out the required information.
If you want to fork this repository to propose merge requests, please send an email to tiago@skewed.de, and your project limit will be raised.