Hi Tony, > 2) if 2 algorithms are running and the minimal cut between their components > is 1 link this is only possible if the graph already had the articulation. If > you have more than one link between component X and Y the prunner framework > says that the link must be _always_ flooded so there will never be a 1 link > minimal cut there.
This is incorrect. Please see the counter-example I posted. All that is necessary is for the algorithms to disagree on what the flooding topology is. Tony _______________________________________________ Lsr mailing list -- [email protected] To unsubscribe send an email to [email protected]
