Given a directed acyclic graph representing file dependencies, determine a valid linear ordering of vertices such that for every directed edge from vertex u to 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.