Boost logo

Boost :

From: Janusz Piwowarski (jpiw_at_[hidden])
Date: 2006-02-11 11:46:21


Hi all,

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.

-- 
Regards, 
Janusz



Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk