Hi.. I want to calculate the critical paths of a graph using BGL. So what i did is i calculated the connected components of a graph then remove the edge one by one if the number of connected component increase then the edge is critical edge or a bridge. This works fine in case of undirected graph. But how do i calculate connected component of a directed or Bidirected graph i m able to calculate the strongly connected component but it is not helping me out. Can you suggest me something regarding this. Also i want to calculate the fundamental ckt that exist in a graph now. What i did here is i m calculating K-MST. Now i want to calculate the fundamental ckt how should i do that... Thanks Abhishek Vyas Tata Consultancy Services Mailto: abhishek.v@tcs.com Website: http://www.tcs.com ____________________________________________ Experience certainty. IT Services Business Solutions Outsourcing ____________________________________________ =====-----=====-----===== Notice: The information contained in this e-mail message and/or attachments to it may contain confidential or privileged information. If you are not the intended recipient, any dissemination, use, review, distribution, printing or copying of the information contained in this e-mail message and/or attachments to it are strictly prohibited. If you have received this communication in error, please notify us by reply e-mail or telephone and immediately and permanently delete the message and any attachments. Thank you