Greedy Best-First Search

A search algorithm that explores the most promising node first by expanding the node that has the smallest heuristic value.
Graph Search
Heuristic
Shortest Path (heuristic-guided)
Controls
No data
Select start and end nodes on the graph.