Finding a minimum arborescence on a directed graph with no cycle. The original directed graph will have four minimum arborescences.
No download links available.
