Edmonds' algorithm

Edmonds' 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 graph theory, Edmonds' algorithm or Chu–Liu/Edmonds' algorithm is an algorithm for finding a spanning arborescence of minimum weight (sometimes called an optimum branching).

Excerpt from the Wikipedia article “Edmonds' algorithm”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Edmonds' algorithm to your collection.

Play for free

Related cards