文件名称:gdf
介绍说明－－下载内容均来自于网络，请自行研究使用
根据城市交通路网建设的实际, 研究了描述城市交通网络图的城市道路数据库的组织结构, 在此数据
结构的基础上依靠G IS 技术的支持, 采集了大量具体道路信息, 采用D ijk st ra 算法实现了快速最短路径搜索。根
据城市的交通状况对交通网络图的边值赋予不同的权值可实现最优路径搜寻, 给出了一个搜索实例——一个包
含61 个交通路口的最短路径搜索结果的搜索时间约为1. 1-Urban traffic network in accordance with the actual building, research describing the urban traffic of the urban road network structure of the database, in this data structure based on G IS techniques rely on the support, collecting a large number of specific road information, the use of D ijk st ra algorithm to achieve a fast shortest path search. According to city traffic conditions on the transport network map boundary value given different weights to achieve optimal path search, a search examples are given- one that contains 61 traffic junctions of the shortest path search results of the search time is about 1. 1
结构的基础上依靠G IS 技术的支持, 采集了大量具体道路信息, 采用D ijk st ra 算法实现了快速最短路径搜索。根
据城市的交通状况对交通网络图的边值赋予不同的权值可实现最优路径搜寻, 给出了一个搜索实例——一个包
含61 个交通路口的最短路径搜索结果的搜索时间约为1. 1-Urban traffic network in accordance with the actual building, research describing the urban traffic of the urban road network structure of the database, in this data structure based on G IS techniques rely on the support, collecting a large number of specific road information, the use of D ijk st ra algorithm to achieve a fast shortest path search. According to city traffic conditions on the transport network map boundary value given different weights to achieve optimal path search, a search examples are given- one that contains 61 traffic junctions of the shortest path search results of the search time is about 1. 1
(系统自动生成,下载前可以参看下载内容)
下载文件列表
基于数据库的城市道路中最短路径搜索.pdf