fix edge case of a 1 node graph with a negative loop

podd0 · podd0 · commit 960439275626 · 2023-10-27T22:20:26.000+02:00
diff --git a/source/bellman_ford.h b/source/bellman_ford.h
@@ -16,7 +16,7 @@ vector<ll> bellman_ford(vector<array<int, 3>>& edges, int v, int src) {
 		}
 	}
 
-	for (int i = 0; i < v - 1 && relaxed; ++i) {
+	for (int i = 0; i < v && relaxed; ++i) {
 		relaxed = false;
 		for (auto [start, end, weight] : edges) {
 			if (dist[start] == -INF || (dist[start] != INF && dist[start] + weight < dist[end])) {

Original file line number	Diff line number	Diff line change
`@@ -16,7 +16,7 @@ vector<ll> bellman_ford(vector<array<int, 3>>& edges, int v, int src) {`
`16`	`16`	`}`
`17`	`17`	`}`
`18`	`18`
`19`		`- for (int i = 0; i < v - 1 && relaxed; ++i) {`
	`19`	`+ for (int i = 0; i < v && relaxed; ++i) {`
`20`	`20`	`relaxed = false;`
`21`	`21`	`for (auto [start, end, weight] : edges) {`
`22`	`22`	`if (dist[start] == -INF \|\| (dist[start] != INF && dist[start] + weight < dist[end])) {`