微型机与应用
微型機與應用
미형궤여응용
MICROCOMPUTER & ITS APPLICATIONS
2012年
8期
4-5,9
,共3页
邻接表%边链表%层次遍历图%队列%最短路径
鄰接錶%邊鏈錶%層次遍歷圖%隊列%最短路徑
린접표%변련표%층차편력도%대렬%최단로경
adjacency list%side chain%traverse the graph level%queue%shortest path
确定两点之间最短路径,通常要求该路径满足两点之间的权之和最小。为此采用层次遍历图的思想,设计了一种新的结构存放路径选择信息,找到一种确定这种最短路径的算法,并给出了算法描述以及实例。
確定兩點之間最短路徑,通常要求該路徑滿足兩點之間的權之和最小。為此採用層次遍歷圖的思想,設計瞭一種新的結構存放路徑選擇信息,找到一種確定這種最短路徑的算法,併給齣瞭算法描述以及實例。
학정량점지간최단로경,통상요구해로경만족량점지간적권지화최소。위차채용층차편력도적사상,설계료일충신적결구존방로경선택신식,조도일충학정저충최단로경적산법,병급출료산법묘술이급실례。
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.
