安庆师范学院学报（自然科学版）
安慶師範學院學報（自然科學版）
안경사범학원학보（자연과학판）
JOURNAL OF ANQING TEACHERS COLLEGE(NATURAL SCIENCE)
2013年
4期
26-28,44
,共4页
带权邻接矩阵%带权图%最短通路%矩阵算法
帶權鄰接矩陣%帶權圖%最短通路%矩陣算法
대권린접구진%대권도%최단통로%구진산법
weighted adjacency matrix%weighted graph%the shortest path%matrix algorithm
通过对带权邻接矩阵定义一种运算，计算n阶简单带权图中任意两点之间步长为1，2，…，n -1的最短通路长度，逐步比较，确定通路所过各边权值之和最小的即最短路径。在计算的过程中用矩阵记下最短路径所经过的所有结点，最后验证了其在无向和有向简单带权图中的有效性。
通過對帶權鄰接矩陣定義一種運算，計算n階簡單帶權圖中任意兩點之間步長為1，2，…，n -1的最短通路長度，逐步比較，確定通路所過各邊權值之和最小的即最短路徑。在計算的過程中用矩陣記下最短路徑所經過的所有結點，最後驗證瞭其在無嚮和有嚮簡單帶權圖中的有效性。
통과대대권린접구진정의일충운산，계산n계간단대권도중임의량점지간보장위1，2，…，n -1적최단통로장도，축보비교，학정통로소과각변권치지화최소적즉최단로경。재계산적과정중용구진기하최단로경소경과적소유결점，최후험증료기재무향화유향간단대권도중적유효성。
A kind of calculation is defined based on weighted adjacency matrix which can get the length of the shortest path between any two points in step 1, 2,..., n-1 in n_points simple weighted graph.By comparison gradually, the shortest path is determined in which the sum of weights of the edges is minimum .And in the process of calculation the matrix can be used to take note of all nodes in the shortest path .Finally the effectiveness of the algorithm is verified by programming in the undirected and the directed weighted simple graph.
