Introduction - If you have any usage issues, please Google them yourself
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