Research article

IMPLEMENTING MINIMUM GRAPH COVERING IN PYTHON

M.M.Aripov1, Sh.Sh.Axmadaliyev2, X.M.Xasanov3, M.M.Botirov4

Online First: December 22, 2022


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.

Keywords

testing, minimum program graph coverage, packed adjacency matrix, DD-paths, vertex, branches, g-graph, h-graph, algorithm complexity, Python, IF, WHILE.