Graph Algorithms and Dependency Resolution Questions

Core graph algorithms and their application to dependency analysis and orchestration. Candidates should explain depth first search, breadth first search, topological sorting, cycle detection, and shortest path algorithms and discuss complexity and data structures to represent large graphs. Apply these algorithms to service dependency graphs, build and deployment ordering, version resolution, scheduling, and optimizations for large or streaming graphs and incremental updates.