Name:as

Roll No - 20U502
Mangesh Andurkar
Batch-T 17
Code:

#include Siostream>
#include <stdio.h>

using namespace std;

struct node {
int dist20
int from[20];
route[10];

int main)

rg
i.o
int dm[20][20], no;

cout <"Enter no of nodes." << endl; ed

iv
Cin>no0
dw

cout < "Enter the distance matrix:" << endl;

ra

for (int i=0; i< no; it+) {

nd

for (intj= 0;j <

no; j++)1
cin Set
>> dm[0
re

* distance from i to i as 0 "/

na

dm[][]= 0;
y.

route[i].distj]= dm[i]U]:
ud

route[i].fronm[j] = j;
st

int flag;
do{
flag=0;
for(int i 0; i < no; it++){|
for (int j =

0; j< no; J+*){

for (int k= 0; k < no; k++) {
if(routefi].distfj]) > (routeli].dist|k] + route[k]. dist[i]))
route[i].dist[j] = route[î].dist|k] + route[k]|.distJl
route[i].from[j] = k;

flag= 1,

while (flag):
 for (int i 0; =
i< no; it+) {|
cout " R o u t e r info for router: " < i + | < < e n d l ;

cout < "Dest\ltNext HopltDist" << endl;

for (int j 0; j<no; jt+)
=

printf("%dt%d\ku%din", j+1, route[i].from[jl+1, route[i].dist[j]):

return 0;

Output

root@eleven

root(@eleven: root(@eleven.
9++dyr.CpR 130

rg
i.o
/Ovr

ed
of nodes.
Enter no iv
Enter the distance matrix:
dw

92 99
ra

326
ROuter info for router: 1
nd

Dest Next Hop Dist

re
na

Router info for router:

y.

Dest Next Hop Dist

ud
st

9
Router info for router: 3
Dest Next Hop Dist
2 2