bellman_ford_algorithm (326B)
1 # Bellman Ford algorithm 2 3 [shortest_path_algorithm] for [single_source_shortest_path] on [graphs] with [negative_weight] [edges] 4 - Must in particular handle [negative_cycles] 5 6 Optimality: [jukna2016optimality] 7 8 Up: [shortest_path_algorithm] 9 10 Aliases: Bellman-Ford, Bellman Ford 11 12 See also: [single_source_shortest_path_faster]