> Something that might be missing from the whole directed graph > library is a notion of active/inactive nodes and edges, which would > let us operate on sub-graphs without explicitly building a new > graph. That could be simulated with properties, which are available on nodes and edges. I definitely remember looking at loopForest and thinking it would be slow.