What is Breadth First Search (BFS)?

Breadth First Search is a tree or graph traversing (searching) algorithm. In which each node or vertex is explored horizontally. We can select any vertex as a staring vertex, but follow only horizontal exploration of the vertex.

Rule: when we select any of the vertexes, explore only adjacent vertex first, and then move to the next

 

What is Depth First Search (DFS)?

What is Best First Search?

What is A-Star |A* First Search?

Difference between BFS, DFS, Best First Search, A-Star (A*) Algorithm