GraphAware Blog - Optimisation Problems

Find out what's new in the world of mission-critical graph analytics.

Solving the bucket-filling problem with Neo4j

02 Sep 2018 by Vince Bickers · 7 min read Neo4j State Machine Optimisation Problems Shortest Path

IntroductionIn the bucket filling problem you are given two empty buckets, each of a certain capacity, and a large supply of water. By filling, emptying and transferring water between the two buckets, you must try to end up with a situation where one of the buckets contains a required volume of water, or where both buckets together contain the required volume.