Matlab的图论工具箱 4——有向图最短路径
<p>%例题4-11！%时间：2015-6-20
clc
clear
close all
a=zeros(7);
a(1,2)=4; a(1,3)=2;
a(2,3)=3; a(2,4)=2; a(2,5)=6;
a(3,4)=5; a(3,6)=4;
a(4,5)=2; a(4,6)=7;
a(5,6)=4; a(5,7)=8;
a(6,7)=3;
b=sparse(a); %构造稀疏矩阵，这里给出构造稀疏矩阵的另一种方法
=graphshortestpath(b,1,7,'Directed',true,'Method','Dijkstra') % Directed是有向的
%h=view(biograph(b,[],'ShowArrows','on','ShowWeights','on'))</p><p>
h = view(biograph(b,[],'ShowArrows','off','ShowWeights','on'));
set( h.Nodes(path),'Color', )
fowEdges=getedgesbynodeid( h, get( h.Nodes(path),'ID' ) );
revEdges=getedgesbynodeid( h, get( h.Nodes(fliplr(path)),'ID' ) );
edges=;
set(edges,'LineColor',); %为了将来打印清楚，边画成黑色
set(edges,'LineWidth',1.5); %线型宽度设置为1.5</p><p><p><p></p>
页:
[1]