Kahn's algorithm (BFS) sketch for topological ordering of DAGs.
When to use BFS vs DFS and a tiny BFS snippet for shortest unweighted paths.
