计算机与现代化 ›› 2011, Vol. 1 ›› Issue (1): 36-3.doi: 10.3969/j.issn.1006-2475.2011.01.010

• 算法分析与设计 • 上一篇    下一篇

一种改进的Dijkstra算法的分析及程序实现

郝春梅   

  1. 哈尔滨金融学院计算机系,黑龙江 哈尔滨 150030
  • 收稿日期:2010-10-08 修回日期:1900-01-01 出版日期:2011-01-20 发布日期:2011-01-20

Program Implementation and Analysis on an Improved Dijkstra Algorithm

HAO Chun-mei   

  1. Computer Science Department, Harbin University of Finance, Harbin 150030, China
  • Received:2010-10-08 Revised:1900-01-01 Online:2011-01-20 Published:2011-01-20

摘要:

Dijkstra算法是求有向图中从某一源点到其余各点最短路径的算法。本文通过对传统的Dijkstra算法进行分析,提出一种改进算法,经理论分析,对于顶点数较多而边数较少的有向稀疏图来说,在求最短路径时能够大大提高算法的运行效率。

关键词: 最短路径, Dijsktra算法, 改进算法

Abstract:

Dijkstra algorithm is an algorithm for solving singlesource shortestpaths of directed graph.This paper analyzes classical Dijkstra algorithm and puts forward an improved algorithm. By theoretical analysis, the improved algorithm can improve efficiency of directed sparse graph.

Key words: shortestpath, Dijkstra algorithm, improved algorithm