Scenario: given list of 5 files with the following relationships, check if all files form a single dependency graph (here

D->E

is one "island" and

A->B->C

is another one and there's no link between them)

A -> B -> C
D -> E

@witty-crayon-22786 I know you like graphs 🙂

if you want to prototype something externally, can use

./pants peek ::

to dump all of the dependencies. just know that the algorithm will need to be cycle tolerant

depending on the use case, you could also start by looking at the implementation of

./pants paths

, which collects the dependency graph, and then walks it: https://github.com/pantsbuild/pants/blob/main/src/python/pants/backend/project_info/paths.py