22 Jan
2009
22 Jan
'09
4:38 p.m.
Probably because It can't be safely or efficiently implemented in a generic fashion. There's a tendency for the entire library to rely on vertex and edge indices as opaque references, and removing a vertex or edge can cause a kind of cascading renumbering of elements that is roughly O(V) or O(E) * N (the number of subgraphs).
I see. But suppose I have a graph that is attached to some root graph but has no subgraphs of its own, and I want to remove some nodes and edges (without affecting rest of the hierarchy at all), what would be the best way to do that? Regards, Greg