Revision as of 09:24, 5 April 2020 edit A3nm (talk \| contribs) Extended confirmed users, Pending changes reviewers 4,578 edits →See also: explain the links Tag: 2017 wikitext editor ← Previous edit		Revision as of 16:21, 7 June 2020 edit undo 72.239.98.27 (talk) Corrected a typo: "denoted" vs. "denotend". Next edit →
Line 117: When we were not able to find any shortest augmenting path from a vertex u, then the DFS marks vertex u by setting Dist[u] to infinity, so that these vertices are not visited again. One last observation is that we actually don't need uDummy: its role is simply to put all unmatched vertices of U in the queue when we start the BFS. As for vDummy, it is ~~denotend~~denoted as NIL in the pseudocode above. == See also ==

Hopcroft–Karp algorithm: Difference between revisions