i have doubts in miscof answer , your question says that given graph is a DAG ,but in miscof's reply he is considering directed graph which contain say n strongly connected component , so if we consider dat there are n strongly connected component in your graph then that graph is not a DAG(this will violates your question). But if you are considering all nodes in a given strongly connected graph as a single node then given graph will form DAG. so there is lot of difference in the two....so please clarify your question.
On Wed, Oct 10, 2012 at 1:26 AM, KK <kunalkapadi...@gmail.com> wrote: > This is the > link<http://apps.topcoder.com/forums/?module=Thread&threadID=764182&start=0&mc=4#1614862>to > the answer given by misof.. and it worked!! > > > On Sunday, 7 October 2012 00:41:48 UTC+5:30, kailash wrote: > >> @atul: No,it's not the correct answer. Let's take an example of star like >> DAG:- >> >> A >> -->B-->C >> >> | >> >> V >> >> D >> This DAG contains only one cut vertex(B) but we need to add two edges to >> make it strongly connected. >> >> >> >> >> On Sat, Oct 6, 2012 at 7:37 PM, atul anand <atul.8...@gmail.com> wrote: >> >>> find no. of cut vertex in the DAG....that will be the ans. >>> On 6 Oct 2012 19:33, "KK" <kunalka...@gmail.com> 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<https://groups.google.com/d/msg/algogeeks/-/PbR3j9S5OXUJ> >>>> . >>>> To post to this group, send email to algo...@googlegroups.com. >>>> To unsubscribe from this group, send email to algogeeks+...@** >>>> googlegroups.com. >>>> >>>> For more options, visit this group at http://groups.google.com/** >>>> group/algogeeks?hl=en <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 algo...@googlegroups.com. >>> To unsubscribe from this group, send email to algogeeks+...@** >>> googlegroups.com. >>> >>> For more options, visit this group at http://groups.google.com/** >>> group/algogeeks?hl=en <http://groups.google.com/group/algogeeks?hl=en>. >>> >> >> >> >> -- >> >> -- >> >> ‘Kailash Bagaria’ >> B-tech 4th year >> Computer Science & Engineering >> Indian Institute of Technology, Roorkee >> Roorkee, India (247667) >> >> -- > 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/-/O5kS0uhrsr4J. > > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > 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 algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
