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.
该算法基于流图理论的基本原理和简单的集合运算，概念明确，易于掌握；
This paper also designs the computerized critical path algorithm and the network graph drawing algorithm based on the graph theory and project management technique.
论述了图论的技术以及项目管理技术，并且根据图论技术和项目管理技术设计出了关键路径算法以及网络图绘制算法。
This study is based on smart planning and plan recognition theory, research tools are planning graph algorithm, using a database programming model to achieve the user plan recognition algorithm.
本文的研究基础是智能规划和规划识别理论，研究工具是规划图算法，采用有库规划模型实现用户规划识别算法。
This paper also designs the computerized critical path algorithm and the network graph drawing algorithm based on the graph theory and project management technique.
由于本系统以网络图的形式进行工程管理，因此提供了一个简单、直观制作网络图的平台。
So this article bases on the structural holes theory and discusses a computer-aided egocentric network analysis system which USES the matrix analysis algorithm and the network graph technology.
本文正是以结构洞理论为基础，研究了一个计算机辅助的个人人际网络分析系统。
The shortest path algorithm is a hot subject in graph theory, geographical information system, and traffic advisory and so on.
最短路径算法是图论、计算机网络、地理信息系统、交通咨询等诸多领域中研究的热门课题。
By the research of dynamic spectrum allocation algorithm based on graph coloring theory, this paper proposes an improved maximum utility spectrum allocation algorithm.
研究基于图着色理论的频谱分配算法，提出一种改进的最大效用频谱分配算法。
By the research of dynamic spectrum allocation algorithm based on graph coloring theory, this paper proposes an improved maximum utility spectrum allocation algorithm.
研究基于图着色理论的频谱分配算法，提出一种改进的最大效用频谱分配算法。
应用推荐