Take an example subnet graph with weights indicating delay between nodes Now obtain routing art each node using distance vector routing algorithm?

Answer 1

#include<stdio.h>

#include<conio.h>

#include<string.h>

void min(int[],int,int[][],int);

void main()

{

int s[20][20],i,j,n,ne[20][20],k=0,d[20],z[20][2],e[20];

char nam[20],r;

clrscr();

printf("enter no.of routers in the subnet:");

scanf("%d",&n);

printf("Enter the adjacency matrix\n");

for(i=0;i<n;i++)

for(j=0;j<n;j++)

scanf("%d",&s[i][j]);

printf("Which routers routing table you want to construct:");

scanf(%c",&r);

printf("the neighbours of c are:",r);

for(i=0;i<n;i++)

if(s[r-65][i]==1)

{

printf("%c",i+65);

nam[k++]=i+65;

}

printf("\n");

for(i=0;i<k;i++)

{

printf("Enter %c%c delay:",r,nam[i]);

scanf("%d",&d[i]);

}

for(i=0;i<k;i++)

{

printf("\n Enter %c's routing table \n",nam[i]);

for(j=0;j<n;j++)

scanf("%d",&ne[i][j];

}

for(i=0;i<n;i++)

{

for(j=0;j<k;j++)

e[j]=ne[i][j]+d[j];

min(e,k,z,i);

}

clrscr();

printf("To");

for(i=0;i<k;i++)

printf("%c\t",nam[i]);

printf("NEW TABLE FOR %c ",r);

printf("\n");

for(i=0;i<k;i++)

printf("......");

printf("..............");

for(i=0;i<n;i++)

{

printf("\n");

printf("%c|",i+65);

for(j=0;j<k;j++)

printf("%d\t",ne[j][i]);

if(r==(i+65))

printf("0\t-);

else

{

printf("%d\t",z[i][0]);

printf("%c\t",nam[z[i][1]]);

}

}

}

void min(int e[20],int k,int z[20][2],int i)

{

int b;

z[i][0]=e[0];

z[i][1]=0;

for(b=1;b<k;b++)

if(e[b]<z[i][0])

{

z[i][1]=0;

for(b=1;b<k;b++)

if(e[b]<z[i][0])

{

z[i][0]=e[b];

z[i][1]=b;

}

}