algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-07 17:56:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

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

Browse Source
This commit is contained in:
Nishant Chatterjee
2021-04-18 03:02:48 -07:00
committed by GitHub
parent 8cece6c399
commit 02fab665de
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
DataStructures/Graphs/BellmanFord.java
View File

@ -4,7 +4,7 @@ import java.util.*;
class BellmanFord
/*Implementation of Bellman ford to detect negative cycles. Graph accepts inputs in form of edges which have
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*/
{
int vertex, edge;
private Edge edges[];