Which graph algorithm the question is actually asking for
8 min read The wording of a graph problem tells you whether to reach for BFS, DFS, topological sort, union-find, or Dijkstra. Read article
8 min read The wording of a graph problem tells you whether to reach for BFS, DFS, topological sort, union-find, or Dijkstra. Read article
What's missing, wrong, or worth adding? One line helps.
Sent — thank you. We read every one.