Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
i am looking for a fast Algorithm just to determine if a given directed graph contains a bridge or not …
not concerned about the location of this bridge .. only whether the graph contains it or not.
i’ve just found a better or simpler solution for that ..
choose any node run a simple dfs and check if every node is visited then reverse all the edges and starting from the same node check if you can visit all the nodes again if not then it surely contains a Bridge.