Voorbeeld - caagt

Algoritme in pseudocode
Input: gewogen n × m-rooster met → en ↓ pijlen
Output: lengte van langste pad (0, 0) (n,m)
1: s0,0 ← 0
2: for i from 1 to n do
3: si,0 ← si−1,0 + w(i−1,0),(i,0)
4: for j from 1 to m do
5: s0,j ← s0,j−1 + w (0,j−1),(0,j)
6: for i from 1 to n do
7: for j from 1
to m do
8: si,j = max
si−1,j + w (i−1,j),(i,j)
si,j−1 + w (i,j−1),(i,j)
9: return sn,m Cursus Grafentheorie en Combinatorische Optimalisatie (2008–2009) – p.14/71