GeezerVison is showing github.com — Java/Programs/Floyd_Warshall_Algorithm.java at main · arshcoder13/Java

Expand file tree

Floyd_Warshall_Algorithm.java

Copy path

More file actions

Latest commit

History

64 lines (54 loc) · 1.18 KB

Floyd_Warshall_Algorithm.java

Copy path

File metadata and controls

64 lines (54 loc) · 1.18 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

// Java program for Floyd Warshall All Pairs Shortest Path algorithm.

import java.util.*;

import java.lang.*;

import java.io.*;

class AllPairShortestPath

{

final static int INF = 99999, V = 4;

void floydWarshall(int graph[][])

{

int dist[][] = new int[V][V];

int i, j, k;

for (i = 0; i < V; i++)

for (j = 0; j < V; j++)

dist[i][j] = graph[i][j];

for (k = 0; k < V; k++)

{

for (i = 0; i < V; i++)

{

for (j = 0; j < V; j++)

{

if (dist[i][k] + dist[k][j] < dist[i][j])

dist[i][j] = dist[i][k] + dist[k][j];

}

printSolution(dist);

}

void printSolution(int dist[][])

{

System.out.println("The following matrix shows the shortest "+

"distances between every pair of vertices");

for (int i=0; i<V; ++i)

{

for (int j=0; j<V; ++j)

{

if (dist[i][j]==INF)

System.out.print("INF ");

else

System.out.print(dist[i][j]+" ");

}

System.out.println();

}

public static void main (String[] args)

{

int graph[][] = { {0, 5, INF, 10},

{INF, 0, 3, INF},

{INF, INF, 0, 1},

{INF, INF, INF, 0}

};

AllPairShortestPath a = new AllPairShortestPath();

a.floydWarshall(graph);

}