A unified view of graph traversal: BFS, Dijkstra, A* are the same algorithm
BFS, Dijkstra, and A* differ by one line: the data structure you pop the next node from. A worked maze example that converts each into the next.
#algorithms
1 post
1 post
BFS, Dijkstra, and A* differ by one line: the data structure you pop the next node from. A worked maze example that converts each into the next.