Hello,
I want you to help for a moment. I want to rewrite dijkstra of the following URL to A*.
http://en.giswiki.net/wiki/Dijkstra's_algorithm#PHP
Because no one has done yet though it retrieves with Google, I am embarrassed.
Could you rewrite it in someone's A*?
Moreover, please teach when there is URL that serves as a reference.
iclab.oikawa[at]gmail.com
A*(A-star) algorithm in php?
Moderator: General Moderators
Re: A*(A-star) algorithm in php?
Can you explain more what you are looking for the modified function to do?
-Greg
-Greg
Re: A*(A-star) algorithm in php?
(sorry because I am not good at English ・・・. )
function?
Perhaps (function findShortestPath),(findBestPath),(updateDstanceAndPrevious)
I think that if three changes.It is hoped that this part is improved to A* Algoritm
Other...funtionGetResult is used as it is.
Looking for A * class created in PHP.
A * is a Find shortest path algorithms.
http://en.wikipedia.org/wiki/A*_search_algorithm-wiki
function?
Perhaps (function findShortestPath),(findBestPath),(updateDstanceAndPrevious)
I think that if three changes.It is hoped that this part is improved to A* Algoritm
Other...funtionGetResult is used as it is.
Looking for A * class created in PHP.
A * is a Find shortest path algorithms.
http://en.wikipedia.org/wiki/A*_search_algorithm-wiki
Re: A*(A-star) algorithm in php?
thanks
but,
How can I reference to which class?
AStarSolver.class? Graph.class?
but,
How can I reference to which class?
AStarSolver.class? Graph.class?
Re: A*(A-star) algorithm in php?
no answer.......please help me
Re: A*(A-star) algorithm in php?
Do you have experience with PHP? :/ I only looked at the code quickly, but can't you work out how to use each class?
This isn't for a school project or something is it?
This isn't for a school project or something is it?
Re: A*(A-star) algorithm in php?
No one is going to do your Homework for you here. Look up the A* algorithm in Wikipedia, there should even be an code example and the pseudo code.
Perhaps a small tip, the A* algorithm is nothing else than the Dijkstra with an heuristic.
And here an extremly great description of the algorithm:
http://www.policyalmanac.org/games/aStarTutorial.htm
Perhaps a small tip, the A* algorithm is nothing else than the Dijkstra with an heuristic.
And here an extremly great description of the algorithm:
http://www.policyalmanac.org/games/aStarTutorial.htm