We are attempting for DAGs only. Your graph is not acyclic. :) On 9 October 2012 21:57, Jaspreet Singh <[email protected]> wrote:
> What if this :- > a-»b > ^--' c > > here max of both is 1 but ans is 2. > On Oct 8, 2012 11:38 PM, "Saurabh Kumar" <[email protected]> wrote: > >> You'd need: max(#vertices-with-0in-degree, #vertices-with-0out-degree) >> edges at least. >> >> On 8 October 2012 20:20, bharat b <[email protected]> wrote: >> >>> @jaspreet: take an ex: >>> B->A >>> B->C >>> B->D >>> Here the no.of zero-indegree is one . But its not the correct ans. >>> >>> >>> On Mon, Oct 8, 2012 at 1:19 AM, Jaspreet Singh < >>> [email protected]> wrote: >>> >>>> count the no. of nodes having 0 in-degree. >>>> >>>> >>>> On Mon, Oct 8, 2012 at 12:44 AM, atul anand <[email protected]>wrote: >>>> >>>>> yeah i read it wrongly ...... i thought ques was asking to find total >>>>> strongly connected component in the graph >>>>> >>>>> On 10/7/12, bharat b <[email protected]> wrote: >>>>> > @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. >>>>> > >>>>> > >>>>> >>>>> -- >>>>> 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. >>>> >>> >>> -- >>> 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. >> > -- > 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.
