Dynamic_Programming/FloydWarshall.cpp at main · duttabhishek0/Dynamic_Programming · 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
#include<iostream>
using namespace std;

//All pairs shortest path using DP.
#define V 4
#define INF 10000000

void allPairShortest(int graph[][V]){
int dp[V][V];

for(int i=0;i<V;i++){
    for(int j=0;j<V;j++){
        dp[i][j] = graph[i][j];
    }
}

for(int k=0;k<V;k++){
    for(int i=0;i<V;i++){
        for(int j=0;j<V;j++){
            dp[i][j] = min( dp[i][k]+dp[k][j],dp[i][j]);

        }
    }
}

for(int i=0;i<V;i++){
    for(int j=0;j<V;j++){
        cout<<dp[i][j]<<" ";
    }
    cout<<endl;
}

return;
}


int main(){
int graph[V][V] = { {0,   5,  INF, 10},
                        {INF, 0,   3, INF},
                        {INF, INF, 0,   1},
                        {INF, INF, INF, 0}
                      };
allPairShortest(graph);

return 0;
}