Solution: Compilation Order
Understand how to apply topological sort to find a valid compilation order for classes with dependencies. This lesson guides you through building a graph and using BFS to manage in-degrees, helping you solve dependency problems effectively.
Statement
There are a total of classes labeled with the English alphabet (, , , and so on). Some classes are dependent on other classes for compilation. For example, if class extends class , then has a dependency on . Therefore, must be compiled before .
Given a list of the dependency pairs, find the order in which the classes should be compiled.
Constraints:
- Class name should be a character.