Reason About Dependency Loading with Topological Sort

# Reason About Dependency Loading with Topological Sort Explain how to build a graph from dependency relationships and compute a valid load order with topological sorting. Because the source does not define a unique order or the exact pair orientation, state the interface questions that must be settled before returning an executable result. ### Constraints & Assumptions - A component must load only after all of its prerequisites. - Independent components may admit several valid load orders. - A dependency cycle prevents a complete valid ordering. ### Clarifying Questions to Ask - Does a pair `[a, b]` mean that `a` depends on `b`, or the reverse? - Must all named components, including isolated ones, appear in the result? - May any valid order be returned, and how should a cycle be reported? ```hint Define edge direction first Choose an edge convention that makes indegree count unresolved prerequisites, then keep it consistent through validation. ``` ### What a Strong Answer Covers - Graph and indegree construction under an explicit pair convention. - Kahn's algorithm or depth-first topological sorting and cycle detection. - Recognition that several zero-indegree choices yield several correct orders. - Complexity, duplicate edges, isolated nodes, and result validation. ### Follow-up Questions 1. How would you determine whether the load order is unique? 2. How would you update the order after one dependency edge is added?