Breadth First Search (BFS) traverse a graph in a breadthwise manner and uses a O Queue O Backtracking Recursion O Stack to remember to get the next vertex (V) to start a search, when a dead end occurs in any iteration