Skip to content

Commit 02fab66

Browse files
authored
fixed typo vertes to vertex Fixes: #{$2189} (TheAlgorithms#2190)
1 parent 8cece6c commit 02fab66

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

DataStructures/Graphs/BellmanFord.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44

55
class BellmanFord
66
/*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*/
7+
start vertex, end vertex and weights. Vertices should be labelled with a number between 0 and total number of vertices-1,both inclusive*/
88
{
99
int vertex, edge;
1010
private Edge edges[];

0 commit comments

Comments
 (0)