Tag Archives: Breadth First Search

Breadth First Search

Many programming problems can be modeled as search problems. Given an initial state find the set of intermediate states that have to be traversed before reaching a goal state. We could formulate the Water Buckets problem, the BrainVita problem or … Continue reading

Posted in Algorithm, C++, Software Puzzle | Tagged | Leave a comment