[Algo] floyd warshall algorithm for finding all pair shortest path in a connected graph [CPP] #287

vivekcrux · 2018-10-05T07:33:33Z

…ected graph

For short term contributors: we understand that getting your commits well
defined like we require is a hard task and takes some learning. If you
look to help without wanting to contribute long term there's no need
for you to learn this. Just drop us a message and we'll take care of brushing
up your stuff for merge!

Fixes #338

By submitting this pull request I confirm I've read and complied with the
below declarations.

I have read the Contribution guidelines and I am confident that my PR reflects them.
I have followed the commit guidelines for this project.
My code follows the standard code structure.
This pull request has a descriptive title. For example, {Tag}: Add {Algorithm/DS name} [{Language}], not Update README.md or Added new code.
This pull request will be closed if I fail to update it even once in a continuous time span of 7 days.
This pull request shall only be reviewed and merged once all the checks passes. No maintainer or supporter shall be obliged to review it before this condition is met.
I have mentioned the issue number correctly (with hyperlink) in this pull request description.

After you submit your pull request, DO NOT click the 'Update Branch' button.

…ected graph

sangamcse · 2018-10-05T07:35:31Z

floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp

+	}
+
+
+	for(k=1;k<=n;k++)					


Line contains following spacing inconsistencies:

Trailing whitespaces.

Origin: SpaceConsistencyBear, Section: all.cpp.

The issue can be fixed by applying the following patch:

--- a/tmp/tmpux02frhq/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp +++ b/tmp/tmpux02frhq/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp @@ -27,7 +27,7 @@ } - for(k=1;k<=n;k++) + for(k=1;k<=n;k++) { for(int u=1;u<=n;u++) {

sangamcse · 2018-10-05T07:35:32Z

floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp

+			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]);	


Line contains following spacing inconsistencies:

Trailing whitespaces.

Origin: SpaceConsistencyBear, Section: all.cpp.

The issue can be fixed by applying the following patch:

--- a/tmp/tmpux02frhq/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp +++ b/tmp/tmpux02frhq/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp @@ -34,7 +34,7 @@ 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]); } } }

sangamcse · 2018-10-05T07:35:33Z

floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp

