一边多权图的邻接矩阵实现技术和Dijkstra算法的改进  

As Graph have multiple weights of an edge the adjacency matrix of implementation technology and improvement of the Dijkstra algorithm

作　　者：刘喜勋[1] 何苗[1] 

机构地区：[1]陕西工业职业技术学院,陕西咸阳712000

出　　处：《自动化与仪器仪表》2016年第7期186-189,共4页Automation & Instrumentation

摘　　要：根据智能交通系统路径规划的需要,提出一种全新的图理论,一边多权图;在C++环境下,实现存储结构的定义和建立邻接矩阵算法的编写,改写典型最短路径Dijkstra算法,在此存储结构的实现。应用该算法,可以得到各种需求的从初始节点到目的节点的"最短路径",且具有较低的时空复杂度。对根据实时交通信息进行的带权路径选择智能交通系统开发,提供了理论依据,满足了工程实践中的紧迫需求。according to the needs of intelligent transportation systems,path planning,this paper puts forward a new kind of graph theory,Graph have multiple weights of an edge; in C + + environment,the realization of the definition of storage structure and the establishment of the adjacency matrix algorithm to write; rewrite the typical Dijkstra shortest path algorithm,the realization of the storage structure of here. Application the algorithm can get all kinds of needs from the initial node to the destination node ' shortest path',and has lower complexity of time and space. based on real- time traffic information for weighted path choice of intelligent transportation system development,provides the theoretical basis,to meet the urgent needs in the engineering practice.

关 键 词：智能交通系统 一边多权图 邻接矩阵 最短路径 DIJKSTRA算法 

分 类 号：U495[交通运输工程—交通运输规划与管理] TP301.6[交通运输工程—道路与铁道工程]