Hi, I basically understand the BFS and how it works, but I'm confused when it come to the queue, result, path .... etc.
For example; I have a tree graph as below:
A--B--C
|
D--E
If the starting node is A and the goal is C. As I understand, the FIFO queue will include first A, then it will be directly removed from Q, then we enqueue B and D and, We check alphabetically B first(so we dequeue B), B has an adjacent...