2026-03-09 · Rememberbox

2026-03-09 1 saved article	Back	Library

Article	Read
A* search algorithm Contributors to Wikimedia projects / Wikimedia Foundation, Inc. A* (pronounced "A-star") is a graph traversal and pathfinding algorithm that is used in many fields of computer science due to its completeness, optimality, and optimal efficiency.[1] Given a weighted graph, a source node and a goal node, the algorithm finds the shortest path (with respect to the given weights) from source to goal.	--

Article

Read

A* search algorithm
Contributors to Wikimedia projects / Wikimedia Foundation, Inc.
A* (pronounced "A-star") is a graph traversal and pathfinding algorithm that is used in many fields of computer science due to its completeness, optimality, and optimal efficiency.[1] Given a weighted graph, a source node and a goal node, the algorithm finds the shortest path (with respect to the given weights) from source to goal.