
11 Feb
2006
11 Feb
'06
4:46 p.m.
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