摘要
探讨了城市交通拥挤问题的解决办法,介绍了公路网络中信息的存储方法:Coordinate Storage(COO),Compressed Sparse Row(CSR),Compressed Sparse Column(CSC),Block Sparse Row(BSR);以及最短路径的两种搜索算法:Dijkstra算法和Bellman-ford算法,同时给出了Dijk-stra算法步骤和它的最新改进算法.
This paper discussed the method of solving the problem of traffic jam in cities and introduced the storage methods of information in road network： coordinate storage （COO）, compressed sparse row （CSR）, compressed sparse column（CSC）, block sparse row（BSR）, and two shortest path algorithms. Dijkstra algorithm and Bellman-ford algorithm. It also gave out the steps of Dijkstra algorithm and its latest speed-up algorithm.
出处
《上海交通大学学报》
EI
CAS
CSCD
北大核心
2008年第3期489-492,共4页
Journal of Shanghai Jiaotong University
基金
2007教育部博士点新教师基金资助项目(20070248087)
关键词
拓扑连通性
交通拥挤
畅通度
最短路径
topology connectedness
traffic jam
expediency
shortest path
