《二零一六年年全国大学生数学建模国赛B题程序》.docVIP

Matlab dijkstra算法 function [distance,path]=dijkstra(A,s,e) % [DISTANCE,PATH]=DIJKSTRA(A,S,E) % returns the distance and path between the start node and the end node. % A: adjcent matrix % s: start node % e: end node % initialize n=size(A,1); % node number D=A(s,:); % distance vector path=[]; % path vector visit=ones(1,n); % node visibility visit(s)=0; % source node is unvisible parent=zeros(1,n); % parent node distance=D(e); % the shortest distance path if parent(e)==0, return; end path=zeros(1,2*n); % path preallocation t=e; path(1)=t; count=1; while t~=s t0 p=parent(t); path=[p path(1:count)]; t=p; count=count+1; end if count=2*n, error([The path preallocation length is too short.,... Please redefine path preallocation parameter.]); end path(1)=s; path=path(1:count); function [y,fval,flag]=Hungary(C) %********************************************************************** % C=[2 15 13 4;10 4 14 15;9 14 16 13;7 8 11 9] % [y,fval]=Hungary(C) % M = % 0 0 0 1 % 0 1 0 0 % 1 0 0 0 % 0 0 1 0 % y = % 28 % %*************************************************************************** [m,n]=size(C); tempC=C; for i=1:m tempC(i,:)=tempC(i,:)-min(tempC(i,:)); end for i=1:n tempC(:,i)=tempC(:,i)-min(tempC(:,i)); end tempC=TryAssign(tempC); OneNumber=0; while OneNumberm Row=zeros(m,1); Col=ones(1,n); Line=[]; for i=1:m if IsInMatrix(inf,tempC(i,:))==0 Line=[Line,i]; Row(i)=1; end end for i=Line Cur=i; while Cur~=0 [Cur,Row,Col]=ZeroCover(tempC,Row,Col,Cur); end end temp=inf; for i=1:m for j=1:n if tempC(i,j)==inf|tempC(i,j)==-inf tempC(i,j)=0; end end end for i=1:m if Row(i)==1 tempC(i,:)=tempC(i,:)-temp; end end for j=1:n if Col(j)==0 tempC(:,j)=tempC(:,j)+temp; end end tempC=TryAssign(tempC); OneNumber=0;