Commit02fab66

authored

fixed typo vertes to vertex Fixes: #{$2189} (TheAlgorithms#2190)

1 parent8cece6c commit02fab66Copy full SHA for 02fab66

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -4,7 +4,7 @@`
`4`	`4`
`5`	`5`	`classBellmanFord`
`6`	`6`	`/*Implementation of Bellman ford to detect negative cycles. Graph accepts inputs in form of edges which have`
`7`		`-start vertex, endvertes and weights. Vertices should be labelled with a number between 0 and total number of vertices-1,both inclusive*/`
	`7`	`+start vertex, endvertex and weights. Vertices should be labelled with a number between 0 and total number of vertices-1,both inclusive*/`
`8`	`8`	`{`
`9`	`9`	`intvertex,edge;`
`10`	`10`	`privateEdgeedges[];`

Comments

(0)