Concepts2
⚙️AlgorithmIntermediate
Tarjan's SCC Algorithm
Tarjan’s algorithm finds all Strongly Connected Components (SCCs) of a directed graph in a single depth-first search using a stack.
#tarjan scc#strongly connected components#low link+12
⚙️AlgorithmIntermediate
Topological Sort - DP on DAG
Topological sort orders vertices of a directed acyclic graph (DAG) so every edge goes from earlier to later, which is perfect for dynamic programming (DP).
#topological sort#dag dp#longest path dag+12