Programming, Computer Science, Graph Theory, Graph, Mathematics.
searched the states 2, 3, and 4 will then be searched. The Breadth First Search Algorithm has a queue which is vital to how it works. Breadth first will first check whether the current node it is searching is the goal state or not. If it is not the goal state, it places all child nodes of the