From: Doug Gregor (dgregor_at_[hidden])
Date: 2006-02-13 13:42:55
On Feb 11, 2006, at 11:46 AM, Janusz Piwowarski wrote:
> I made two changes to biconnected components algorithm.
> First, because algorithm expects an udirected graph, I reduced
> the invocation of visitor's on_back_edge event for one direction only.
> Second, I modified the predecessor map use and now after algorithm
> completion map contains the full depth first search tree.
>
> Patch for code and documentation is attached.
Looks good; I've committed it to CVS. Thanks!
Doug