Best-first search

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, best-first search is a class of search algorithms which explores a graph by expanding the most promising node chosen according to a specified rule.

Excerpt from the Wikipedia article “Best-first search”, under the CC BY-SA 4.0 license. Read the article on Wikipedia