This project provides a solution to the classic Water Jug Problem using .NET Core 6 and C#. The problem is solved using a breadth-first search algorithm to explore all possible states of the jugs.
The solution to the water jug problem is found using a breadth-first search (BFS) algorithm. BFS is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a 'search key') and explores the neighbor nodes at the present depth prior to moving on to nodes at the next depth level.
Here are some test cases you can use to validate the solution:
-
Test Case 1:
x = 10, y = 2, z = 4Expected Outcome: A list of actions that leads to either jug containing 4 liters of water. -
Test Case 2:
x = 100, y = 2, z = 96Expected Outcome: A list of actions that leads to either jug containing 96 liters of water. -
Test Case 3:
x = 2, y = 6, z = 5Expected Outcome: "No Solution", as it's impossible to measure 5 liters of water with jugs of 2 and 6 liters.
To run the tests, follow these steps:
- Open your project in Visual Studio.
- Build your solution.
- Open the Test Explorer window (go to Test > Windows > Test Explorer).
- Click on "Run All" in the Test Explorer window to run all your tests.
The tests will then run, and you'll be able to see the results in the Test Explorer window. If a test fails, you can click on it to see more details about what went wrong.
- Clone the repository to your local machine.
- Navigate to the project directory.
- Run the program using the .NET CLI:
dotnet run. - Upon running the program, a Swagger window will open where you can manually test the endpoint.