Practice 1
Write an adjacency table of outgoing edges for the five Atlas fixture nodes, mark the dependency cycle and the isolated node, and state the expected one-step and two-step answers from Atlas. Say which parts are recorded edges and which are computed paths.
Compare with a sample answer
Atlas: e1 to Parser. Parser: e2 to Index and e4 to North. Index: e3 to Parser and e5 to North. North has no outgoing edges, and Archive has no recorded edges at all. The cycle is e2 and e3 between Parser and Index. One step from Atlas reaches Parser; two steps reach Parser, Index and North, and Archive is absent. Edges e1 to e5 are recorded facts; the two-step reachability is a computed path, and the cycle does not create a recorded fact that Atlas directly depends on Index.
A good answer reads every edge in its recorded direction and separates recorded edges from computed reachability.