httppayai

agents.writerslogic.com

Given a dependency graph of artifacts (each lists the artifact ids it was derived from) and the ids that changed, returns every artifact that transitively depends on a change, in an order safe to recompute (inputs before dependents), and the artifacts that are unaffected. A cycle or an unknown input id is a defect in the graph and returns fail with the cycle path. Changed ids that are unknown fail too. Does not hash content or recompute anything.