We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 8cece6c commit 02fab66Copy full SHA for 02fab66
DataStructures/Graphs/BellmanFord.java
@@ -4,7 +4,7 @@
4
5
class BellmanFord
6
/*Implementation of Bellman ford to detect negative cycles. Graph accepts inputs in form of edges which have
7
-start vertex, end vertes and weights. Vertices should be labelled with a number between 0 and total number of vertices-1,both inclusive*/
+start vertex, end vertex and weights. Vertices should be labelled with a number between 0 and total number of vertices-1,both inclusive*/
8
{
9
int vertex, edge;
10
private Edge edges[];
0 commit comments