- 9
- 0
- 约2.73千字
- 约 54页
- 2021-08-27 发布于山东
- 举报
第4章;目录 CONTENTS;固定起点的
最短路;1.Dijkstra标号算法;Dijkstra标号算法
流程图;clc, clear, close all
E = [1,2,6; 1,3,3; 1,4,1; 2,5,1; 3,2,2; 3,4,2; 4,6,10; 5,4,6
5,6,4; 5,7,3; 5,8,6; 6,5,10; 6,7,2; 7,8,4; 9,5,2; 9,8,3];
G = digraph(E(:,1), E(:,2), E(:,3));
[path, d] = shortestpath(G, 1, 8, method,positive)
p = plot(G,EdgeLabel,G.Edges.Weight,Layout, circle);
highlight(p,path,EdgeColor,r,LineWidth,1.5);clc, clear, close all, a=zeros(11);
a(1,2)=2;a(1,3)=8;a(1,4)=1;
a(2,3)=1;a(2,3)=6;a(2,5)=1;
a(3,4)=7;a(3,5)=5;a(3,6)=1;a(3,7)=2;
a(4,7)=9; a(5,6)=3;a(5,8)=2;a(5,9)=9;
a(6,7)=4;a(6,9)=6; a(7,9)=3;a(7,10)=1;
a(8,9)
原创力文档

文档评论(0)