Open
Description
Currently, when I have duplicate dependencies in my recursive dependency graph they are built multiple times. I suggest building the dependency tree first, and then maybe apply the algorithm in jpm/dag to build each only exactly once.
Example:
- Project A deps: [B, spork, C]
- Project B deps: [spork]
- Project C deps: [B]
which results in the following graph:
graph
a-->b
a-->spork
a-->c
b-->spork
c-->b
Which means the most optimal build process would be to
(0. fill cache by walking the graph and cloning new deps as needed)
- build spork
- build b
- build c
- build a
But currently it looks more like this:
- clone & build spork
- clone & build B
- clone & build spork
- clone & build spork
- clone & build B
- clone & build C
- clone & build A
Metadata
Metadata
Assignees
Labels
No labels