Topological-Sort

Ordering, cycle detection, dependency unlocking, and graph propagation

LeetCode 2328 note: strictly increasing means no cycles; dp[cell] = 1 + Σ dp[larger neighbors], processed from largest to smallest value (or by memoized DFS), summed over all cells

LeetCode 2392 note: row and column conditions are independent, so run one topological sort for each; put x at its row and column positions, and return an empty matrix if either has a cycle

LeetCode 2603 note: trim coin-free leaves, trim exactly two more layers, and walk each remaining edge twice

LeetCode 1059 note: trim outdegrees backward from the destination; a node is safe only when every outgoing edge leads to a safe node, and the destination itself must have no outgoing edges

LeetCode note for Alien Dictionary, rebuilt from the original learning note

LeetCode note for Loud and Rich, rebuilt from the original learning note

LeetCode note for Find Eventual Safe States, rebuilt from the original learning note

LeetCode note for Sort Items by Groups Respecting Dependencies, rebuilt from the original learning note

LeetCode note for Minimum Height Trees, rebuilt from the original learning note

LeetCode note for Find All Possible Recipes from Given Supplies, rebuilt from the original learning note

LeetCode note for All Ancestors of a Node in a DAG, rebuilt from the original learning note