can you try for instance with sage: G = DiGraph(*2*)
sage: *while* not G.is_strongly_connected(): ....: G = digraphs.RandomDirectedGNP(*1000*, *0.008*) Le vendredi 13 mars 2020 14:53:30 UTC+1, Suraj Modi a écrit : > > Thanks, everyone, > After going through [d1][d2][d3] papers and implementation, Previous sage > implemented algorithms work still faster than the new algorithm and also > the performance. The new algorithm works for directed sparse graphs but its > performance is comparable to previous algorithms. > > > > [image: example.png]I am trying to optimize the algorithm and in my > implementation, I have displayed some extra information. Looking for > further suggestions and a path to follow to optimize further.Thanks and > Regards, Suraj Modi > -- You received this message because you are subscribed to the Google Groups "sage-gsoc" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-gsoc/7869d38b-9630-4c1d-94cd-dffb71842fcf%40googlegroups.com.
