一种基于最少边数的最短路径算法  

The shortest path algorithm based on a minimum number of edges

作　　者：范翠香[1] 

机构地区：[1]西安理工大学高等技术学院,陕西西安710082

出　　处：《微型机与应用》2012年第8期4-5,9,共3页Microcomputer & Its Applications

摘　　要：确定两点之间最短路径,通常要求该路径满足两点之间的权之和最小。为此采用层次遍历图的思想,设计了一种新的结构存放路径选择信息,找到一种确定这种最短路径的算法,并给出了算法描述以及实例。To define the shortest path between two points,it is required that the path satisfied the minimum sum of weights between the two points.A new structure for storing route and choosing information is designed,by adopting the idea of the level traversal,an algorithm defining the shortest path is discovered,and the descriptions and examples of the this algorithm are provided.

关 键 词：邻接表 边链表 层次遍历图 队列 最短路径 

分 类 号：TP311.12[自动化与计算机技术—计算机软件与理论]