The paper introduced two kinds of graph theory algorithm which is suitable to select other nodes and estimate relating path in actual system on basis of finding out shortest path of node.
在分析过程中以寻求节点最短路径为基础，介绍了两条图论算法，并且这种算法适用于实际系统中其它节点选取以及关联路径的判断。
An algorithm based on graph theory for non-rigid shape matching is presented.
提出了一种基于图理论的非刚体形状匹配算法。
The algorithm is based on the principle of flow graph theory and set theory.
该算法基于流图理论的基本原理和简单的集合运算，概念明确，易于掌握；
应用推荐