摘要
研究了图的深度 (广度 )优先遍历算法、起点—终点所有路径的算法、最短路径算法 ;在城市地下管网信息系统中 ,具体研究、实现了管网事故分析、起点—终点所有路径、管线最短路径算法程序 。
The methods of depth-first-search,breadth-first-search,all the paths from start point to end point and the minimized path are studied.The programming methods of pipeline incident analysis,all paths from start pipe-point to end pipe-point and the minimized path of pipeline are designed and applied in the urban underground pipeline information system.The methods studied in this paper can be references for other similar net-tracing problems.
出处
《同济大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2003年第1期99-103,共5页
Journal of Tongji University:Natural Science
