Cycle detection in directed graphs, topological sort, Kahn’s algorithm. These are the ones that feel simple until you’re implementing them and something quietly goes wrong. Same idea as BFS: try to ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results