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

comparison docs/examples/algorithm-dinic.description @ 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-dinic.description@1c1985532139
children
comparison
equal deleted inserted replaced
150:4acf578ae93f 151:4a8c122725b0
1 // -*- coding: utf-8; indent-tabs-mode: nil -*-
2 \ALGORITHM{Dinic's Algorithm} \WITH
3 \INPUT{A network \expr{G = ((V , E), c, s, t)}.}
4 \OUTPUT{An \expr{sā€“t} flow \expr{f} of maximum value.}
5 \IS
6 \TEXT{1. Set \expr{f(e) = 0} for each \expr{e āˆˆ E}.
7 2. Construct \expr{G_L} from \expr{G_f} of \expr{G}.
8 If \expr{\text{dist}(t) = āˆž}, stop and output \expr{f}.
9 3. Find a blocking flow \expr{f\'} in \expr{G_L}.
10 4. Augment flow \expr{f} by \expr{f\'} and go back to step 2.}
11 \END ALGORITHM