wiki_research

commit d4d855a775a49d3a74cb4bf4247f04753aa17604
parent e382e8dbb1b60350acce119915c6045b6dbda291
Author: Antoine Amarilli <a3nm@a3nm.net>
Date:   Sun,  6 Apr 2025 23:58:08 +0200

commit with codex

Diffstat:
bellman_ford_algorithm
 | 
2
++

1 file changed, 2 insertions(+), 0 deletions(-)
diff --git a/bellman_ford_algorithm b/bellman_ford_algorithm
@@ -3,6 +3,8 @@
 [shortest_path_algorithm] for [single_source_shortest_path] on [graphs] with [negative_weight] [edges]
 - Must in particular handle [negative_cycles]
 
+Optimality: [jukna2016optimality]
+
 Up: [shortest_path_algorithm]
 
 Aliases: Bellman-Ford, Bellman Ford