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.
-
Notifications
You must be signed in to change notification settings - Fork 0
dmorneau/Haskell-Jars
About
Some search problems in Haskell
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published