DataStructures-Algorithms/Library/Graph/floydwarshall.cpp at 9e285869eb141c1e69093c1a8d3bf637e49bbc9e · rachitiitr/DataStructures-Algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#include<iostream>
using namespace std;
#define INF 1e7
void floydwarshall(int m[][100],int n)
{
    int dist[n][n];

    for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
            {
                dist[i][j]=m[i][j];
            }
        }
    for(int k=0;k<n;k++)
    {
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
            {
                if(dist[i][k]+dist[k][j]<dist[i][j])
                dist[i][j]=dist[i][k]+dist[k][j];
            }
        }
    }
    for(int i=0;i<n;i++)
        {
        for(int j=0;j<n;j++)
        {
            if(dist[i][j]==INF)
            cout<<"INF"<<" ";
            else
            cout<<dist[i][j]<<" ";
        }
        cout<<endl;
        }
}
int main()
 {
	int t;
	cin>>t;
	while(t--)
	{
	    int n;
	    cin>>n;
	    int m[100][100];
	    for(int i=0;i<n;i++)
	    {
	        for(int j=0;j<n;j++)
	        {
	            cin>>m[i][j];
	        }
	    }
	    floydwarshall(m,n);

	    /*for(int i=0;i<n;i++)
	    {
	        for(int j=0;j<n;j++)
	        {
	            if(m[i][j]==INF)
	            cout<<"INF"<<" ";
	            else
	            cout<<m[i][j]<<" ";
	        }
	        cout<<endl;
	    }*/
	}
	return 0;
}