I have a search tree using breadth-first search and the question asks for the largest size of frontier(fringe) and explored list.
I don't quite understand what it is asking for. I'm using a graph search so the explored node would be skipped. I've gone through my slides and even books but I still don't understand what it is asking for. Thanks.
BFS progress is easy to visualize as water flood. See the bottom left image in this answer where the grey dots represent the "flood".
The frontier are the "front" of this "flood", which are actually the nodes that are to be evaluated next.
"The nodes that are currently evaluated" are actually those stored in the queue.
So the largest size of the frontier is equivalent to the largest size of the queue.
If you collect all the explored nodes in a list, the size of this list ("explored list") you'll have a list that keeps growing until the search is stopped.
