From 4c70db554787d85d42916818a7123f3961d9b2ef Mon Sep 17 00:00:00 2001
From: Vivek Kumar <vivek.ku1997@gmail.com>
Date: Fri, 5 Oct 2018 00:33:16 -0700
Subject: [PATCH 01/10] floyd warshall algorithm for finding all pair shortest
 path in a connected graph

---
 .../CPP/floyd-warshall algorithm.cpp          | 73 +++++++++++++++++++
 1 file changed, 73 insertions(+)
 create mode 100644 floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp

diff --git a/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp b/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp
new file mode 100644
index 00000000..9c0160af
--- /dev/null
+++ b/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp	
@@ -0,0 +1,73 @@
+//Floyd-Warshall Algorithm: all pair shortest path
+#include <iostream>
+#include <climits>
+using namespace std;
+
+#define INF 999999999
+
+int main()
+{
+	int graph[1001][1001],i,j,k,n,m;
+	cin>>n>>m;	//number of vertices and edges respectively
+
+	for(i=1;i<=n;i++)
+	{
+		for(j=1;j<=n;j++)
+			if(i==j)	graph[i][j]=0;	//Shortest distance between (i,i) is 0
+			else
+				graph[i][j] = INF;		//Initializing other distances as infinite
+	}
+
+	for(i=1;i<=m;i++)
+	{
+		int u,v,w;
+		cin>>u>>v>>w;
+		graph[u][v] = w;				//input graph
+		graph[v][u] = w;				//Shortest distance between (i,j) using atmost one edge
+	}
+
+
+	for(k=1;k<=n;k++)					
+	{
+		for(int u=1;u<=n;u++)
+		{
+			for(int v=1;v<=n;v++)
+			{
+				//Shortest distance between (i,j) using atmost k edges
+				graph[u][v] = min(graph[u][v],graph[u][k]+graph[k][v]);	
+			}
+		}
+	}
+
+	//Resulting all pair shortest path in given graph
+	for(int u=1;u<=n;u++)
+	{
+		for(int v=1;v<=n;v++)
+		{
+			cout<<graph[u][v]<<" ";
+		}
+		cout<<endl;
+	}
+	cout<<endl;
+	return 0;
+}
+
+/*
+Input:-
+First line contain two space separated integer n and m 
+where n is the number of vertices and m is the number 
+of edges.Next m lines contains three space seprated integers
+u, v and w which represents that there is an edge between u and v
+and weight of the edge is w
+Sample Input:-
+6 9
+1 2 1
+1 3 2
+1 4 5
+2 4 5
+2 5 2
+3 4 3
+4 5 1
+4 6 1
+5 6 4
+*/

From 732e3bb40bfc32055ec7ae56eb1af1c963bb32cb Mon Sep 17 00:00:00 2001
From: Vivek Kumar <vivek.ku1997@gmail.com>
Date: Sat, 6 Oct 2018 12:44:07 +0530
Subject: [PATCH 02/10] Added whitespaces

---
 .../CPP/floyd-warshall algorithm.cpp          | 44 ++++++++-----------
 1 file changed, 18 insertions(+), 26 deletions(-)

diff --git a/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp b/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp
index 9c0160af..ecbe3f70 100644
--- a/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp	
+++ b/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp	
@@ -5,50 +5,42 @@ using namespace std;
 
 #define INF 999999999
 
