Skip to content

Draft: Simplify Calo Graph Clustering algo

Andre Gunther requested to merge gunther-graph-clusters into master

If someone at some point wants to improve the computational performance of the calo clustering, this MR gives an example how to do it.

  • drops redundant data from the graph and uses data structures more efficiently
  • no (significant) changes w.r.t to reference expected
  • reduces execution time by ~20%
Edited by Andre Gunther

Merge request reports