Commit fffd9ff

authored

Floyd Warshall's Algorithm in c++ (#243)

Floyd Warshall's Algorithm in c++

2 parents c192864 + 4bbb527 commit fffd9ffCopy full SHA for fffd9ff

File tree

+37

-0

lines changed

+37

-0

lines changed

Lines changed: 37 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,37 @@`
	`1`	`+#include <iostream>`
	`2`	`+#include <vector>`
	`3`	`+`
	`4`	`+using namespace std;`
	`5`	`+`
	`6`	`+#define INF 1e9`
	`7`	`+`
	`8`	`+int main(){`
	`9`	`+`
	`10`	`+ int n,m,x,y,z;`
	`11`	`+`
	`12`	`+ cin >> n >> m; // n: number of vertex , m: number of edges`
	`13`	`+`
	`14`	`+ vector<vector<int> > distances(n,vector<int>(n,INF));`
	`15`	`+`
	`16`	`+ for(int i=0;i<m;i++){`
	`17`	`+ cin >> x >> y >> z;`
	`18`	`+ x--; y--;`
	`19`	`+ distances[x][y]=min(distances[x][y],z);`
	`20`	`+ distances[y][x]=min(distances[y][x],z);`
	`21`	`+ }`
	`22`	`+`
	`23`	`+ for(int k=0;k<n;k++)`
	`24`	`+ for(int i=0;i<n;i++)`
	`25`	`+ for(int j=0;j<n;j++)`
	`26`	`+ if(i==j)`
	`27`	`+ distances[i][j]=0;`
	`28`	`+ else`
	`29`	`+ distances[i][j]=min(distances[i][j],distances[i][k]+distances[k][j]);`
	`30`	`+`
	`31`	`+ for(int i=0;i<n;i++){`
	`32`	`+ for(int j=0;j<n;j++)`
	`33`	`+ cout << distances[i][j] << " ";`
	`34`	`+ cout << endl;`
	`35`	`+ }`
	`36`	`+`
	`37`	`+}`

Comments

(0)