A command line application that acts as an algorithm visualizer for Breadth-First-Search

! The traversed nodes will point towards their parent nodes using arrows !

• neighb [row] [col] : will display all of the immediate neighbours of a given node
• bfs [row] [col] : will run a BFS traversal starting from the node with the given coordinates
• bfs_step [row] [col] : will run a step-by-step BFS traversal starting from the node with the given coordinates
• bfs_tree [row] [col] : will pretty-print the resulting tree after executing the BFS traversal starting from the given node
• path [row1] [col1] [row2] [col2] : will find and display the shortest path from one node to another using BFS; if the node cannot be reached (i.e. it is blocked by a wall), then the nodes will be coloured in red
• perf : will analyze the complexity of the BFS algorithm, providing you with a detailed analysis as an output .html file
• clear : will reset the grid to its initial blank state
• exit : will terminate the program