Journal of Chongqing Jiaotong University(Natural Science) ›› 1997, Vol. 16 ›› Issue (3): 111-116.
Previous Articles Next Articles
Zhou Jianli1, Tan Bin1, He Xiaohong2
Received:
Online:
Published:
周建丽1, 谭兵1, 何晓红2
作者简介:
Abstract: In the graph of communication network, vertexes indicate cities, and edges indicate the highw ays between cities.It is important for communication to find out the shortest path from one vertex to another.There are many algorithms for looking for the shortest path.But, they just give out the vertex sequences of the shortest path.In this paper, we shall show how to give the visual shortest path.This shall be helpful for automobiles guiding.
Key words: communication network, the shortest path, visual, algorithm
摘要: 在交通网络图中,解决最短路径问题已有许多成功的算法,一般只以文字形式给出最短路径长度和路径上的顶点,很不直观.笔者研究了以图形方式表示最短路径的方法,以便对汽车行驶有更好的导向作用.
关键词: 交通网络, 最短路径, 可视化, 算法
Zhou Jianli, Tan Bin, He Xiaohong. Looking for Visual Best Path in the Graph of Communication Network[J]. Journal of Chongqing Jiaotong University(Natural Science), 1997, 16(3): 111-116.
周建丽, 谭兵, 何晓红. 在交通网络图上实现可视化路径查找[J]. 重庆交通大学学报(自然科学版), 1997, 16(3): 111-116.
0 / / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://xbzk.cqjtu.edu.cn/EN/
http://xbzk.cqjtu.edu.cn/EN/Y1997/V16/I3/111