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

摘要： 在交通网络图中,解决最短路径问题已有许多成功的算法,一般只以文字形式给出最短路径长度和路径上的顶点,很不直观.笔者研究了以图形方式表示最短路径的方法,以便对汽车行驶有更好的导向作用.

关键词: 交通网络, 最短路径, 可视化, 算法