If I could get it as a orderd list, that would work. Then I could build all projects in the right order, so that the next project has its dependencies when building.
An ordered Tree would be much better. Then I could build all projects on same level in parallel.
A much bigger job for me, is if I need to loop through all projects in the folder, get its Upstream and/or Downstream dependencies. Then when I have them all, calculate the ordered list, or structured tree. I have been trying to wrap my head around how to write such an algorithm.
Dependency Graph seems to have such algorithms, so I was hoping to save some time using it if possible.