Editing A* search algorithm (section)

===Example===
An example of an A* algorithm in action where nodes are cities connected with roads and h(x) is the     straight-line distance to the target point:

[[File:AstarExampleEn.gif|An example of A* algorithm in action (nodes are cities connected with roads, h(x) is the straight-line distance to the target point) Green: Start, Blue: Target, Orange: Visited]]

'''Key:''' green: start; blue: goal; orange: visited

The A* algorithm has real-world applications. In this example, edges are railroads and h(x) is the [[great-circle distance]] (the shortest possible distance on a sphere) to the target. The algorithm is searching for a path between Washington, D.C., and Los Angeles.

[[File:A* Search Example on North American Freight Train Network.gif|The A* algorithm finding a path of railroads between Washington, D.C. and Los Angeles.]]