After researching Go's MVS dependency algorithm, SAT / hypergraphs all seem overly complicated when you have an efficient and deterministic algorithm that requires no lock file