| 利用图的广度优先搜索解决农夫过河问题 |
| |
| 引用本文： | 王兆红.利用图的广度优先搜索解决农夫过河问题[J].信息技术,2005,29(12):102-104. |
| |
| 作者姓名： | 王兆红 |
| |
| 作者单位： | 潍坊学院计算机系,潍坊,261041 |
| |
| 摘 要： | 农夫过河问题是一类传统的数据结构问题,利用基于队列的图的广度优先搜索求解农夫过河问题是一个易于理解、切实可行的方案,具有一定的推广价值。
|
| 关 键 词： | 农夫过河问题 队列 广度优先搜索 |
| 文章编号： | 1009-2552(2005)12-0102-03 |
| 收稿时间： | 2005-06-29 |
| 修稿时间： | 2005年6月29日 |
Solution of farmer's problem to pass through river by breadth-first search of graph |
| |
| WANG Zhao-hong.Solution of farmer''''s problem to pass through river by breadth-first search of graph[J].Information Technology,2005,29(12):102-104. |
| |
| Authors: | WANG Zhao-hong |
| |
| Affiliation: | Dept. of Computer Science, Weifang College, Weifang 261041, China |
| |
| Abstract: | 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. |
| |
| Keywords: | farmer's problem to pass through river queue breadth-first search |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
