RIP协议的距离向量算法--C++

最新推荐文章于 2022-05-29 10:09:55 发布

梦幻骑士syc

最新推荐文章于 2022-05-29 10:09:55 发布

阅读量1.4k

点赞数 3

分类专栏：计算机网络

本文链接：https://blog.csdn.net/syc1988109/article/details/8514582

版权

计算机网络专栏收录该内容

26 篇文章 0 订阅

订阅专栏

RIP协议的距离向量算法--C++

#include<fstream>
#include<iostream>
#include<string>
#include<sstream>
#include<list>
using namespace std;

//路由表中数据
class Table{
public:
string destination_id;
int distance;
string next_stop;
};

//路由类
class Route{
public:
Route();
string open_file(ifstream& infile);
void show(list<Table>& p);
void change();
void update();
private:
string route1;
string route2;
list<Table> piece1;
list<Table> piece2;
};

//类中的函数
//构造函数
Route::Route(){
string temp;
Table r_temp;
ifstream infile1,infile2;
istringstream strm;
cout<<"enter the current route name: ";
route1=open_file(infile1);
while(getline(infile1,temp)){
   strm.str(temp);
   strm>>r_temp.destination_id>>r_temp.distance>>r_temp.next_stop;
   piece1.push_back(r_temp);
   strm.clear();
}
cout<<"                this is the currnet route contents "<<endl;
show(piece1);
cout<<"enter the neighbor route name: ";
route2=open_file(infile2);
while(getline(infile2,temp)){
   strm.str(temp);
   strm>>r_temp.destination_id>>r_temp.distance>>r_temp.next_stop;
   piece2.push_back(r_temp);
   strm.clear();
}
cout<<"                this is the neighbor route contents "<<endl;
show(piece2);
}

//打开文件函数
string Route::open_file(ifstream& infile){
    string str;
cin>>str;
infile.open((str+".txt").c_str());
if(!infile){
   cerr<<"file open error!"<<endl;
   exit(1);
}
return str;
}

//显示每条信息
void Route::show(list<Table>& p){
for(list<Table>::iterator it=p.begin();it!=p.end();it++)
   cout<<(*it).destination_id<<" "<<(*it).distance<<" "
    <<(*it).next_stop<<endl;
}

//改变piece2
void Route::change(){
   for(list<Table>::iterator it=piece2.begin();it!=piece2.end();it++){
    ((*it).distance)++;
    (*it).next_stop=route2;
   }
   cout<<"                this is the changed neighbor route contents "<<endl;
   show(piece2);
}

//更新piece1
void Route::update(){
int count=0;                  //计数器，用来表示id2是否出现与id1中
list<Table>::iterator it1=piece1.begin();
list<Table>::iterator it2=piece2.begin();
for(;it2!=piece2.end();it2++){
   for(it1=piece1.begin();it1!=piece1.end();it1++){
    if((*it1).destination_id==(*it2).destination_id){
     count++;
     if(((*it1).next_stop)==((*it2).next_stop)){
      (*it1).distance=(*it2).distance;
      (*it1).next_stop=(*it2).next_stop;
     }
     if(((*it1).next_stop!=(*it2).next_stop)&&((*it1).distance>(*it2).distance)){
       (*it1).distance=(*it2).distance;
       (*it1).next_stop=(*it2).next_stop;
     }
    }
   }
   if(count==0)
    piece1.push_back(*it2);
   count=0;
}
cout<<"                this is the updated current route contents "<<endl;
show(piece1);
}
int main(){
Route route;
route.change();
route.update();
return 0;
}