Add maze.txt
Add title, link to testing-go-queues
Set start to ROUTE before looping through predecessors
This is a rewrite in Go of a project from CSCI-243 at RIT, to implement a breadth-first-search algorithm to solve a maze. The project was initially in C.
Related: Testing Go queues