cpp;gutter:true;</p>
<h1>include</h1>
<p>using namespace std;</p>
<h1>define MaxInt 32767</h1>
<h1>define MVNum 100</h1>
<p>int i,j,k;</p>
<p>typedef struct</p>
<p>{</p>
<p>char vexs[MVNum];//顶点表</p>
<p>int arcs[MVNum][MVNum];//邻接矩阵</p>
<p>int vexnum,arcnum;//图当前的点数和边数</p>
<p>}AMGraph;</p>
<p>void InitUDN(AMGraph &G)//初始化无向图邻接矩阵</p>
<p>{</p>
<p>for(i=0;i>n>>m;</p>
<p>cout<>n>>m;</p>
<p>cout<"<>G.vexnum>>G.arcnum;</p>
<p>cout<>G.vexs[i];</p>
<p>cout<>Graph;</p>
<p>switch(Graph)</p>
<p>{</p>
<p>case 1:InitDN(G);CreateDN(G);break;</p>
<p>case 2:InitUDN(G);CreateUDN(G);break;</p>
<p>}</p>
<p>PrintAMGraph(G);</p>
<p>cout<>G.vexnum>>G.arcnum;</p>
<p>cout<>G.vertices[i].data;</p>
<p>G.vertices[i].firstarc=0;</p>
<p>}</p>
<p>cout<>n>>m;</p>
<p>i=LocateVex(G,n);</p>
<p>j=LocateVex(G,m);</p>
<p>p=new ArcNode;</p>
<p>p->adjvex=j;</p>
<p>p->nextarc=G.vertices[i].firstarc;</p>
<p>G.vertices[i].firstarc=p;</p>
<p>p=new ArcNode;</p>
<p>p->adjvex=i;</p>
<p>p->nextarc=G.vertices[j].firstarc;</p>
<p>G.vertices[j].firstarc=p;</p>
<p>cout<>G.vexnum>>G.arcnum;</p>
<p>cout<>G.vertices[i].data;</p>
<p>G.vertices[i].firstarc=NULL;</p>
<p>}</p>
<p>cout<>n>>m;</p>
<p>int i=LocateVex(G,n);</p>
<p>int j=LocateVex(G,m);</p>
<p>p=new ArcNode;</p>
<p>p->adjvex=j;</p>
<p>p->nextarc=G.vertices[i].firstarc;</p>
<p>G.vertices[i].firstarc=p;</p>
<p>cout<"<";</p>
<p>p=G.vertices[i].firstarc;</p>
<p>while(p)</p>
<p>{</p>
<p>cout<adjvex<";</p>
<p>p=p->nextarc;</p>
<p>}</p>
<p>cout<adjvex;</p>
<p>if(!visited[pos])</p>
<p>{</p>
<p>cout<nextarc;</p>
<p>}</p>
<p>}</p>
<p>cout<nextarc;</p>
<p>sum=sum+1;</p>
<p>}</p>
<p>cout<adjvex==i)sum=sum+1;</p>
<p>p=p->nextarc;</p>
<p>}</p>
<p>}</p>
<p>cout<nextarc;</p>
<p>sum=sum+1;</p>
<p>}</p>
<p>cout<>chose;</p>
<p>if(chose==1)</p>
<p>{</p>
<p>createUDG(G);</p>
<p>break;</p>
<p>}</p>
<p>else if(chose==2)</p>
<p>{</p>
<p>createDG(G);</p>
<p>break;</p>
<p>}</p>
<p>}</p>
<p>printALGraph(G);</p>
<p>BFS_AL(G,G.vertices[0].data);</p>
<p>if(chose==1)</p>
<p>{</p>
<p>calculateUDN(G);</p>
<p>}</p>
<p>else if(chose==2)</p>
<p>{</p>
<p>calculateDN(G);</p>
<p>}</p>
<p>}</p>
<p>void main()</p>
<p>{</p>
<p>int choose;</p>
<p>cout<>choose;</p>
<p>if(choose==1){AM();break;}</p>
<p>else if(choose==2){</p>
<p>AL();</p>
<p>break;}</p>
<p>}</p>
<p>}
Original: https://www.cnblogs.com/linlinmailbox/p/16492821.html
Author: 霖霖的信箱
Title: 数据结构 图
原创文章受到原创版权保护。转载请注明出处:https://www.johngo689.com/607361/
转载文章受原作者版权保护。转载请注明原作者出处!