A* (pronounced "A-star") is a graph traversal and path search algorithm, which is often used in many fields of computer science due to its completeness, optimality, and optimal efficiency. — referenced from Wikipedia
Worst-case Time Complexity:
Worst-case Space Complexity:
As an informed variation of Dijkstra, A* is considered a best first search because it greedily chooses which vertex to explore next, according to the value of , where
is the heuristic and
is the cost so far.
