C program to implement Distance Vector

Program:

Read: Tips for Creating Website

Read: Visit more html,aql and javascript programs

#include<stdio.h>
#include<conio.h>
void main()

{
int a[10],n,i,j,source;
int neigh[10],k=0;
int delay[10][10],dtime[10];
int min,temp;
clrscr();
printf("\n graph contain how many nodes:");
sacnf("%d",&n);
printf("\n enter %d elements of link adjancency matrix \n",n*n);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
scanf("%d",%a[i][j]);
printf("\n enter source code:\n");
scanf("%d",&source);
for(i=1;i<=n;i++)
if(a[source][i]==1)
neigh[++k]=1;
printf("\n neighbouring nodes of node %d are:\n",source);
for(i=1;i<=k;i++)
printf("5d\t",neigh[i]);
for(i=1;i<=k;i++)
{
printf("\n enter delay matrix of node %d\n",neigh[i]);
for(j=1;j<=n;j++)
scanf("%d",&delay [neigh[i][j]]);
printf("\n enter delay from source node %d to its distance node %d:\n",source,neigh[i]);
scanf("%d",&dtime[neigh[i]])
}
for(j=1;j<=n;j++)
{
min=9999;
for(i=1;i<=k;i++)
{
temp=delay[neigh[i][j]+dtime[neigh[i]];
if(temp<min)
min=temp;
}
if(source!=j)
delay[source][j]=min;
else
delay[source][j]=0;
}
printf("\n the delay vector of root node is:\n");
for(i=1;i<=n;i++)
printf("%d \t",delay[source][i]);
getch();
}