**5. Discussions**

Thus, the tasks set in the paper are solved by reducing to the problem of the maximum flow and the minimum section. This allows us to use Ford–Fulkerson algorithms [4,5] and their modifications [22,23], which avoid the need to solve NP-problems. To do this, either the arc throughput is determined in a special way, or good arcs are introduced not for the entire acyclic digraph, but for its arcs coverage, which greatly simplifies the task. We also note that the optimization tasks considered in the paper do not always have a single solution. However, the proposed algorithms allow us to obtain some of these solutions.

**Author Contributions:** Conceptualization, G.T. and V.B.; methodology and formal analysis, G.T.; data curation and writing, V.B.; All authors have read and agreed to the published version of the manuscript.

**Funding:** This research received no external funding.

**Institutional Review Board Statement:** Not applicable.

**Informed Consent Statement:** Not applicable.

**Data Availability Statement:** Data supporting reported results were obtained by Victor Bulgakov.

**Conflicts of Interest:** The authors declare no conflict of interest.
