Breadth First Search
The breath first search is a graph search algorithm that explores the graph level by level.
Depth First Search
Depth first search, or DFS, walks a graph by committing to a branch as far
Binary Deque BFS
0-1 BFS, also known as binary deque BFS, solves single-source shortest