Jump to content

Talk:Widest path problem

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by MarkusSchulze (talk | contribs) at 16:27, 27 April 2011 ("widest path" or "maximum capacity path"). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

"widest path" or "maximum capacity path"

As far as I know, the "width" of an arc is usually called its "capacity". I recommend that this article should be moved to "maximum capacity path problem". Markus Schulze 16:27, 27 April 2011 (UTC)[reply]