Program 6 Dijkstra Algorithm

Implementation of Dijkstra‘s Algorithm
Aim: To write C Program to implement Dijkstra’s algorithm to find shortest path

Objective:
Dijkstra's Algorithm allows you to calculate the shortest path between one node
(you pick which one) and every other node in the graph. Dijkstra algorithm is also called
single source shortest path algorithm. It is based on greedy technique.
Dijkstra’s Algorithm:
The algorithm maintains a list visited[ ] of vertices, whose shortest distance from the
source is already known. If visited[1], equals 1, then the shortest distance of vertex i is
already known. Initially, visited[i] is marked as, for source vertex.
At each step, we mark visited[v] as 1. Vertex v is a vertex at shortest distance from the
source vertex. At each step of the algorithm, shortest distance of each vertex is stored in
an array distance[ ].
Step 1 :
Create cost matrix C[ ][ ] from adjacency matrix adj[ ][ ].
C[i][j] is the cost of going from vertex i to vertex j.
If there is no edge between vertices i and j then C[i][j] is infinity.
Step 2 : Array visited[ ] is initialized to zero.

for(i=0;i<n;i++)
visited[i]=0;
Step 3: If the vertex 0 is the source vertex then visited[0] is marked as 1.
Step 4:
1. Create the distance matrix, by storing the cost of vertices from vertex no. 0 to n-
1 from the source vertex 0.
for(i=1;i<n;i++)
distance[i]=cost[0][i];
2. Initially, distance of source vertex is taken as 0. i.e. distance[0]=0;
Step 5 : for(i=1;i<n;i++)
1. Choose a vertex w, such that distance[w] is minimum and visited[w] is 0. Mark
visited[w] as
2. Recalculate the shortest distance of remaining vertices from the source.
3. Only, the vertices not marked as 1 in array visited[ ] should be considered for
recalculation of distance. i.e. for each vertex v
if(visited[v]==0)
distance[v]=min(distance[v],distance[w]+cost[w][v])
C Program:
#include<stdio.h>
#define INFINITY 9999
#define MAX 10
void dijkstra(int G[MAX][MAX],int n,int startnode);
int main()
{
int G[MAX][MAX],i,j,n,u;
printf("Enter no. of vertices:");
scanf("%d",&n);
printf("\nEnter the adjacency matrix:\n");
for(i=0;i<n;i++)
for(j=0;j<n;j++)
scanf("%d",&G[i][j]);
printf("\nEnter the starting node:");

scanf("%d",&u);
dijkstra(G,n,u-1);
return 0;
}
void dijkstra(int G[MAX][MAX],int n,int startnode)

{
int cost[MAX][MAX],distance[MAX],pred[MAX];
int visited[MAX],count,mindistance,nextnode,i,j;
//pred[] stores the predecessor of each node

//count gives the number of nodes seen so far
//create the cost matrix
for(i=0;i<n;i++)
for(j=0;j<n;j++)
if(G[i][j]==0)
cost[i][j]=INFINITY;
else
cost[i][j]=G[i][j];
//initialize pred[ ],distance[ ] and visited[ ]

for(i=0;i<n;i++)
{
distance[i]=cost[startnode][i];
pred[i]=startnode;
visited[i]=0;
}
distance[startnode]=0;
visited[startnode]=1;
count=1;
while(count<n-1)
{
mindistance=INFINITY;
//nextnode gives the node at minimum distance

for(i=0;i<n;i++)
if(distance[i]<mindistance&&!visited[i])
{
mindistance=distance[i];
nextnode=i;
}
//check if a better path exists through nextnode
visited[nextnode]=1;
for(i=0;i<n;i++)
if(!visited[i])
if(mindistance+cost[nextnode][i]<distance[i])
{
distance[i]=mindistance+cost[nextnode][i];
pred[i]=nextnode;
}
count++;
}
//print the path and distance of each node

for(i=0;i<n;i++)
if(i!=startnode)
{
printf("\nTotal Cost from node %d to %d is %d",startnode+1, i+1,distance[i]);
printf("\nPath : %d",i+1);
j=i;
do
{
j=pred[j];
printf(" <-- %d",j+1);
}while(j!=startnode);
}
}
OUTPUT:
Enter no. of vertices:6

