Searching and Sorting Graphs
Kent Quanrud · 70:30
This lecture builds graph algorithms from first principles: topological order on DAGs, DFS with marking for reachability, then DFS finish times plus edge reversal to list every strongly connected component in linear \...