摘要
提出了一种新的网络连通性表达法，称为“边标号法”，从算法的角度解决了增设虚拟边网络连通性表达法和对偶图网络连通性表达法所带来的大量工作量问题，在对交通网络图不作任何修改的情况下，清楚而有效地表达出网络的连通特性，体现出了边标号法的优越性，并用一个具体实例通过程序实现了该方法。
This paper describes the line marked technique developed by the author to represent transport network. This method greatly simplifies the coding of complex transport networks, particularly when there are turning restrictions. Firstly it presents the traditional direct graph method and dual graph method, and describes the main problems. Then it describes the line marked technique and shows how to represent network with this technique while the network code doesn't need any change at all, even if prohibited turns are introduced. Finally it draws the main conclusions and points out that line marked method can be very useful for detailed traffic models and its advantage over the other two methods.
出处
《中国公路学报》
EI
CAS
CSCD
北大核心
1999年第4期73-77,共5页
China Journal of Highway and Transport
关键词
对偶图
边标号法
虚拟边
交通网络
dual graph method
line marked technique
fictitious line
