Class MinimumDirectedSpanningTreeTarjan

java.lang.Object
com.jgalgo.alg.span.MinimumDirectedSpanningTreeAbstract
com.jgalgo.alg.span.MinimumDirectedSpanningTreeTarjan
All Implemented Interfaces:
MinimumDirectedSpanningTree

public class MinimumDirectedSpanningTreeTarjan extends MinimumDirectedSpanningTreeAbstract
Tarjan's minimum directed spanning tree algorithm.

The algorithm run in \(O(m \log n)\) time and uses linear space.

Based on 'Finding optimum branchings' by R. E. Tarjan.

Author:
Barak Ugav