Scribd
Upload
50 views

DVR Algorithm: Name:-Mimansha Roll No: - 2019326 Code

The document describes a distance vector routing algorithm. It includes code to implement the algorithm using C++. The code initializes a cost matrix and distance/path arrays for each node. It then calculates the minimum distance between all node pairs by considering direct links and paths through intermediate nodes. The output displays the next hop and distance to reach each node for every node.

Uploaded by

Mimansha Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
50 views

DVR Algorithm: Name:-Mimansha Roll No: - 2019326 Code

The document describes a distance vector routing algorithm. It includes code to implement the algorithm using C++. The code initializes a cost matrix and distance/path arrays for each node. It then calculates the minimum distance between all node pairs by considering direct links and paths through intermediate nodes. The output displays the next hop and distance to reach each node for every node.

Uploaded by

Mimansha Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

DVR Algorithm

Name:- Mimansha
Roll no:- 2019326

Code:-
#include<stdio.h>
#include<iostream>
using namespace std;
struct node
{
unsigned dist[6];
unsigned from[6];
}DVR[10];
int main()
{
cout<<"\n\n-------------------- Distance Vector Routing Algorithm----------- ";
int costmat[6][6];
int nodes, i, j, k;
cout<<"\n\n Enter the number of nodes : ";
cin>>nodes; //Enter the nodes
cout<<"\n Enter the cost matrix : \n" ;
for(i = 0; i < nodes; i++)
{
for(j = 0; j < nodes; j++)
{
cin>>costmat[i][j];
costmat[i][i] = 0;
DVR[i].dist[j] = costmat[i][j]; //initialise the distance equal to cost matrix
DVR[i].from[j] = j;
}
}
for(i = 0; i < nodes; i++) //We choose arbitary vertex k and we calculate the
//direct distance from the node i to k using the cost matrix and add the distance from k to node
j
for(j = i+1; j < nodes; j++)
for(k = 0; k < nodes; k++)
if(DVR[i].dist[j] > costmat[i][k] + DVR[k].dist[j])
{ //We calculate the minimum distance
DVR[i].dist[j] = DVR[i].dist[k] + DVR[k].dist[j];
DVR[j].dist[i] = DVR[i].dist[j];
DVR[i].from[j] = k;
DVR[j].from[i] = k;
}
for(i = 0; i < nodes; i++)
{
cout<<"\n\n For router: "<<i+1;
for(j = 0; j < nodes; j++)
cout<<"\t\n node "<<j+1<<" via "<<DVR[i].from[j]+1<<" Distance "<<DVR[i].dist[j];
}
cout<<" \n\n ";
return 0;
}
Output:-

You might also like