Given a Graph of children which each have a link to their parent, how can I perform an aggregation of these sub edges on the child level to a single edge at the top level which is simply the sum of the sub edges?
Given a Graph of children which each have a link to their parent, how can I perform an aggregation of these sub edges on the child level to a single edge at the top level which is simply the sum of the sub edges?