IMPLEMENTING MINIMUM GRAPH COVERING IN PYTHON
M.M.Aripov1, Sh.Sh.Axmadaliyev2, X.M.Xasanov3, M.M.Botirov4
A structural programming method and a graph model of the program are considered. The concept of a packed adjacency matrix is introduced. An algorithm and a Python program for constructing the minimum number of paths that cover all branches of the program graph are given.