Create a rough dependency graph and perform a topological sort, potentially skipping, down weighting, or skimming nodes that are onerous to consume but of dubio

Create a rough dependency graph and perform a topological sort, potentially skipping, down weighting, or skimming nodes that are onerous to consume but of dubious value (e.g. a link that’s a review about a long textbook that isn’t fundamental to a space).