From: Vladimir Prus (ghost_at_[hidden])
Date: 2002-01-15 11:04:15
Jeremy Siek wrote:
> There's incremental_components, which maintains connected components for a
> *growing* graph. Other than that, there are currently no algorithms for
> dynamic graphs. Anyone interested in writing some for the BGL are highly
> encouraged to contribute!
A related question -- what is happening to isomorphism? IIRC, Douglas Gregor
told about having a better implementation almost ready. Was there any
progress behind the scenes?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk