Greedy Best-First Search (unweighted) – A faster, more heuristic-heavy version of A*; does not guarantee the shortest path. Bidirectional Swarm Algorithm (weighted) – A bidirectional algorithm that's ...
Greedy Best-First Search (GBFS) is a heuristic-based search algorithm that expands the node that appears to be the most promising, based on a given heuristic function.