Hopcroft–Karp algorithm

Hopcroft–Karp algorithm

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

In computer science, the Hopcroft–Karp algorithm (sometimes more accurately called the Hopcroft–Karp–Karzanov algorithm) is an algorithm that takes a bipartite graph as input and produces a maximum-cardinality matching as output — a set of as many edges as possible with the property that no two edges share an endpoint.

Excerpt from the Wikipedia article “Hopcroft–Karp algorithm”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Hopcroft–Karp algorithm to your collection.

Play for free

Related cards