Classical Water jug problem solved using BFS. Input : Capacity of water jugs and the required configuration. Output : Steps to reach the final configuration. Example : Input 4 3 2 3 Output : (0,0)(4,0)(1,3)(1,0)(0,1)(4,1)(2,3)
anirudhbagri/Water-Jug-Problem
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.