test_djkstra.m

来自「经典dijkstra算法程序很完整能够正确运行」· M 代码 · 共 22 行

s                 = 1;
e                 = 3;
d                 = 2;
N                 = 1000;
K                 = 5;
R                 = 2/sqrt(N);
X                 = rand(d , N);
A1                = Kadjacency(X , K);
A2                = Radjacency(X , R);

figure(1)
[path , pathcost] = dijkstra(A1 , s , e);
gplot(A1 , X');hold on,plot(X(1 , :) , X(2 , :) , 'k+',X(1 , path) , X(2 , path) , 'r' , 'markersize' , 5 , 'linewidth' , 2), hold off


figure(2)

[path , pathcost] = dijkstra(A2 , s , e);
gplot(A2 , X');hold on,plot(X(1 , :) , X(2 , :) , 'k+',X(1 , path) , X(2 , path) , 'r' , 'markersize' , 5 , 'linewidth' , 2), hold off