Machine Topology Reasoning (Topology / Dependency Graph)

Given a set of machines and their connections/dependencies (a topology such as a tree, DAG, or general graph), solve the topology-related task specified by the interviewer. Possible tasks (depending on the exact prompt): validate the topology (e.g., detect cycles) output a valid topological order reachability/path queries compute impact under a failure-propagation model Note: The source only mentions “machine topology” without precise I/O; this is a reconstructable task family summary.