Skip to content

Update BellmanFordAdjacencyList.java #317

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
choprasaurav7 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update BellmanFordAdjacencyList.java #317

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 1 addition & 2 deletions src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordAdjacencyList.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -54,7 +54,7 @@ public static double[] bellmanFord(List<Edge>[] graph, int V, int start) {
dist[start] = 0;

// For each vertex, apply relaxation for all the edges
for (int i = 0; i < V - 1; i++)
for (int i = 0; i <=V - 1; i++)
for (List<Edge> edges : graph)
for (Edge edge : edges)
if (dist[edge.from] + edge.cost < dist[edge.to])
Expand All @@ -63,7 +63,6 @@ public static double[] bellmanFord(List<Edge>[] graph, int V, int start) {
// Run algorithm a second time to detect which nodes are part
// of a negative cycle. A negative cycle has occurred if we
// can find a better path beyond the optimal solution.
for (int i = 0; i < V - 1; i++)
for (List<Edge> edges : graph)
for (Edge edge : edges)
if (dist[edge.from] + edge.cost < dist[edge.to]) dist[edge.to] = Double.NEGATIVE_INFINITY;
Expand Down