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

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．