摘要
任意程序流程图可抽象为一个有向图,求出有向图的路径表达式,就可知道其对应的程序流程图中所有可能的路径。本文将给出一个算法NNRA,它对任意有向图C,通过节点删去法(Nodc by Node Remove)求出G的路径表达式。
Any program flow graph can be abstracted into a directed graph. All possible path in the program flow graph can be know as long as the expression of the directed graph is obtained.In this paper, a node by node remove algorithm (NNRA) is given. Using this method to any directed graph, the path expression of the graph G can be solved.
出处
《吉林大学学报（信息科学版）》
CAS
1991年第1期7-11,共5页
Journal of Jilin University（Information Science Edition）
关键词
计算数学
有向图
路径表达式/软件工程
computational mathematics
directed graph
path expressions
software engineering
