CAJ | 학술논문

本文介绍了一种结合边访问标志集合使用图深度优先搜索方法遍历控制流程图,生成最小长度测试序列基本路径集合的优化算法.以矩阵工具为算法提供输入,利用回滚机制避免程序控制流中环造成的不收敛,提出引入结点复用路径最小长度记忆机制对结果进行优化,获得最小长度测试序列的优化基本路径集合作为算法输出.
본문개소료일충결합변방문표지집합사용도심도우선수색방법편력공제류정도,생성최소장도측시서렬기본로경집합적우화산법.이구진공구위산법제공수입,이용회곤궤제피면정서공제류중배조성적불수렴,제출인입결점복용로경최소장도기억궤제대결과진행우화,획득최소장도측시서렬적우화기본로경집합작위산법수출.
This thesis proposes an algorithm which can generate base paths set with character that length of each path is the smallest by visiting control flow graph ac‐cording to Depth‐First Search method and flag set of arcs and nodes .It provides in‐put data by matrix tool ,avoid un‐constringency by using roll mechanism ,optimizes the result based on the method of recording duplicate paths with smallest length , and obtains optimized set of base paths with smallest nodes list for output of algo‐rithm .