摘要
基于"邻接点"概念,研究了最短路径的快速计算方法,并利用VB语言编写了计算所需的核心模块,最终实现了从一个节点到另一个节点的所有最短路径的快速查询和显示。
The best traveling line among many distribution nodes is searched by calculating the shortest path between two nodes based on basic principle of adjacency node,the core module is writed with VB,the shortest path from one node to the other node is quickly found and showed.
出处
《测绘》
2011年第3期134-136,共3页
Surveying and Mapping
关键词
最短路径
邻接点算法
VB
The shortest path
Adjacency node＇s calculation method
VB
