Template Function ADS::isMinimumSpanningForest

Function Documentation

template<class W>
bool ADS::isMinimumSpanningForest(int n, const std::vector<WeightedEdge<W>> &A, const std::vector<WeightedEdge<W>> &T)

whether T is a minimum spanning forest of the edges A on the nodes [ 0 , n ): its edges are in A, it has no cycle, as many edges as n minus the components of A, and no edge of A weighs less than the heaviest edge of the path of T between its ends, O( m n )