summaryrefslogtreecommitdiffhomepage
path: root/nl-nl
diff options
context:
space:
mode:
authorLukaxFeh <outrolucas2002@gmail.com>2018-10-31 18:16:41 -0300
committerLukaxFeh <outrolucas2002@gmail.com>2018-10-31 18:16:41 -0300
commit0838b7203a481d2bfb82f03bb6f6dbe54ed8bbb2 (patch)
tree5f792caf19fd20950552d948d8b62d326df41fd5 /nl-nl
parentd553a02345298eabe3eb5e567bdc478dff773c81 (diff)
[Dynamic programming - NL/NL] Fixed links
Diffstat (limited to 'nl-nl')
-rw-r--r--nl-nl/dynamic-programming-nl.html.markdown6
1 files changed, 3 insertions, 3 deletions
diff --git a/nl-nl/dynamic-programming-nl.html.markdown b/nl-nl/dynamic-programming-nl.html.markdown
index 5186a3bf..e56a9774 100644
--- a/nl-nl/dynamic-programming-nl.html.markdown
+++ b/nl-nl/dynamic-programming-nl.html.markdown
@@ -46,9 +46,9 @@ for i=0 to n-1
### Enkele beroemde DP problemen
-- Floyd Warshall Algorithm - Tutorial and C Program source code: [http://www.thelearningpoint.net/computer-science/algorithms-all-to-all-shortest-paths-in-graphs---floyd-warshall-algorithm-with-c-program-source-code]()
-- Integer Knapsack Problem - Tutorial and C Program source code: [http://www.thelearningpoint.net/computer-science/algorithms-dynamic-programming---the-integer-knapsack-problem]()
-- Longest Common Subsequence - Tutorial and C Program source code : [http://www.thelearningpoint.net/computer-science/algorithms-dynamic-programming---longest-common-subsequence]()
+- [Floyd Warshall Algorithm - Tutorial and C Program source code](http://www.thelearningpoint.net/computer-science/algorithms-all-to-all-shortest-paths-in-graphs---floyd-warshall-algorithm-with-c-program-source-code)
+- [Integer Knapsack Problem - Tutorial and C Program source code](http://www.thelearningpoint.net/computer-science/algorithms-dynamic-programming---the-integer-knapsack-problem)
+- [Longest Common Subsequence - Tutorial and C Program source code](http://www.thelearningpoint.net/computer-science/algorithms-dynamic-programming---longest-common-subsequence)
## Online Bronnen