#include<stdio.h>
struct node
{
unsigned dist[20];
unsigned from[20];
}rt[10];
int main()
{
int dmat[20][20];
int n,i,j,k,count=0;
printf("\nEnter the number of nodes : ");
scanf("%d",&n);
printf("\nEnter the cost matrix :\n");
for(i=0;i<n;i++)
for(j=0;j<n;j++)
{
scanf("%d",&dmat[i][j]);
dmat[i][i]=0;
rt[i].dist[j]=dmat[i][j];
rt[i].from[j]=j;
}
do
{
count=0;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
for(k=0;k<n;k++)
if(rt[i].dist[j]>dmat[i][k]+rt[k].dist[j])
{
rt[i].dist[j]=rt[i].dist[k]+rt[k].dist[j];
rt[i].from[j]=k;
count++;
}
}while(count!=0);
for(i=0;i<n;i++)
{
printf("\n\nState value for router %d is \n",i+1);
for(j=0;j<n;j++)
{
printf("\t\nnode %d via %d Distance%d",j+1,rt[i].from[j]+1,rt[i].dist[j]);
}
}
printf("\n\n");
}
I2luY2x1ZGU8c3RkaW8uaD4Kc3RydWN0IG5vZGUKewoJdW5zaWduZWQgZGlzdFsyMF07Cgl1bnNpZ25lZCBmcm9tWzIwXTsKfXJ0WzEwXTsKaW50IG1haW4oKQp7CglpbnQgZG1hdFsyMF1bMjBdOwoJaW50IG4saSxqLGssY291bnQ9MDsKCXByaW50ZigiXG5FbnRlciB0aGUgbnVtYmVyIG9mIG5vZGVzIDogIik7CglzY2FuZigiJWQiLCZuKTsKCXByaW50ZigiXG5FbnRlciB0aGUgY29zdCBtYXRyaXggOlxuIik7Cglmb3IoaT0wO2k8bjtpKyspCgkJZm9yKGo9MDtqPG47aisrKQoJCXsJCgkJCXNjYW5mKCIlZCIsJmRtYXRbaV1bal0pOwoJCQlkbWF0W2ldW2ldPTA7CgkJCXJ0W2ldLmRpc3Rbal09ZG1hdFtpXVtqXTsKCQkJcnRbaV0uZnJvbVtqXT1qOwoJCX0KCQlkbwoJCXsJCgkJCWNvdW50PTA7CgkJCWZvcihpPTA7aTxuO2krKykKCQkJZm9yKGo9MDtqPG47aisrKQoJCQlmb3Ioaz0wO2s8bjtrKyspCgkJCQlpZihydFtpXS5kaXN0W2pdPmRtYXRbaV1ba10rcnRba10uZGlzdFtqXSkKCQkJCXsKCQkJCQlydFtpXS5kaXN0W2pdPXJ0W2ldLmRpc3Rba10rcnRba10uZGlzdFtqXTsKCQkJCQlydFtpXS5mcm9tW2pdPWs7CgkJCQkJY291bnQrKzsKCQkJCX0KCQl9d2hpbGUoY291bnQhPTApOwoJCWZvcihpPTA7aTxuO2krKykKCQl7CgkJCXByaW50ZigiXG5cblN0YXRlIHZhbHVlIGZvciByb3V0ZXIgJWQgaXMgXG4iLGkrMSk7CgkJCWZvcihqPTA7ajxuO2orKykKCQkJewoJCQkJcHJpbnRmKCJcdFxubm9kZSAlZCB2aWEgJWQgRGlzdGFuY2UlZCIsaisxLHJ0W2ldLmZyb21bal0rMSxydFtpXS5kaXN0W2pdKTsKCQkJfQoJCX0JCglwcmludGYoIlxuXG4iKTsKfQo=