Geek asks and answers

What is the time complexity of A * and how is it obtained?

I was wondering if anyone could explain the complexity of the A * time. I use heuristics using Euclidean distance for weight estimation. There are no loops in the heuristic function. Therefore, I believe that the time complexity of the heuristic is O (1).

Given this, what would be the complexity of A * and how was it obtained?

+5
source share
1 answer

you can get your answer here: Why is the complexity of A * exponential in memory?

time complexity is like memory complexity

+2
source

More articles:


All Articles