test post

"A*" and "A star" redirect here. For other uses, see A* (disambiguation).

Class	Search algorithm
Data structure	Graph
Worst case performance
Worst case space complexit

Graph and tree search algorithms
α–β A* B* Backtracking Beam Bellman–Ford Best-first Bidirectional Borůvka Branch & bound BFS British Museum D* DFS Depth-limited Dijkstra Edmonds Floyd–Warshall Fringe search Hill climbing IDA* Iterative deepening Johnson Jump point Kruskal Lexicographic BFS Prim SMA* Uniform-cost
Listings
Graph algorithms Search algorithms List of graph algorithms
Related topics
Dynamic programming Graph traversal Tree traversal Search games

omputer algorithm that is widely used in pathfinding and graph traversal, the process of plotting an performance and accuracy, it enjoys widespread use. However, in practical travel-routing systems, it is generally outperformed by algorithms which can pre-process the graph to attain better performance,^[1] although other work has found A* to be superior to other approaches.^[2]

efficiently traversable path between points, called nodes. Noted for its 

Peter Hart, Nils Nilsson and Bertram Raphael of Stanford Research Institute (now SRI International) first described the algorithm in 1968.^[3] It is an extension of Edsger Dijkstra's 1959 algorithm. A* achieves better time performance by using heuristics.

Contents

  [hide] 

• 1 Description
• 2 History
• 3 Process
• 4 Pseudocode
  • 4.1 Example
• 5 Properties
  • 5.1 Special cases
  • 5.2 Implementation details
• 6 Admissibility and optimality
  • 6.1 Bounded relaxation
• 7 Complexity
• 8 Applications
• 9 Variants of A*
• 10 See also
• 11 References
• 12 Further reading
• 13 External links