search

iris-hep / idap-200gbps

MIT License
3 stars 4 forks source link

feat: optimize graph to have less nodes #7

Closed alexander-held closed 6 months ago

alexander-held commented 6 months ago

This closely follows https://github.com/iris-hep/idap-200gbps-atlas/pull/50. Optimizing the way in which we aggregate information from branches leads to significantly less nodes in the graph.

alexander-held commented 6 months ago

before this change, single file:

(this is the already optimized graph) before_opt

after this change, single file:

after_opt