-int main()
-{
-	int graph[1001][1001],i,j,k,n,m;
-	cin>>n>>m;	//number of vertices and edges respectively
+int main() {
+	int graph[1001][1001], i, j, k, n, m;
+	cin >> n >> m;	//number of vertices and edges respectively
 
-	for(i=1;i<=n;i++)
-	{
-		for(j=1;j<=n;j++)
-			if(i==j)	graph[i][j]=0;	//Shortest distance between (i,i) is 0
+	for(i = 1; i <= n; i++) {
+		for(j = 1; j <= n; j++)
+			if(i == j)	graph[i][j] = 0;	//Shortest distance between (i,i) is 0
 			else
 				graph[i][j] = INF;		//Initializing other distances as infinite
 	}
 
-	for(i=1;i<=m;i++)
-	{
-		int u,v,w;
-		cin>>u>>v>>w;
+	for(i = 1; i <= m; i++) {
+		int u, v, w;
+		cin>> u >> v >> w;
 		graph[u][v] = w;				//input graph
 		graph[v][u] = w;				//Shortest distance between (i,j) using atmost one edge
 	}
 
 
-	for(k=1;k<=n;k++)					
-	{
-		for(int u=1;u<=n;u++)
-		{
-			for(int v=1;v<=n;v++)
-			{
+	for(k = 1; k <= n; k++) {
+		for(int u = 1; u <= n; u++) {
+			for(int v = 1;v <= n; v++) {
 				//Shortest distance between (i,j) using atmost k edges
-				graph[u][v] = min(graph[u][v],graph[u][k]+graph[k][v]);	
+				graph[u][v] = min(graph[u][v], graph[u][k] + graph[k][v]);	
 			}
 		}
 	}
 
 	//Resulting all pair shortest path in given graph
-	for(int u=1;u<=n;u++)
-	{
-		for(int v=1;v<=n;v++)
-		{
-			cout<<graph[u][v]<<" ";
+	for(int u = 1; u <= n; u++) {
+		for(int v = 1; v <= n; v++) {
+			cout << graph[u][v] << " ";
 		}
-		cout<<endl;
+		cout << endl;
 	}
-	cout<<endl;
+	cout << endl;
 	return 0;
 }
 

From 4efed9cd0d862f1429e3bb9222c810ab5465d6c9 Mon Sep 17 00:00:00 2001
From: Vivek Kumar <vivek.ku1997@gmail.com>
Date: Sat, 6 Oct 2018 12:54:38 +0530
Subject: [PATCH 03/10] Deleted extra trailing whitespaces

---
 floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp b/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp
index ecbe3f70..e3c26655 100644
--- a/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp	
+++ b/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp	
@@ -28,7 +28,7 @@ int main() {
 		for(int u = 1; u <= n; u++) {
 			for(int v = 1;v <= n; v++) {
 				//Shortest distance between (i,j) using atmost k edges
-				graph[u][v] = min(graph[u][v], graph[u][k] + graph[k][v]);	
+				graph[u][v] = min(graph[u][v], graph[u][k] + graph[k][v]);
 			}
 		}
 	}
@@ -46,8 +46,8 @@ int main() {
 
 /*
 Input:-
-First line contain two space separated integer n and m 
-where n is the number of vertices and m is the number 
+First line contain two space separated integer n and m
+where n is the number of vertices and m is the number
 of edges.Next m lines contains three space seprated integers
 u, v and w which represents that there is an edge between u and v
 and weight of the edge is w

From 57bffc236be0ef468c62b836863a373becd79c29 Mon Sep 17 00:00:00 2001
From: Vivek Kumar <vivek.ku1997@gmail.com>
Date: Sat, 6 Oct 2018 13:17:16 +0530
Subject: [PATCH 04/10] Updated comments

---
 .../CPP/floyd-warshall algorithm.cpp             | 16 ++++++++--------
 1 file changed, 8 insertions(+), 8 deletions(-)

diff --git a/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp b/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp
index e3c26655..61c71e0d 100644
--- a/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp	
+++ b/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp	
@@ -1,4 +1,4 @@
-//Floyd-Warshall Algorithm: all pair shortest path
+// Floyd-Warshall Algorithm: all pair shortest path
 #include <iostream>
 #include <climits>
 using namespace std;
@@ -7,33 +7,33 @@ using namespace std;
 
 int main() {
 	int graph[1001][1001], i, j, k, n, m;
-	cin >> n >> m;	//number of vertices and edges respectively
+	cin >> n >> m;	// number of vertices and edges respectively
 
 	for(i = 1; i <= n; i++) {
 		for(j = 1; j <= n; j++)
-			if(i == j)	graph[i][j] = 0;	//Shortest distance between (i,i) is 0
+			if(i == j)	graph[i][j] = 0;	// Shortest distance between (i,i) is 0
 			else
-				graph[i][j] = INF;		//Initializing other distances as infinite
+				graph[i][j] = INF;	// Initializing other distances as infinite
 	}
 
 	for(i = 1; i <= m; i++) {
 		int u, v, w;
 		cin>> u >> v >> w;
-		graph[u][v] = w;				//input graph
-		graph[v][u] = w;				//Shortest distance between (i,j) using atmost one edge
+		graph[u][v] = w;	// input graph
+		graph[v][u] = w;	// Shortest distance between (i,j) using atmost one edge
 	}
 
 
 	for(k = 1; k <= n; k++) {
 		for(int u = 1; u <= n; u++) {
 			for(int v = 1;v <= n; v++) {
-				//Shortest distance between (i,j) using atmost k edges
+				// Shortest distance between (i,j) using atmost k edges
 				graph[u][v] = min(graph[u][v], graph[u][k] + graph[k][v]);
 			}
 		}
 	}
 
-	//Resulting all pair shortest path in given graph
+	// Resulting all pair shortest path in given graph
 	for(int u = 1; u <= n; u++) {
 		for(int v = 1; v <= n; v++) {
 			cout << graph[u][v] << " ";

From c578bd6f9113736c36767c174174348800b1299c Mon Sep 17 00:00:00 2001
From: Vivek Kumar <vivek.ku1997@gmail.com>
Date: Sat, 6 Oct 2018 13:28:43 +0530
Subject: [PATCH 05/10] Added whitespace

---
 floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp b/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp
index 61c71e0d..0eaa7206 100644
--- a/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp	
+++ b/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp	
@@ -26,7 +26,7 @@ int main() {
 
 	for(k = 1; k <= n; k++) {
 		for(int u = 1; u <= n; u++) {
-			for(int v = 1;v <= n; v++) {
+			for(int v = 1; v <= n; v++) {
 				// Shortest distance between (i,j) using atmost k edges
 				graph[u][v] = min(graph[u][v], graph[u][k] + graph[k][v]);
 			}

From 3f7560f0773aab03931ac17a2e003febb6db8fce Mon Sep 17 00:00:00 2001
From: vivekcrux <vivek.ku1997@gmail.com>
Date: Sat, 6 Oct 2018 13:38:39 +0530
Subject: [PATCH 06/10] renamed file from floyd-warshall algorithm.cpp to
 floyd_warshall_algorithm.cpp

---
 ...{floyd-warshall algorithm.cpp => floyd_warshall_algorithm.cpp} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename floyd_warshall_algorithm/CPP/{floyd-warshall algorithm.cpp => floyd_warshall_algorithm.cpp} (100%)

diff --git a/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp b/floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp
similarity index 100%
rename from floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp
rename to floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp

From eeed8d3b575d166018edfb7a9d7bf7cd7edfc67b Mon Sep 17 00:00:00 2001
From: vivekcrux <vivek.ku1997@gmail.com>
Date: Sat, 6 Oct 2018 14:05:30 +0530
Subject: [PATCH 07/10] added input.txt

---
 .../CPP/floyd_warshall_algorithm.cpp                   |  1 +
 floyd_warshall_algorithm/CPP/input.txt                 | 10 ++++++++++
 2 files changed, 11 insertions(+)
 create mode 100644 floyd_warshall_algorithm/CPP/input.txt

diff --git a/floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp b/floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp
index 0eaa7206..7494cc64 100644
--- a/floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp
+++ b/floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp
@@ -6,6 +6,7 @@ using namespace std;
 #define INF 999999999
 
 int main() {
+	freopen("input.txt", "r", stdin);
 	int graph[1001][1001], i, j, k, n, m;
 	cin >> n >> m;	// number of vertices and edges respectively
 
diff --git a/floyd_warshall_algorithm/CPP/input.txt b/floyd_warshall_algorithm/CPP/input.txt
new file mode 100644
index 00000000..574ac24c
--- /dev/null
+++ b/floyd_warshall_algorithm/CPP/input.txt
@@ -0,0 +1,10 @@
+6 9
+1 2 1
+1 3 2
+1 4 5
+2 4 5
+2 5 2
+3 4 3
+4 5 1
+4 6 1
+5 6 4
\ No newline at end of file

From 1f2b74ab0741c0e50b911daaef43bebae72526c2 Mon Sep 17 00:00:00 2001
From: Vivek Kumar <vivek.ku1997@gmail.com>
Date: Sun, 7 Oct 2018 01:12:55 +0530
Subject: [PATCH 08/10] graph matrix size fix

graph matrix size according to input number of vertices.
---
 floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp b/floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp
index 7494cc64..d55b0e94 100644
--- a/floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp
+++ b/floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp
@@ -7,9 +7,10 @@ using namespace std;
 
 int main() {
 	freopen("input.txt", "r", stdin);
-	int graph[1001][1001], i, j, k, n, m;
+	int i, j, k, n, m;
 	cin >> n >> m;	// number of vertices and edges respectively
-
+	int graph[n+1][n+1];
+	
 	for(i = 1; i <= n; i++) {
 		for(j = 1; j <= n; j++)
 			if(i == j)	graph[i][j] = 0;	// Shortest distance between (i,i) is 0

From 590cd8e6f5b1472522b542247fe94660eaafc97a Mon Sep 17 00:00:00 2001
From: Vivek Kumar <vivek.ku1997@gmail.com>
Date: Sun, 7 Oct 2018 01:22:48 +0530
Subject: [PATCH 09/10] Removed whitespace

---
 floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp b/floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp
index d55b0e94..3c21cc6e 100644
--- a/floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp
+++ b/floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp
@@ -10,7 +10,7 @@ int main() {
 	int i, j, k, n, m;
 	cin >> n >> m;	// number of vertices and edges respectively
 	int graph[n+1][n+1];
-	
+
 	for(i = 1; i <= n; i++) {
 		for(j = 1; j <= n; j++)
 			if(i == j)	graph[i][j] = 0;	// Shortest distance between (i,i) is 0

From 85f6af2baeb8803afeea3bd95f547103865ba6fb Mon Sep 17 00:00:00 2001
From: vivekcrux <vivek.ku1997@gmail.com>
Date: Sun, 7 Oct 2018 01:41:12 +0530
Subject: [PATCH 10/10] fix bus error

---
 .../CPP/.fuse_hidden0000026400000001          |  66 ++++++++++++++++++
 floyd_warshall_algorithm/CPP/a                | Bin 0 -> 17064 bytes
 .../CPP/floyd_warshall_algorithm.cpp          |   6 +-
 3 files changed, 70 insertions(+), 2 deletions(-)
 create mode 100644 floyd_warshall_algorithm/CPP/.fuse_hidden0000026400000001
 create mode 100644 floyd_warshall_algorithm/CPP/a

diff --git a/floyd_warshall_algorithm/CPP/.fuse_hidden0000026400000001 b/floyd_warshall_algorithm/CPP/.fuse_hidden0000026400000001
new file mode 100644
index 00000000..7494cc64
--- /dev/null
+++ b/floyd_warshall_algorithm/CPP/.fuse_hidden0000026400000001
@@ -0,0 +1,66 @@
+// Floyd-Warshall Algorithm: all pair shortest path
+#include <iostream>
+#include <climits>
+using namespace std;
+
+#define INF 999999999
+
+int main() {
+	freopen("input.txt", "r", stdin);
+	int graph[1001][1001], i, j, k, n, m;
+	cin >> n >> m;	// number of vertices and edges respectively
+
+	for(i = 1; i <= n; i++) {
+		for(j = 1; j <= n; j++)
+			if(i == j)	graph[i][j] = 0;	// Shortest distance between (i,i) is 0
+			else
+				graph[i][j] = INF;	// Initializing other distances as infinite
+	}
+
+	for(i = 1; i <= m; i++) {
+		int u, v, w;
+		cin>> u >> v >> w;
+		graph[u][v] = w;	// input graph
+		graph[v][u] = w;	// Shortest distance between (i,j) using atmost one edge
+	}
+
+
+	for(k = 1; k <= n; k++) {
+		for(int u = 1; u <= n; u++) {
+			for(int v = 1; v <= n; v++) {
+				// Shortest distance between (i,j) using atmost k edges
+				graph[u][v] = min(graph[u][v], graph[u][k] + graph[k][v]);
+			}
+		}
+	}
+
+	// Resulting all pair shortest path in given graph
+	for(int u = 1; u <= n; u++) {
+		for(int v = 1; v <= n; v++) {
+			cout << graph[u][v] << " ";
+		}
+		cout << endl;
+	}
+	cout << endl;
+	return 0;
+}
+
+/*
+Input:-
+First line contain two space separated integer n and m
+where n is the number of vertices and m is the number
+of edges.Next m lines contains three space seprated integers
+u, v and w which represents that there is an edge between u and v
+and weight of the edge is w
+Sample Input:-
+6 9
+1 2 1
+1 3 2
+1 4 5
+2 4 5
+2 5 2
+3 4 3
+4 5 1
+4 6 1
+5 6 4
+*/
diff --git a/floyd_warshall_algorithm/CPP/a b/floyd_warshall_algorithm/CPP/a
new file mode 100644
index 0000000000000000000000000000000000000000..056315564a99b54b4f54f4dfb96db8c7482c5288
GIT binary patch
literal 17064
zcmeHOe{5UFeLs?x?KCk(IZEdwOH3s3<}5HR#daXqOY$iBIZuh~D3+XhP1R?LqAd=T
zsFIJioWZbM*=Y$zwb3?#vlXbZ0)tm%SkM(iR$#Vlcad!rgX*qLwz`0qIjuA+tAZ$j
z(Ar@?-@E&gkIz(F1layq`Gw#6-uLtUad+Q$@BB`@J7{)n@%wy&$uAxgB#nm*38}jf
zt2aqeV=dxVVTgOhJz_DCMYs&9A+Acy`~6D6e5tkzfRo=ztv~5EAdzek6RYIC%(;cc
z$*)X?E-D_<6)+ber6#{RDr#Bi{xKhuN+FoDU8%k>IfKH6WX#X&hB0^hQEpyaqs(7>
zRQWL<*ZpqN^|Bwq<Tt7PCbb{)u=Zol`J|lCHL3NJeghK81~Czq_cG@kcE02EQMpkY
zG=>dn$-G-iLNI5)XW&Qe{9TFDzFpV1P+mH9`<d(XinaaefyCNWaxgdCn@Q|j8z~o4
z$=<c8zDPDrZK3v2UF7$~wjH<&L1RsamF0TKL0ptOj(;o4M7QDMvAGOo>f;hzpTNbB
z3Pl<37I3m99mP@kX!0NOHA;+PQjF}&OZ?#*bGPi-5eqdQzpd>-^G6+ktI{mc<yAEI
zqk?Mq$_4EIVFA2pfjHk=!2V|o;4KTpq1=aYdFd+v8pNGqJZebQ3iuO!8W;7eDP-VY
zrhA|#`w_#CAdmCQkO)7a@sN)5SHLOGYo0g)qa*9|#UFYI10?c@u<bnq=|MZ|#4?U;
z3;Q!&PAc2p<uo_P`(qi~$;6UQwmoi|+kvg?jb)Q@JDqhhiP%7UyxTUrHrSm{#iif+
z#9&{lJ^s7-cH7-e@P0&9xh|d@M2u}+PD?VKwNXuCefwb2+1zaIm3TUpH9NO#?@D*s
zW;Me$W!UAckEe4^$t5XE$xPPVo}``+s7|A_Cmy%6BsCKrS2z+w?Xcs+F+1iYhLeui
zok^sJ5(JW&&eK2)W>0jqx3<|2M;?xBQ01LF?RAm$zva!Ohv&yz;&<H%Va$g&=XN|p
z9yhtWl6b8G;z|8nNl!)66FCol1w+9vp4Ix<#|??oyT@aMfO!{A?<o_HCwiCZU1#F)
zL^!>(Ogvr*r}vy`g&u!2H}Kp+y08n^O_VOHUASK&>el4KX)a-Eap64YlFo49?)k`a
z;c6aIkvd&CwUue73#YlTMzsvoGEmDvEd#X-)H3k<lL2dVW~o)Edv~o6){$|?U!1f?
zzqj;UDFMX|Z$njFbrtvel?F;A_mh75N)fc`KS-ueo#{y_Un1F0^0<^Ql1!gA)2~VS
zEXnjqGkrqJ-zAwoWu}iw`P(GZC(QJSl)ptXeY#8!N%^lyrcb@;U67mKZO{MUb5{Os
zYxL@DXLtL=_{bfGuqMugB%64n0d2lxF?{CgS8f*K{d2n`^(zm<UG?YnefSXCVXYYg
zvqtBGR{ov6cfU?rN=HM_X;Kug>}H>ybCiX0j8mlFVIBG(8Q{!E0R*t}v(}lZ$1UF*
z)(<{%?kGjOm7~?K6g}q<673mz^qFQ<mTTAn$EiW|sOOEk#{l`>mo=R}k3RrdqmPSR
z-L<d6uN3S(awtyrOg|4FDqDwUMpi#6@GwtC(E9w@Q*~iOoL++4)XN_gi`JNV*~-6h
zn!aeKOak&}fxQLH%D*|a4#<RgogQStyu8u8elRg%&X>gbgPjHQ`X+NecVEGrw~iNf
zT({zvtmLI>JX*^)IdS;Nu{X~aDRI}rzsaI_;V(ChBJj17qp0oLS4(xig*xkxzJdVO
z*pU|ztJK)zH*{l<d`ZF7-q8|xxC{;gER2zJ;U%&y9Fa;iG=9NKUQlhlm_PgywY4xN
zO<t1bzsZmqI{h5dJYmk25;9kRbP{cyFlS59Z2i&iNNA=6&D0+~4ya(xQOag3Qdany
zOj*I4fo|)ZyNTxuDxJQ`ym<xbkj>pOW5q9ef?TxDyzRGq^dPV32ibti3!*^QmkL`^
z<;^`GHD`R&pGAj8(fVma7Uq1@56CV~l^Q>F(4H`_mc*+EHx<mQ)Q_pkeyFx$Xwf2S
z>dEWH;;9CVIx9ahb>ml5$yMLAe?CPkd}T2&!71OhS6twK0hELL!Z|sbM`uF$1K0Dp
z`OyQ{eYrnAbYQ-S(UrUR^uM>Fk{`kPyZxx{6p5#4)jxFz*fHgOifm6)%cuSxo$65`
z^9Sawd~Vh%n6rft?(+q)@$7-cBwt%Za?iPA(N9O8ZO^|M-4X5X7+dw_)dDZ~*qWEY
zyQ29U?fDNo9(+g6nP+YUrcVD71M|qcPPq9eJU?{gf7y}$aC80_(PHCeYxJDY+W6Dl
zf76`$Tu=0~(Vpn%qV~CC<@w`%Otmsz#jJ~l*Ql0(S_WzvsAZs*fm#M?8K`BTmVy6;
z4EXR{ipYrM;84zqIKz$zW9fN!U{fdRqTfw!n=KY!1%DMh1%4TvRy5y!uUPyy@R7M<
zu@N8Ir@+^P{}6l*_;v7Z$f*yC#jk@m0weN0zg_r-L%zFjTe9?+Z%K%L*ZD(SEr|ON
z8Gx$Ws^5Uf_D^ApR!e#S_a<CBe^D%+AS4*t5?t|Q{jK|!j)=$a+Vm&u9=MNS^4p2)
z$MF4Ea*hT=FZkP*Ee>4pqbX894EW9Wi$#3wm-TVdDu3#CAM}s8_4~{E*MWZl`a9hE
zPNm0EU%Z9u1oR2gw+2H;{jI?jUk;eT@Ytf(;OZCatYFg%i>+YG=#s5LBNJ?i2AiV6
z)vduW>|oy-T&jL2Lq5+V4(EWv)u@(%S_WzvsAZs*fm#M?8K`BTmVsIZ{{Lm*1b)vX
zy40xnh?XUY8<qx=y!=-lyiOai9qqv*x<@h5tL4%jIlZrv_r@K@&#Odt$~*R5;%7>t
zyXC#SU+*q0k83@x!-!~2MYKpUG3z&E>4T4oX(|{2CG#G)D~puOd)tP!p7-P(((UEF
zcq=FfNUp_HQQql?Xi0`48Ly#eZAQdvPu?r{2MQJ~OAJ|Je0;HzxgW#Yj`tdJ{rFW?
z_Gd)f<JTxDbG=xOO1W3-b(sG%#{0^>6+WV$_ZH2c)qJ<+do_PS^OrUM8_oYwb8p-y
z+S)!9UTviZ610swjBTmm4Ur9zCcF7TRq#4gkpmdzC;i4v8ro$#SrreI#+TbEfYHa}
ztP-yiJiaRN#e&CSCB8&ddwv0oa(?cW_O}QgKb80=O5>~&$EdE7&j5C?hO6SsO6NB!
z;{*l2x0QIk;PVWXcnIeL3^ydp0qnr;uZk}(%>!<yfVf@o`(KGS3fkV_r2yXAYU45>
zJ}G#=uiGae@Rl0Y;;az6s^aB+<&|-Gwko4Ett=An;pgN^x)-8P)Qd$r4|@6$8zp|H
zpr56Q7`IUNV`uT#^t>(qh6Ie}4Z?Xoch6VV>U|ORG`o7A%Qt}fs^smYv|oNx{{Kni
zJa0=8x9{WfRmtbuz(Zn%plvR0>hTK^2JX%CG>jUMA0Agc&wmm4a`cz><q*lg#evV`
zT8_(m4!}SH8~iH-{nqcMt-#6NOBd0e<v88p9p?$M_b(H(`h9_!qyrSc$~l8$3&j5x
z@cYpIpX=wiTE~gWddu$}|1EQTfjD*2UOT(k{R`mVl=#i_KnrlnkN3H3CcMfyiRXaR
zbM!v1@1PAK*k5TiT&=-QD`|h{P4OMz)$;#}#Fq)$enlkz)(QT%3)qiqd)l={1W^*5
zW1{x+{(C+z^0Niv)Zst&u=aJcM&Q&=+96UwyHn}?efGXsCfgrNrR-R0Pdbxy`UfKM
zp&^{2=yE!mHx4Be@x;DlHetupgE$0|i_=jHs9J10nNH%s2E_HvHXW02a8QJhWGt0@
z9uf|j#0LB9zJ&54xhaYB8BcUP-5TwHORm>$x8=zS+r~*H+qCR0+oM}e+uFQc*qi@s
zTXbuC8_r=+P&<~%#P-`ba8e1#V=SeZPjA`MW#XVow6(*;Ig><R%!vuR{b@80=RE9O
zHUW1u|KlB8F${SEM4$Sw?Y?Z<?nf6>2?X8Nr4F5VjQUb`CXq_VakzwYgq#Z59&M^m
zl(-L}cr<A7x`E_id(zzgRJYyrF#VJL_!tLwJncif-6w4-wfZQGr!{u>);8PRwpkw@
zlIL$K{g4_YULBpm<Lb?3xqS11A3De5^_B;3;@O;h@-ny7#^i!#yD>s!KIl|YRV#Jc
ziN=~%my+%|3{~|&Qe{XH$?hL;V!hx_M)7_wB?p~EW=KQ^(@r81ZEauU#P*2Dp21wC
zKbGwmk-q(da8}&OD9zqPCX1J&La?F3xQUU2E)As|5s`0P1P7H+mc5Q-(sGbT68-k>
zOl%-w_xHh<CFP-B9_7L1Kaax<(PIP2II2z~AZ`&^i;9THCL;0lz(8WqshBuEo<Qp&
z{8vz#-}w8L&%dtnge6-y-4B7*9_9JbkZPJIiNf+;zVZLJjBG%G)>7=x>#bQ0bZSGg
zAzG>!zI_zYCe;tIR$+f5U`U0b7gR0EtaL__{WUB$p+IXh_UG^GVeKz>5JOMvJL)_8
z^E#>x7@4v^e}`Yu4dnG7OeA^p_Y_cCd$B)%ulMQ&C4J8kasSzl`A+C)Eywc6VuQ@_
zeJ`0X6qD^I8*aab#U2!>sq8<l{l~Tcur}oS*`NFWdF|h-?RY)fq8FrZx%_F(>h=E%
zV3ZSG9saX7Ab~=Pk&l~nT1(Jgl-&Md?H|_uCrXy8pkWR#4te~?wg0#_JnN~D{W&as
zH@fTR@4LhLgPGUeZ0`vt#<V}@pTA2*Sb5yej+%S@Ujk0`vp;`-H-?o%w_>Hc*Z-T)
zxczzk)E`zZyGZFGetr!79SU?#Projubrzqa_U4QInbY?^zQ#-bydE200}#Y^N-E2Y
z{|gk<M6RFLZRdZBKgYX>0*yWP=k*<*a}Vpp^7!O>xnDnoue*L;2hOflHL#tMZf-xl
zA8vnP7|OIsv0aLl?p#0f|AfZv&)?6xwEsf&bHJaYK(V<0Bf9<}uAc{%b_i?EYz76Y
zUz;;5*#Eu~q6%b7<mR3#r2aV9uM<yypZg<R+;5(L=>6ihOGka1e?%2FdX!u*+cu!!
SF_Eg~PbrHJ*idt?|E~cl0SB@G

literal 0
HcmV?d00001

diff --git a/floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp b/floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp
index 3c21cc6e..efa74057 100644
--- a/floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp
+++ b/floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp
@@ -1,15 +1,17 @@
 // Floyd-Warshall Algorithm: all pair shortest path
 #include <iostream>
+#include <vector>
 #include <climits>
 using namespace std;
 
 #define INF 999999999
+#define MAXN 1001
 
 int main() {
 	freopen("input.txt", "r", stdin);
 	int i, j, k, n, m;
 	cin >> n >> m;	// number of vertices and edges respectively
-	int graph[n+1][n+1];
+	int graph[MAXN][MAXN];
 
 	for(i = 1; i <= n; i++) {
 		for(j = 1; j <= n; j++)
@@ -49,7 +51,7 @@ int main() {
 /*
 Input:-
 First line contain two space separated integer n and m
-where n is the number of vertices and m is the number
+where n(1 <= n <= 1000) is the number of vertices and m is the number
 of edges.Next m lines contains three space seprated integers
 u, v and w which represents that there is an edge between u and v
 and weight of the edge is w