商人过河问题是数学建模中的一个经典问题，程序利用链表存储渡河状态，使用穷举的算法实现。该算法会找出N个商人/随从渡河的一个可行方案，但并不保证是最佳方案。写完这个程序后让我想到的居然是图的深度优先搜索，二者在查找的思想上是类似的。3gpp的文件-Merchants across the river in the mathematical modeling problem is a classic problem, the program list storage to cross the river using state of the algorithm using exhaustive. The algorithm will identify a merchant N/followers to cross the river is a feasible option, but does not guarantee the best option. After finishing this program I think actually is the graph depth first search, both ideologically and in the search is similar. 3gpp files