Retired horse trader.
Note: double-underline links may be advertisements automatically added by this site and are probably not endorsed by me.
Kasun Athukorala wrote:
I am out of ideas. If you can help, it would be really great!!!
Retired horse trader.
Note: double-underline links may be advertisements automatically added by this site and are probably not endorsed by me.
James Sabre wrote:
Kasun Athukorala wrote:
I am out of ideas. If you can help, it would be really great!!!
So you don't class my idea of using a search engine as helpful !
Kasun Athukorala wrote:
James Sabre wrote:
Kasun Athukorala wrote:
I am out of ideas. If you can help, it would be really great!!!
So you don't class my idea of using a search engine as helpful !
i googled it long before i post this question. But i couldn't find a suitable one for my application.
That is why i post this man.
Retired horse trader.
Note: double-underline links may be advertisements automatically added by this site and are probably not endorsed by me.
Stephan van Hulst wrote:You can also try googling for A*-search (or A-star search).
Retired horse trader.
Note: double-underline links may be advertisements automatically added by this site and are probably not endorsed by me.
Stephan van Hulst wrote:Nevermind then
Retired horse trader.
Note: double-underline links may be advertisements automatically added by this site and are probably not endorsed by me.
Daniel Marti wrote:I will not give you the answer, but i will give you the topics to search for:
Recursion
2-dimensional array or (even better) graph
That is all you need.
You should have a stop condition to know when to stop doing recursive calls. If you want an improved performance, you should check all paths for the shortest path (that would mean 2 stop conditions: 1 for reaching the goal/meeting a dead end and another for having checked all paths possible).
Hope that helped.
@James Sabre: I think it would be a lot better to find an answer by yourself (himself in this case) and then give the dijkstra algorithm as a possible solution.