Package com.jgalgo.alg.span
Class MinimumDirectedSpanningTreeTarjan
java.lang.Object
com.jgalgo.alg.span.MinimumDirectedSpanningTreeAbstract
com.jgalgo.alg.span.MinimumDirectedSpanningTreeTarjan
- All Implemented Interfaces:
MinimumDirectedSpanningTree
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
-
Constructor Summary
-
Method Summary
Methods inherited from class com.jgalgo.alg.span.MinimumDirectedSpanningTreeAbstract
computeMinimumDirectedSpanningTree
-
Constructor Details
-
MinimumDirectedSpanningTreeTarjan
public MinimumDirectedSpanningTreeTarjan()Construct a new MDST algorithm object.Please prefer using
MinimumDirectedSpanningTree.newInstance()
to get a default implementation for theMinimumDirectedSpanningTree
interface.
-