Algorithm for sequential construction of spanning minimal directed forests

For a weighted digraph, an efficient algorithm for constructing spanning forests of the minimum weight for an arbitrary number of trees is proposed, up to obtaining the minimum spanning tree, if it exists. Algorithm consists in a sequential increase in the number of arcs (decrease in the number of trees) while maintaining a certain degree of affinity between minimal forests when the number of trees changes. The correctness of the algorithm is proved and its complexity is determined. The result of the algorithm is a set of minimum spanning forests consisting of $k$ trees for all admissible $k$. Its complexity does not exceed $O(N^3)$.