Dijkstra算法的特征和应用研究  

Research of Dijkstra Algorithm and Its Applications

作　　者：江涛[1] 

机构地区：[1]毕节学院计算机科学系,贵州毕节551700

出　　处：《毕节学院学报（综合版）》2009年第8期91-94,共4页Journal of Bijie University

摘　　要：Dijkstra算法包含了许多值得研究的特征,包括它的递推策略,标号策略,逼近策略等。它的正确性依赖于一个简单的事实。Dijkstra算法在计算机网络,通讯和运筹学中的作用日益重要。The Algorithm of Dijkstra includes many characteristics worthy to be studied, including it＇s recurrence, label, approximating.It＇s correction is based on a simple fact. The algorithm of Dijkstra becomes more and more important in the field of computer network, communication and operation research.

关 键 词：DIJKSTRA算法 标号 逼近 递推 最短路径 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]