chu-liu-edmond This is a simple implementation of the Chu-Liu/Edmond's algorithm that finds the minimum spanning arborescence in a directed weighted graph.