Concepts3
⚙️AlgorithmAdvanced
DP with Expected Value
Dynamic programming with expected value solves problems where each state transitions randomly and we seek the expected cost, time, or steps to reach a goal.
#expected value dp#linearity of expectation#indicator variables+11
⚙️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