On structured digraphs and program testing

Certain graph theoretic problems dealing with the testing of structured programs are treated. A structured digraph is a digraph that represents a structured program. A labelling procedure which characterizes structured digraphs is described. An efficient algorithm for finding a minimum path cover for the vertices of digraphs that belong to an important family of structured digraphs is given. To model interactions among code segments the notions of `required pairs´ and `must pairs´ are introduced and the corresponding constrained path cover problems are shown to be NP-complete even for acyclic structured digraphs.