每日一题【20200815】

图论、最短路径、Floyd算法

例

用Floyd算法求解路径。

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]
[D,path]=floyd(a)

D =
     0    10    50    30    60
   Inf     0    50   Inf    60
   Inf   Inf     0   Inf    10
   Inf   Inf    20     0    30
   Inf   Inf   Inf   Inf     0
path =
     1     2     4     4     4
     0     2     3     0     3
     0     0     3     0     5
     0     0     3     4     3
     0     0     0     0     5

参考

1. NULL ↩