Flow Free solver using dijkstra's algorithm and dynamic programming (dead-end elimination). Instructions and Sample On Unix Terminal make ./flow (OPTION) (puzzles/puzzle_xxx_xx.txt) Useful Notes Use -A to see solver animation. Use -d to use dead end checking algorithm to eliminate incorrect solutions (decreases solve time).