# Java Program for Floyd's Algorithm

0 like 0 dislike
108 views

Implement All-Pairs Shortest Paths problem using Floyd's algorithm.

### For Indian Students- INR 570/- || For International Students- \$12.99/-

S.No.

Course Name

Apply Coupon

1.

Tensorflow 2 & Keras:Deep Learning & Artificial Intelligence

Apply Coupon

2.

Computer Vision with OpenCV | Deep Learning CNN Projects

Apply Coupon

3.

Complete Machine Learning & Data Science with Python Apply Coupon

4.

Natural Language Processing-NLP with Deep Learning in Python Apply Coupon

5.

Computer Vision OpenCV Python | YOLO| Deep Learning in Colab Apply Coupon

6.

Complete Python Programming from scratch with Projects Apply Coupon

0 like 0 dislike
by Goeduhub's Expert (5.8k points)

## For Theory of Floyd's Algorithm Click here

Java Program

import java.util.Scanner;

public class Floyd

{

void flyd(int[][] w,int n)

{

int i,j,k;

for(k=1;k<=n;k++)

for(i=1;i<=n;i++)

for(j=1;j<=n;j++)

w[i][j]=Math.min(w[i][j], w[i][k]+w[k][j]);

}

public static void main(String[] args)

{

int a[][]=new int[10][10];

int n,i,j;

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

Scanner sc=new Scanner(System.in);

n=sc.nextInt();

System.out.println("Enter the weighted matrix:");

for(i=1;i<=n;i++)

for(j=1;j<=n;j++)

a[i][j]=sc.nextInt();

Floyd f=new Floyd();

f.flyd(a, n);

System.out.println("The shortest path matrix is:");

for(i=1;i<=n;i++)

{

for(j=1;j<=n;j++)

{

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

}

System.out.println();

}

sc.close();

}

}

Output

Note: 999 here refers to Infinite weight of edge