Skip to content

Glossary: Algorithms Beyond the Basics in Go

A* (A-star)

Also written: A-star, A*

A shortest-path algorithm that searches toward a single goal, guided by an estimate of how far is left. The estimate lets it skip much of the map that Dijkstra's algorithm would explore.

Where the book teaches it

Related terms

Dijkstra's algorithmFloyd-WarshallShortest path