摘要
分析了带权图中求解最短路问题的方法,并设计了一个辅助求解的C++通用程序.
This article analyzes a method to compute shortest path distance in a weighted graph, and designs a C++ program which works out a useful method to solve it.
出处
《湖南城建高等专科学校学报》
2002年第4期41-43,共3页
Journal of Hunan Urban Construction College
关键词
C++程序
带权图
邻接矩阵
最短路
weight graph
adjacency matrix
shortest path distance
program