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

comparison docs/examples/algorithm-ford-fulkerson.pseudocode @ 151:4a8c122725b0

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Move all the example files to "examples/"
author Franz Glasner <fzglas.hg@dom66.de>
date Thu, 07 May 2026 16:12:15 +0200
parents docs/algorithm-ford-fulkerson.pseudocode@9bfd87544902
children
comparison
equal deleted inserted replaced
150:4acf578ae93f 151:4a8c122725b0
1 // -*- coding: utf-8; indent-tabs-mode: nil -*-
2 \ALGORITHM{Ford–Fulkerson} \WITH
3 \INPUTS{Given a network \expr{G = (V, E)} with flow capacity \expr{c}, a source node \expr{s}, and a sink node \expr{t}}
4 \OUTPUT{Compute a flow \expr{f} from \expr{s} to \expr{t} of maximum value}
5 \IS
6 \TEXT{1. \expr{f(u, v) \gets 0} for all edges \expr{(u, v)}
7
8 2. While there is a path \expr{p} from \expr{s} to \expr{t} in \expr{G_f},
9 such that \expr{c_f(u, v) > 0} for all edges \expr{(u, v) ∈ p}:
10
11 1. Find \expr{c_f(p) = min{c_f(u, v): (u, v) ∈ p\}}
12
13 2. For each edge \expr{(u, v) ∈ p}
14
15 1. \expr{f(u, v) \gets f(u, v) + c_f(p)} \rem Send flow along the path
16
17 2. \expr{f(v, u) \gets f(v, u) - c_f(p)} \rem The flow might be "returned" later
18 }
19 \END ALGORITHM {Ford–Fulkerson}