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.
#intuitions
2 posts
The many incarnations of computational graphs, linearization, and dynamic programming
Backpropagation, belief propagation, the Viterbi algorithm, and matrix-chain multiplication all solve the same problem: summing over exponentially many paths in a graph by reusing work.