【摘要】 路径覆盖是路径测试最重要的课题之一。文章给出了ddgraph图的支配树、蕴含树和非限制弧的构造方法,提出了一种基于最小路径测试子集的寻找单个测试路径算法,该算法可有效地生成从入口到出口且覆盖非限制弧的路径子集,并给出了具体的应用实例。更多还原

【Abstract】 Path coverage is one of the most important topics of the path testing research.This paper gives the con-struction method of dominance tree,implication tree and unconstrained arcs in ddgraph,and presents a FIND_A_PATH algorithm based on minimum number of paths testing subset.It can constructs the path subset from entry to exit,using unconstrained arcs,and an example is given in this paper.更多还原