BeFS
Best-first search is a graph search which orders all partial solutions
Best-first search
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.
https://en.wikipedia.org/wiki/Best-first_search

Seonglae Cho