Skip to content

Commit ff0a1c7

Browse files
jakobkoglerjakobkogler
authored
Merge pull request cp-algorithms#735 from orendon/patch-1
Fix broken link in bellman ford section
2 parents 4119db0 + a88423d commit ff0a1c7

1 file changed

Lines changed: 1 addition & 1 deletion

File tree

‎src/graph/bellman_ford.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -264,7 +264,7 @@ bool spfa(int s, vector<int>& d) {
264264
265265
A list of tasks that can be solved using the Bellman-Ford algorithm:
266266
267-
* [E-OLIMP #1453 "Ford-Bellman" [difficulty: low]](http://www.e-olimp.com.ua/problems/1453)
267+
* [E-OLYMP #1453 "Ford-Bellman" [difficulty: low]](https://www.e-olymp.com/en/problems/1453)
268268
* [UVA #423 "MPI Maelstrom" [difficulty: low]](http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=364)
269269
* [UVA #534 "Frogger" [difficulty: medium]](http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=7&page=show_problem&problem=475)
270270
* [UVA #10099 "The Tourist Guide" [difficulty: medium]](http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=12&page=show_problem&problem=1040)

0 commit comments

Comments
 (0)