rip的C语言实现.docVIP

rip的C语言实现 //运转环境visual studio 2005 C++代 #include stdafx.h //手动添加头文件C:\Program Files\Microsoft Visual Studio\VC98\ATL\SRC #includestring #includevector #includewindows.h #includeiomanip #includeiostream using namespace std; const int MAX=15; typedef struct ArcCell//弧结点 { int adj; }ArcCell,Am[MAX][MAX]; struct TNode//路由表 { string destination; int distance; string nextjump; }; struct VNode//路由结点 { string r;//极点名 vector TNode t; }; struct Graph{//图 VNode vex[MAX]; Am arcs; int vexnum,arcnum; }; //确定s正在图中的地位 int LocateVex(Graph G,string s) { int i; for(i=0;iG.vexnum;i++) if(s==G.vex[i].r) break; return i; } //建立图 bool Create(Graph G) { int i,j,k; TNode temp; string v1,v2; cout输进路由数链路数endl; cinG.vexnumG.arcnum; cout输进路由器名及路由表endl; for(i=0;iG.vexnum;i++)//结构极点 { cout输进第 i+1 个路由器名endl; cinG.vex[i].r; cout输进其路由表endl; cintemp.destinationtemp.distancetemp.nextjump; while(1) { if(temp.distance16)temp.distance=16; G.vex[i].t.push_back(temp);//结构路由表 cintemp.destinationtemp.distancetemp.nextjump; if(temp.destination==0temp.distance==0temp.nextjump==0) break; } } for(i=0;iG.vexnum;i++)//初始化邻接矩阵 for(j=0;jG.vexnum;j++) G.arcs[i][j].adj=10000; for(k=0;kG.arcnum;k++)//结构邻接矩阵 { cout输进第 k+1 条弧的两极点endl; cinv1v2; i=LocateVex(G,v1); j=LocateVex(G,v2); G.arcs[i][j].adj=1; G.arcs[j][i].adj=1; } return true; } void print(Graph G) { int i,j; for(i=0;iG.vexnum;i++) { cout路由器 G.vex[i].rendl; coutsetw(20)手法地点setw(8)间隔setw(20)下一跳endl; for(j=0;j(G.vex[i].t.size());j++) coutsetw(20)G.vex[i].t[j].destinationsetw(8)G.vex[i].t[j].distancesetw(20)G.vex[i].t[j].nextjumpendl; coutendlendl; } } bool Exchange(Graph G) { int i,j,k,t,count; TNode temp; for(i=0;iG.vexnum;i++) for(j=0;jG.vexnum;j++) { if(G.arcs[i][j].adj==1) { for(k=0;kG.vex[i].t.size();k++) { temp.destination=G.vex[i].t[k].destination; temp.distance=G.vex[i].t[k].distance+1; if(temp.distance16)temp.distance=16; temp.nextjump=G.vex[i].r; count=0; for(t=0;tG.vex[j].t.size();t++) { if(G.vex[j].t[t].destination==temp.destination) { count++; if(G.v