交通分配之隨機配流算法matlab源碼(含最短路徑算法)

1、本文檔含兩個 m 文件 dial.m 和 dijkstra1.m ，dial 需要調(diào)用 dijkstra1。 算例如下：算法如下：Dial.medge = [ 1 1 2 2 3 4 4 5 5 6 7 8 ;...2 4 3 5 6 5 7 6 8 9

2、 8 9 ;...2 2 2 2 2 1 2 1 2 2 2 2 ; ];n=9; weight=inf*ones(n, n);Q = 1000; start =1 ; endn = 9; r =zeros(1,n); s = zeros(1,n); theta = 1; L = zeros(n);OD= zer

3、os(n); %==================================================================== for i=1:nweight(i, i)=0; end for i=1:size(edge,2) weight(edge(1, i), edge(2, i))=edge(3, i); end Lmin = zeros(1,n); for i=1: n [dis, path]=di

4、jkstra1(weight, i, 9) ; s(i) = dis; % 任意節(jié)點到終點 s 的最小時間 [dis, path]=dijkstra1(weight, 1, i) ;r(i) =dis; % 起點 r 到任意節(jié)點最小時間 end for i = 1 : n for j = 1:n if weight(i,j)> 0 %所有路段似然值endend end L Max =2000;