1. A cost-map contains M*N cells, we have the cost rate for each individual cell. 2. The path is defined as a sequence of cells that connect to each other directly. 3. If two cells are in the same row or column, and there is no cell between them, these two cells are defined as directly connected. 4. The cost of a path is the summary of all the cells� costs involved. lYou are required to find out a cheapest path from one specified cell to another.
I see no Java here and the problem, I would say, is advanced. Please attempt to solve it yourself and post your Java code. You will get a better response that way. -Barry [ March 10, 2003: Message edited by: Barry Gaunt ]
This isn't even arithmetic; it's graph theory. You should figure out how Dykstra's algorithm works. It will definitely help with this problem. Any decent Data Structures or Algorithms text will have an explanation, or at the very least you can google for more information. HTH Layne