Determining which chain of dependent tasks fixes the close date and which tasks have slack, so attention goes where delay actually costs something.
Critical Path Method over a directed acyclic graph of task dependencies — longest path to the terminal node, with slack computed per task
networkx (longest path, topological sort)