Scribd
Upload
9 views4 pages

CN Lab P6

Uploaded by

niharikabandari216
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views4 pages

CN Lab P6

Uploaded by

niharikabandari216
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Computer Networks Lab [BCS502]

Program 6: Write a program to find the shortest path between vertices using bellman-
ford algorithm.

import java.util.Scanner;

public class ford

private int D[ ];

private int num_ver;

public static final int MAX_VALUE = 999;

public ford(int num_ver)

this.num_ver = num_ver;

D = new int[num_ver + 1];

public void BellmanFordEvaluation(int source, int A[ ][ ])

for (int node = 1; node <= num_ver; node++)

D[node] = MAX_VALUE;

D[source] = 0;

for (int node = 1; node <= num_ver - 1; node++)

for (int sn = 1; sn <= num_ver; sn++)

Dept of CSE, SMVCE Page 25


Computer Networks Lab [BCS502]

for (int dn = 1; dn <= num_ver; dn++)

if (A[sn][dn] != MAX_VALUE)

if (D[dn] > D[sn]+ A[sn][dn])

D[dn] = D[sn] + A[sn][dn];

for (int sn = 1; sn <= num_ver; sn++)

for (int dn = 1; dn <= num_ver; dn++)

if (A[sn][dn] != MAX_VALUE)

if (D[dn] > D[sn]+ A[sn][dn])

System.out.println("The Graph contains negative egde cycle");

for (int vertex = 1; vertex <= num_ver; vertex++)

System.out.println("distance of source"+source+"to"+vertex+"is" + D[vertex]);


Dept of CSE, SMVCE Page 26
Computer Networks Lab [BCS502]

public static void main(String[ ] args)

int num_ver = 0;

int source;

Scanner scanner = new Scanner(System.in);

System.out.println("Enter the number of vertices");

num_ver = scanner.nextInt( );

int A[ ][ ] = new int[num_ver + 1][num_ver + 1];

System.out.println("Enter the adjacency matrix");

for (int sn = 1; sn <= num_ver; sn++)

for (int dn = 1; dn <= num_ver; dn++)

A[sn][dn] = scanner.nextInt( );

if (sn == dn)

A[sn][dn] = 0; continue;

if (A[sn][dn] == 0)

A[sn][dn] = MAX_VALUE;

}
Dept of CSE, SMVCE Page 27
Computer Networks Lab [BCS502]

System.out.println("Enter the source vertex");

source = scanner.nextInt( );

ford b = new ford (num_ver);

b.BellmanFordEvaluation(source, A);

scanner.close( );

OUTPUT:

Enter the number of vertices: 4


Enter the adjacency matrix
0 5 0 0
5 0 3 4
0 3 0 2
0 4 2 0
Enter the source vertex: 2
distance of source 2 to 1 is 5
distance of source 2 to 2 is 0
distance of source 2 to 3 is 3
distance of source 2 to 4 is 4

Dept of CSE, SMVCE Page 28

You might also like