-
Notifications
You must be signed in to change notification settings - Fork 21
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
convertir dijkstra en A* o memoizar #8
Labels
Comments
Tiempo que toma el dijkstra $ time ./main.py a_star 3094985217 3486707177
real 0m2.413s
user 0m0.200s
sys 0m0.047s |
Tiempo que toma A* $ time ./main.py a_star 3094985217 3486707177
real 0m1.144s
user 0m0.227s
sys 0m0.027s |
tiempo de parada con un nodo bloqueante con dijkstra $ time ./main.py a_star 3520874663 4375972670 4375972668
Route not found
real 0m0.244s
user 0m0.180s
sys 0m0.033s |
Tiempo de parada de A* usando como cota del costo el cuadrado de la distancia en el gran circulo entre el nodo inicial y el final $ time ./main.py a_star 3520874663 4375972670 4375972668
Route not found
real 0m0.279s
user 0m0.137s
sys 0m0.017s |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
La única interrogante es una buena cota para el costo de A* para parar el algoritmo si el nodo que se está buscando no se puede alcanzar
The text was updated successfully, but these errors were encountered: