This is a submission for DEV Computer Science Challenge v24.06.12: One Byte Explainer.
Explainer
A* is a path finding algorithm, given a weighted graph, source node, goal node, the algorithm finds shortest path from source to goal according to the given weights. It’s used in Network Routing, Video Game NPCs, Route Planning
Additional Context
Weighted Graph- A Graph whose edges have been assigned numbers(weights)
