Graph traversal of a maze file: initializes a 2d adjacency matrix based on maze file the worst case is quadratic O(n**2) running time, best linear O(N) git clone https://github.com/mzakany23/simple_graph_alg.git this_folder cd this_folder python run_script.py