Searching and sorting graphs
Kent Quanrud · 63:43
This lecture develops directed-graph algorithms from DAGs and topological sort through depth-first search, then shows how DFS finish times plus the reverse graph yield all strongly connected components in linear \(O(m...