每日一题【20200816】

图论、最短路径、dijkstra算法

例

用dijkstra算法求解A到各点的最短路径。

a=[0 10 inf 30 100;inf 0 50 inf inf;inf inf 0 inf 10;inf inf 20 0 60;inf inf inf inf 0]

>> [min,path]=dijkstra(a,1,1)
min =
     0
path =
     1
>> [min,path]=dijkstra(a,1,2)
min =
    10
path =
     1     2
>> [min,path]=dijkstra(a,1,3)
min =
    50
path =
     1     4     3
>> [min,path]=dijkstra(a,1,4)
min =
    30
path =
     1     4
>> [min,path]=dijkstra(a,1,5)
min =
    60
path =
     1     4     3     5

参考

1. NULL ↩