@atul : if there is no cut vertex, that doesn't mean that graph is strongly connected ...
On Sat, Oct 6, 2012 at 7:37 PM, atul anand <[email protected]> wrote: > find no. of cut vertex in the DAG....that will be the ans. > On 6 Oct 2012 19:33, "KK" <[email protected]> wrote: > >> Given a DAG(Directed Acyclic Graph). How to find out the minimum number >> of edges that needs to be added so that the given graph becomes Strongly >> Connected? >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To view this discussion on the web visit >> https://groups.google.com/d/msg/algogeeks/-/PbR3j9S5OXUJ. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
