Best First Search as name suggests this algorithm
traverse a graph in best path, the path which has less cost towards its goal
vertex. It is Heuristic Search or Informed Search type where priority queue are
used to store cost of vertex or node. It combined the features of both BFS
& DFS algorithm. Like from BFS – it do not trapped in dead end or stuck in loop
and from DFS – it does not expand all vertex.
The flow
of expansion is toward most promising vertex which has less cost.
Open List:
Just Expanded Vertex
Closed
List: Evaluated/Selected Vertex
0 Comments