Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

best-first search · Vinony

🌐English

English Deutsch Français Italiano Nederlands Português Tiếng Việt Русский العربية فارسی ไทย 한국어 中文日本語

EntityQ830527· pop 16· linked from 52 articles

best-first search

algorithm

Connections

Bellman–Ford algorithm

International Standard Book Number

Categories

Greedy algorithms Search algorithms

Sources

wikipedia.externallinksexternallink

Library of Congress Control Number

Entity

Dijkstra's algorithm

depth-first search

breadth-first search

greedy algorithm

search algorithm

Prim's algorithm

minimum spanning tree

A* search algorithm

Kruskal's algorithm

graph data structure

Floyd–Warshall algorithm

shortest path problem

Stuart J. Russell

Sign in to save

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Entitydist 0.45

memetic algorithm

Entitydist 0.46

Entitydist 0.54

Optimal substructure

Entitydist 0.58

personalized search

Entitydist 0.59

combinatorial optimization

Entitydist 0.60

optimization problem

Entitydist 0.61

vertical search

Entitydist 0.61

Entitydist 0.62

discrete optimization

Entitydist 0.63

Entitydist 0.64

Entitydist 0.64

What links here52 pages

alpha–beta pruning

Dijkstra's algorithm

Johnson's algorithm

outline of artificial intelligence

bidirectional search

breadth-first search

iterative deepening depth-first search

Simplified Memory-Bounded A*

graph traversal

depth-first search

Bellman–Ford algorithm

jump point search

greedy algorithm

search algorithm

Monte Carlo tree search

Edmonds' algorithm

feature selection

Borůvka's algorithm