基于_矩阵乘法_网络最短路径算法.pdf

7 Vol. 37 No. 7 2009 7 ACTA ELECTRONICA SINICA July 2009 / 0 邓方安, 雍龙泉, 周 涛, 刘丽华 ( , 723001) : , . , Dijkstra . , , / 0 , , . , . , , . : ; ; ; : TP30116 : A : 0372-2112 (2009) 07- 1594-05 Shortest Path Problem Algorithm in Network Based on Matrix Multiplication DENG Fa g-a , YONG Lo g-qua , ZHOU Tao, LIU Li-hua (Department of Mathematics, Shaanxi University of Technology ,Hanzhong, Shaanxi 723001, China) Abstract : Shortest Path Problem i etw ork ca be acted as a model for ma y applicatio problems, but the iteratio process of the co ve tio al solutio algeorithm is complex . I this paper, the shortest path algorithm based o the matrix multiplicatio i a weighted-graph are described, a d its time complexity is as same as Dijkstra algorithm. I a give etwork graph, this algorithm delete spare odes or edges a d reach the goal that reduced etwork graph a d improved speed of solvi g problem u der the co di- tio of u cha ged shortest parth. Fi ally,we give examples, e. g .Traveli g Salesma Problem, shortest path problem, to illistrate its adva teges, possessi g merits of simple operatio a d easy u dersta di g, compared with dy amic programmi g tech ology . Key words: matrix multiplicatio ; shortest path problem; reduced pri ciple; traveli g salesma problems , 1 . . ,, , , . NP- [ 1~ 4] . . , ,