摘要
用最优化选择原则对有向赋权图中的最短路径问题进行了讨论 ,给出在任意简单有限有向赋权图中求出从任一点到指定点间的最短路径长度的数学模型 ,提出构造一条含弧数最少的最短路径的方法 ,并推广到简单有限无向赋权图中。
The article introduced a mathematical pattern that calculated length of the shortest distance arbitrary to certain point in arbitrary simple finite weighted graph and presented a method that constructed the shortest distance involving the lessest number of arc and expanded into simple finite non orientable weighted graph.
出处
《湖北师范学院学报(自然科学版)》
2002年第2期72-74,102,共4页
Journal of Hubei Normal University(Natural Science)