Concepts3
⚙️AlgorithmIntermediate
2-SAT
2-SAT solves Boolean formulas where every clause has exactly two literals, and it is solvable in linear time relative to the size of the implication graph.
#2-sat#implication graph#strongly connected components+12
⚙️AlgorithmIntermediate
Strongly Connected Components
Strongly Connected Components (SCCs) partition a directed graph into maximal groups where every vertex can reach every other vertex in the group.
#strongly connected components#tarjan#kosaraju+12
⚙️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