diff options
| author | Gloria Mundi <gloria@gloria-mundi.eu> | 2024-11-16 01:24:14 +0100 |
|---|---|---|
| committer | Gloria Mundi <gloria@gloria-mundi.eu> | 2024-11-16 01:24:14 +0100 |
| commit | 98567ec798aa8ca2cfbcb85c774dd470f30e30d4 (patch) | |
| tree | 5113d5cc24d1ad5f93810b6442ce584a36950dc8 /graph/bellmannFord.cpp | |
| parent | ad3856a6b766087df0036de0b556f4700a6498c9 (diff) | |
| parent | 8d11c6c8213f46f0fa19826917c255edd5d43cb1 (diff) | |
mzuenni tests
Diffstat (limited to 'graph/bellmannFord.cpp')
| -rw-r--r-- | graph/bellmannFord.cpp | 17 |
1 files changed, 0 insertions, 17 deletions
diff --git a/graph/bellmannFord.cpp b/graph/bellmannFord.cpp deleted file mode 100644 index 4324886..0000000 --- a/graph/bellmannFord.cpp +++ /dev/null @@ -1,17 +0,0 @@ -void bellmannFord(int n, vector<edge> edges, int start) { - vector<ll> dist(n, INF), parent(n, -1); - dist[start] = 0; - - for (int i = 1; i < n; i++) { - for (edge& e : edges) { - if (dist[e.from] != INF && - dist[e.from] + e.cost < dist[e.to]) { - dist[e.to] = dist[e.from] + e.cost; - parent[e.to] = e.from; - }}} - - for (edge& e : edges) { - if (dist[e.from] != INF && - dist[e.from] + e.cost < dist[e.to]) { - // Negativer Kreis gefunden. -}}} //return dist, parent?; |