Enter the adjacency matrix:
0 7 9 0 0 14
7 0 10 15 0 0
9 10 0 11 0 2
0 15 11 0 6 0
0 0 0 6 0 9
4 0 2 0 9 0
Enter the starting node:1
Total Cost from node 1 to 2 is 7

Path : 2 <-- 1
Path : 3 <-- 1
Path : 4 <-- 3 <-- 1
Path : 5 <-- 6 <-- 3 <-- 1
Path : 6 <-- 3 <-- 1
Enter the starting node: 3

Path : 1 <-- 6 <-- 3
Path : 2 <-- 3
Path : 4 <-- 3
Path : 5 <-- 6 <-- 3
Path : 6 <-- 3
Enter the starting node:4

Path : 1 <-- 6 <-- 3 <-- 4
Path : 2 <-- 4
Path : 3 <-- 4
Path : 5 <-- 4
Path : 6 <-- 3 <-- 4
VIVA Questions:
1. Which technique the Dijkstra's algorithm is based on?

The solution is based on a well-known algorithm from graph theory—Dijkstra's shortest-
path algorithm. Basically, the algorithm works as follows. We start with containing this
node and then initialize the table of costs (the s) to other nodes using the known costs to
directly connected nodes.
2. What is routing?
Routing is the process of selecting a path for traffic in a network or between or across
multiple networks.
3. What is routing algorithm?

In order to transfer the packets from source to the destination, the network layer must
determine the best route through which packets can be transmitted. The routing protocol
is a routing algorithm that provides the best path from the source to the destination. The
best path is the path that has the "least-cost path" from source to the destination.
4. What are the categories of routing algorithm?

The Routing algorithm is divided into two categories:
Adaptive Routing algorithm
Non-adaptive Routing algorithm
5. What is the difference between adaptive and non-adaptive routing algorithm?
6. What is packetizing?
The process of encapsulating the data received from upper layers of the network(also
called as payload) in a network layer packet at the source and decapsulating the payload
from the network layer packet at the destination is known as packetizing.
7. What is Forwarding Process?

When a packet arrives at a router’s input link, the router must move the packet to the
appropriate output link. A router forward a packet by examining the value of a field in the
arriving packet’s header, and then using this header value to index into the router’s
forwarding table. The value stored in the forwarding table entry for that header indicates
the router’s outgoing link interface to which the packet is to be forwarded.
8. Difference between Connection-oriented and Connection-less Services
Connectionless service is used in the network system to transfer data from one end to
another end without creating any connection. So it does not require establishing a
connection before sending the data from the sender to the receiver. It is not a reliable
network service because it does not guarantee the transfer of data packets to the receiver,
and data packets can be received in any order to the receiver. Therefore we can say that
the data packet does not follow a defined path. In connectionless service, the transmitted
data packet is not received by the receiver due to network congestion, and the data may be
lost.

Program 6 Dijkstra Algorithm

Uploaded by

Program 6 Dijkstra Algorithm

Uploaded by

Implementation of Dijkstra‘s Algorithm

Aim: To write C Program to implement Dijkstra’s algorithm to find shortest path

Step 2 : Array visited[ ] is initialized to zero.

Step 3: If the vertex 0 is the source vertex then visited[0] is marked as 1.

void dijkstra(int G[MAX][MAX],int n,int startnode);

printf("\nEnter the starting node:");

void dijkstra(int G[MAX][MAX],int n,int startnode)

//pred[] stores the predecessor of each node

//initialize pred[ ],distance[ ] and visited[ ]

//nextnode gives the node at minimum distance

//print the path and distance of each node

Enter no. of vertices:6

Enter the starting node:1

Total Cost from node 1 to 2 is 7

Enter the starting node: 3

Total Cost from node 3 to 1 is 6

Enter the starting node:4

Total Cost from node 4 to 1 is 17

1. Which technique the Dijkstra's algorithm is based on?

3. What is routing algorithm?

4. What are the categories of routing algorithm?

5. What is the difference between adaptive and non-adaptive routing algorithm?

7. What is Forwarding Process?

You might also like