This is an example of using a breadth-first search algorithms to solve the water jars and the traveling salesman problems in Haskell. The PDF explains what's going on in more details.
dmorneau/Haskell-Jars
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.