Dear colleagues, I am looking for a python implementation of the Chu-Liu-Edmonds algorithm (minimum spanning tree in a directed graph). My graphs are rather small (a hundred nodes typically) and not very dense.
If you have a hands-on experiment with such a publicly available python implementation, would you be kind enough to share it?