MATLAB寻找节点pA与pC之间的最短路径

寻找节点pA与pC之间的最短路径
load oscillatorgraph
gObj=biograph(g,names)
gObj=view(gObj);
pANode=find(strcmp(‘pA’,names));
pBNode=find(strcmp(‘pB’,names));
pCNode=find(strcmp(‘pC’,names));
set(gObj.nodes(pANode),‘color’,[1 0 0],‘size’,[40 30]);
set(gObj.nodes(pBNode),‘color’,[0 1 0],‘size’,[40 30]);
set(gObj.nodes(pCNode),‘color’,[0 0 1],‘size’,[40 30]);
[dist,path,pred]=shortestpath(gObj,pANode,pCNode);
set(gObj.Nodes(path),‘Color’,[1 0.4 0.4])
edges=getedgesbynodeid(gObj,get(gObj.Nodes(path),‘ID’));
set(edges,‘LineColor’,[1 0 0])
set(edges,‘LineWidth’,1.5)
在这里插入图片描述

猜你喜欢

转载自blog.csdn.net/m0_38127487/article/details/113953413