Revision as of 09:19, 5 April 2020 edit A3nm (talk \| contribs) Extended confirmed users, Pending changes reviewers 4,578 edits m →Pseudocode: rephrase comment in pseudocode Tag: 2017 wikitext editor ← Previous edit		Revision as of 09:24, 5 April 2020 edit undo A3nm (talk \| contribs) Extended confirmed users, Pending changes reviewers 4,578 edits →See also: explain the links Tag: 2017 wikitext editor Next edit →
Line 120: == See also == * [[Maximum cardinality matching]], the problem solved by the algorithm, and its generalization to non-bipartite graphs * [[Bipartite matching]] * [[Assignment problem]], a generalization of this problem on [[weighted graphs]], solved e.g. by the [[Hungarian algorithm]] * [[Hungarian algorithm]] * [[Edmonds–Karp algorithm]] for finding maximum flow, a generalization of the Hopcroft–Karp algorithm▼ * [[Assignment problem]] ▲* [[Edmonds–Karp algorithm]] for finding maximum flow ==Notes==

Hopcroft–Karp algorithm: Difference between revisions