Google IDX Product Manager Kirupa Chinnathambi writes a code-backed, step-by-step review of Dijkstra's famous graph algorithm, depth, and breadth first search, touching up on Bellman-Ford and A*.
This reminded me of a uni assignment where we recommended shortest path routes to passengers based on geo data from London Tube stations, using A* to compute them.
"Dijkstra's Shortest Path Algorithm"
#algorithms #datastructures #graphs #dfs #bfs #dijkstra #astar #compsci #javascript #programming