利用图的广度优先搜索解决农夫过河问题

Solution of farmer's problem to pass through river by breadth-first search of graph

农夫过河问题是一类传统的数据结构问题,利用基于队列的图的广度优先搜索求解农夫过河问题是一个易于理解、切实可行的方案,具有一定的推广价值。

How to pass through the river safely with his belongs is at raditional data structure problem, to solve the farmer＇ s problem by the breadth - first searching graph which can be done by the help with queue is a easy to understand and feasible method, and it can be used widely.