-
Notifications
You must be signed in to change notification settings - Fork 0
/
Floyd_warshall.cpp
62 lines (55 loc) · 1.2 KB
/
Floyd_warshall.cpp
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
//{ Driver Code Starts
//Initial template for C++
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//User function template for C++
class Solution {
public:
void shortest_distance(vector<vector<int>>&matrix){
int n=matrix.size();
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(i==j)matrix[i][j]=0;
if(matrix[i][j]==-1)matrix[i][j]=1e9;
}
}
for(int via=0;via<n;via++){
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
matrix[i][j]=min(matrix[i][j],matrix[i][via]+matrix[via][j]);
}
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(matrix[i][j]==1e9)matrix[i][j]=-1;
}
}
}
};
//{ Driver Code Starts.
int main(){
int tc;
cin >> tc;
while(tc--){
int n;
cin >> n;
vector<vector<int>>matrix(n, vector<int>(n, -1));
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
cin >> matrix[i][j];
}
}
Solution obj;
obj.shortest_distance(matrix);
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
cout << matrix[i][j] << " ";
}
cout << "\n";
}
}
return 0;
}
// } Driver Code Ends