Package com.jgalgo.alg.span

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

Constructor Summary

Constructors

Constructor	Description
MinimumDirectedSpanningTreeTarjan()	Construct a new MDST algorithm object.

Method Summary

Methods inherited from class com.jgalgo.alg.span.MinimumDirectedSpanningTreeAbstract

computeMinimumDirectedSpanningTree

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

MinimumDirectedSpanningTreeTarjan

public MinimumDirectedSpanningTreeTarjan()

Construct a new MDST algorithm object.

Please prefer using MinimumDirectedSpanningTree.newInstance() to get a default implementation for the MinimumDirectedSpanningTree interface.