| 吴取劲,阳小华,鹿江春,余童兰.一种基于图深度优先搜索的基本路径集自动生成优化算法[J].南华大学学报(自然科学版),2012,26(3):87~90.[WU Qu-jin,YANG Xiao-hua,LU Jiang-chun,YU Tong-lan.An Optimized Algorithm of Auto-generate Base Paths Set Based on Depth-first Search[J].Journal of University of South China(Science and Technology),2012,26(3):87~90.] |
| 一种基于图深度优先搜索的基本路径集自动生成优化算法 |
| An Optimized Algorithm of Auto-generate Base Paths Set Based on Depth-first Search |
| 投稿时间：2012-09-10 |
| DOI： |
| 中文关键词: 软件测试 深度优先搜索 基本路径 |
| 英文关键词:software test depth-first search base paths |
| 基金项目:湖南省高等学校科学研究重点基金资助项目（11A105）；湖南省科学技术厅科技计划基金资助项目（2011GK3192） |
|
| 摘要点击次数: 1087 |
| 全文下载次数: 1557 |
| 中文摘要: |
| 本文介绍了一种结合边访问标志集合使用图深度优先搜索方法遍历控制流程图，生成最小长度测试序列基本路径集合的优化算法.以矩阵工具为算法提供输入，利用回滚机制避免程序控制流中环造成的不收敛，提出引入结点复用路径最小长度记忆机制对结果进行优化，获得最小长度测试序列的优化基本路径集合作为算法输出. |
| 英文摘要: |
| 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 according to Depth-First Search method and flag set of arcs and nodes.It provides input 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 algorithm. |
| 查看全文 查看/发表评论 下载PDF阅读器 |
| 关闭 |