+
+/*
+Input:-
+First line contain two space separated integer n and m 


Line contains following spacing inconsistencies:

Trailing whitespaces.

Origin: SpaceConsistencyBear, Section: all.cpp.

The issue can be fixed by applying the following patch:

--- a/tmp/tmpux02frhq/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp +++ b/tmp/tmpux02frhq/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp @@ -54,7 +54,7 @@ /* Input:- -First line contain two space separated integer n and m +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

sangamcse · 2018-10-05T07:35:34Z

floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp

+/*
+Input:-
+First line contain two space separated integer n and m 
+where n is the number of vertices and m is the number 


Line contains following spacing inconsistencies:

Trailing whitespaces.

Origin: SpaceConsistencyBear, Section: all.cpp.

The issue can be fixed by applying the following patch:

--- a/tmp/tmpux02frhq/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp +++ b/tmp/tmpux02frhq/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp @@ -55,7 +55,7 @@ /* 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 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

sangamcse · 2018-10-06T07:15:53Z

floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp

+	cout << endl;
+	return 0;
+}
+


Line contains following spacing inconsistencies:

Trailing whitespaces.

Origin: SpaceConsistencyBear, Section: all.cpp.

The issue can be fixed by applying the following patch:

--- a/tmp/tmpphdb420x/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp +++ b/tmp/tmpphdb420x/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp @@ -28,7 +28,7 @@ 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]); } } }

sangamcse · 2018-10-06T07:15:54Z

Comment on 732e3bb, file floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp, line 49.

Line contains following spacing inconsistencies:

Trailing whitespaces.

Origin: SpaceConsistencyBear, Section: all.cpp.

The issue can be fixed by applying the following patch:

--- a/tmp/tmpphdb420x/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp
+++ b/tmp/tmpphdb420x/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp
@@ -46,7 +46,7 @@
 
 /*
 Input:-
-First line contain two space separated integer n and m 
+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

sangamcse · 2018-10-06T07:15:54Z

Comment on 732e3bb, file floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp, line 50.

Line contains following spacing inconsistencies:

Trailing whitespaces.

Origin: SpaceConsistencyBear, Section: all.cpp.

The issue can be fixed by applying the following patch:

--- a/tmp/tmpphdb420x/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp
+++ b/tmp/tmpphdb420x/floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp
@@ -47,7 +47,7 @@
 /*
 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 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

sangamcse · 2018-10-06T07:15:55Z

floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp

+		}
+		cout << endl;
+	}
+	cout << endl;


Missing space after ; [whitespace/semicolon] [3]

Origin: CPPLintBear, Section: all.cpplint.

sangamcse · 2018-10-06T07:15:56Z

floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp

+	cout << endl;
+	return 0;
+}
+


Line ends in whitespace. Consider deleting these extra spaces. [whitespace/end_of_line] [4]

Origin: CPPLintBear, Section: all.cpplint.

sangamcse · 2018-10-06T07:26:44Z

floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp

@@ -0,0 +1,65 @@
+//Floyd-Warshall Algorithm: all pair shortest path
+#include <iostream>


Missing space after ; [whitespace/semicolon] [3]

Origin: CPPLintBear, Section: all.cpplint.

sangamcse · 2018-10-06T07:49:06Z

floyd_warshall_algorithm/CPP/floyd-warshall algorithm.cpp

+				graph[u][v] = min(graph[u][v], graph[u][k] + graph[k][v]);
+			}
+		}
+	}


Missing space after ; [whitespace/semicolon] [3]

Origin: CPPLintBear, Section: all.cpplint.

…rithm.cpp

graph matrix size according to input number of vertices.

floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp

sangamcse · 2018-10-06T19:44:37Z

floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp

+#define INF 999999999
+
+int main() {
+	freopen("input.txt", "r", stdin);


Line ends in whitespace. Consider deleting these extra spaces. [whitespace/end_of_line] [4]

Origin: CPPLintBear, Section: all.cpplint.

sangamcse · 2018-10-06T22:22:08Z

Read the documentation before opening any PR

floyd warshall algorithm for finding all pair shortest path in a conn…

4c70db5

…ected graph

sangamcse added the process/pending_review label Oct 5, 2018

sangamcse reviewed Oct 5, 2018

View reviewed changes

Added whitespaces

732e3bb

sangamcse reviewed Oct 6, 2018

View reviewed changes

Deleted extra trailing whitespaces

4efed9c

sangamcse reviewed Oct 6, 2018

View reviewed changes

Updated comments

57bffc2

sangamcse reviewed Oct 6, 2018

View reviewed changes

vivekcrux added 3 commits October 6, 2018 13:28

Added whitespace

c578bd6

renamed file from floyd-warshall algorithm.cpp to floyd_warshall_algo…

3f7560f

…rithm.cpp

added input.txt

eeed8d3

vivekcrux changed the title ~~floyd warshall algorithm for finding all pair shortest path in a conn…~~ [Algo] floyd warshall algorithm for finding all pair shortest path in a connected graph [CPP] Oct 6, 2018

vivekcrux mentioned this pull request Oct 6, 2018

[Algo] Add floyd warshall algorithm for finding all pair shortest path in a connected graph [CPP] #338

Open

graph matrix size fix

1f2b74a

graph matrix size according to input number of vertices.

sangamcse added bug Something isn't working difficulty/low difficulty/medium hacktoberfest HACKTOBERFEST 2020 type/algo labels Oct 6, 2018

sangamcse reviewed Oct 6, 2018

View reviewed changes

floyd_warshall_algorithm/CPP/floyd_warshall_algorithm.cpp Show resolved Hide resolved

sangamcse reviewed Oct 6, 2018

View reviewed changes

Removed whitespace

590cd8e

fix bus error

85f6af2

sangamcse closed this Oct 6, 2018

sangamcse added invalid This doesn't seem right and removed bug Something isn't working difficulty/low difficulty/medium hacktoberfest HACKTOBERFEST 2020 process/pending_review type/algo labels Oct 6, 2018

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

[Algo] floyd warshall algorithm for finding all pair shortest path in a connected graph [CPP] #287

[Algo] floyd warshall algorithm for finding all pair shortest path in a connected graph [CPP] #287

vivekcrux commented Oct 5, 2018 •

edited

Loading

sangamcse Oct 5, 2018

sangamcse Oct 5, 2018

sangamcse Oct 5, 2018

sangamcse Oct 5, 2018

sangamcse Oct 6, 2018

sangamcse commented Oct 6, 2018

sangamcse commented Oct 6, 2018

sangamcse Oct 6, 2018

sangamcse Oct 6, 2018

sangamcse Oct 6, 2018

sangamcse Oct 6, 2018

sangamcse Oct 6, 2018

sangamcse commented Oct 6, 2018

		@@ -0,0 +1,65 @@
		//Floyd-Warshall Algorithm: all pair shortest path
		#include <iostream>

[Algo] floyd warshall algorithm for finding all pair shortest path in a connected graph [CPP] #287

[Algo] floyd warshall algorithm for finding all pair shortest path in a connected graph [CPP] #287

Conversation

vivekcrux commented Oct 5, 2018 • edited Loading

Choose a reason for hiding this comment

Choose a reason for hiding this comment

Choose a reason for hiding this comment

Choose a reason for hiding this comment

Choose a reason for hiding this comment

sangamcse commented Oct 6, 2018

sangamcse commented Oct 6, 2018

Choose a reason for hiding this comment

Choose a reason for hiding this comment

Choose a reason for hiding this comment

Choose a reason for hiding this comment

Choose a reason for hiding this comment

sangamcse commented Oct 6, 2018

vivekcrux commented Oct 5, 2018 •

edited

Loading