I am currently implementing BGP. One of the BGP features, called aggregation, needs to keep track of its subnets. When a new route is added to the BGP RIB, we want to check if an aggregated supernet exists. It would be helpful to have an iterator to traverse all the ancestor nodes of the given prefix. would you mind to take a look this PR which add the feature?
Hi, @tiborschneider .
Thanks for the great implementation.
I am currently implementing BGP. One of the BGP features, called aggregation, needs to keep track of its subnets. When a new route is added to the BGP RIB, we want to check if an aggregated supernet exists. It would be helpful to have an iterator to traverse all the ancestor nodes of the given prefix. would you mind to take a look this PR which add the feature?