摘要
在对网络图变换的基础上引入了简单连通图的准生成根树的概念，并由此给出了求网络图最短路径的一种新算法．该算法与以往算法的区别在于它改变了网络图的拓扑结构，从而使搜索能够在结构非常简单的树状图上进行．该算法用最多不超过｜Ｖ｜－１层的扩展，即可找出图中从源点出发到其余顶点或任意两点间的最短路径．
The concept of quasi spanning root tree based upon the transformation for simply connected networks is introduced, and a new algorithm for shortest path is provided. By the algorithm, the topological configuration of the simply connected networks has been permuted, which is the most distinction of the algorithm from others, so the search for the shortest path can be conducted on arborescent graph. Using this algorithm, textile process technology, textiles
出处
《西北纺织工学院学报》
CAS
1996年第3期253-256,共4页
Journal of Northwest Institute of Textile Science and Technology
