Mercurial > hgrepos > Python > libs > pygments-lexer-pseudocode2

comparison docs/algorithm-ford-fulkerson.pseudocode @ 108:6cebd3e7bc97

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Also allow \REM within a \TEXT{}
author Franz Glasner <fzglas.hg@dom66.de>
date Mon, 04 May 2026 17:36:13 +0200
parents 1c1985532139
children 9bfd87544902
comparison
equal deleted inserted replaced
107:1c1985532139 108:6cebd3e7bc97
10 10
11 1. Find \expr{c_f(p) = min{c_f(u, v): (u, v) ∈ p\}} 11 1. Find \expr{c_f(p) = min{c_f(u, v): (u, v) ∈ p\}}
12 12
13 2. For each edge \expr{(u, v) ∈ p} 13 2. For each edge \expr{(u, v) ∈ p}
14 14
15 1. \expr{f(u, v) <- f(u, v) + c_f(p)} \expr{\rem Send flow along the path 15 1. \expr{f(u, v) <- f(u, v) + c_f(p)} \rem Send flow along the path
16 16
17 } 2. \expr{f(v, u) <- f(v, u) - c_f(p)} \expr{\rem The flow might be "returned" later 17 2. \expr{f(v, u) <- f(v, u) - c_f(p)} \rem The flow might be "returned" later
18 }} 18 }
19 \END ALGORITHM {Ford–Fulkerson} 19 \END ALGORITHM {Ford–Fulkerson}