bn:00695452n
Noun Concept
Categories: Search algorithms, Greedy algorithms
EN
best-first search  Best first search  greedy best-first search  pure heuristic search
EN
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. Wikipedia
Definitions
Relations
Sources
EN
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. Wikipedia
A path finding algorithm Wikipedia Disambiguation
Algorithm Wikidata