Hi there,
I was wondering how you could do the following in LEDA:
Given a Graph G you compute its components C1, Cn.
Now you remove a node in e.g. component C1 and you want to compute
again if C1 breaks into components, etc.
Do I have to copy the subgraphs of each component to a new graph and
then compute the components on the 'new'/copied graph or is there
some way to do that in a more efficient way (e.g. all on the original
graph G)?
Thanks,
Horst
