Experiment No:5 PRN No:-1905063

Title:-
Develop a program to implement shortest path algorithm in computer network.

Program:
#include<stdio.h>
#include<conio.h>
void main()
{
char start,end; int a[8],p;
printf("enter source and destination: ");
scanf("%c %c",&start,&end);
printf("enter individual distance\n");
printf("AB= ");
scanf("%d",&a[0]);
printf("AF= ");
scanf("%d",&a[1]);
printf("BC= ");
scanf("%d",&a[2]);
printf("BE= ");
scanf("%d",&a[3]);
printf("CD= ");
scanf("%d",&a[4]);
printf("FC= ");
scanf("%d",&a[5]);
printf("FE= ");
scanf("%d",&a[6]);
printf("CD= ");
scanf("%d",&a[7]);
if(start=='A',start=='B',start=='C',start==
'D',start=='E',start=='F')
{
if(a[0]<a[5])
{
p=a[0];
if(a[1]<a[7]&&(end=='C'||end=='D'||
end=='E'))
{
p+=a[1];
if(end=='D')
p+=a[2];
}
else
{
p+=a[7];
}
if(end=='D')
p+=a[2];
}
}
else
{
p=a[5];
if(a[4]<a[6]&&(end=='D'||end=='E'))
{
p+=a[4];
if(end=='D')
p+=a[3];
}
else
{
p+=a[6];
if(end=='D')
p+=a[2];
}
}
printf("\n shortest distance between %c and %c is: %d",start,end,p);
}

Output:-