Given a directed acyclic graph (DAG) with $N$ vertices, find the total number of valid topological sorts (linear orderings of vertices such that for every directed edge u -> v, u comes before v).
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.