First, instead of adding multiple screenshots, you could simply gather the results in an array.
It seems that your implementation is faster than previous algorithm. Which are the conditions of your code ? is it working for directed ? weighted ? graphs with multi edges ? loops ? etc. Le dimanche 15 mars 2020 07:43:23 UTC+1, Suraj Modi a écrit : > > [image: ImaseItoh_10^6&GenDebruijn_10^6.png] > > [image: DeBruijn&GenDeBruijn.png] > > [image: GenDebruijn.png] > > [image: ImaseItoh.png] > > [image: debruijn.png] > Thank you sir, > I have tested on multiple inputs even on the total of edges of graph of > 10^6 > Here is the output ,sir please guide me what to do next > > > On Sunday, March 15, 2020 at 1:05:07 AM UTC+5:30, David Coudert wrote: >> >> You have tested only for these values ? >> >> >> Le samedi 14 mars 2020 20:10:36 UTC+1, Suraj Modi a écrit : >>> >>> Thank you, sir, for suggestions >>> I have run the example test cases given in the comment section of the >>> graph generators >>> and here is the output sir can you please guide me what to do next >>> >>> [image: DeBruijn&GenDeBruijn.png] >>> >>> [image: ImaseItoh.png] >>> >>> >>> On Friday, March 13, 2020 at 8:03:32 PM UTC+5:30, David Coudert wrote: >>>> >>>> you can test digraphs.DeBruijn(..) digraphs.GeneralizedDeBruijn(..) >>>> digraphs.ImaseItoh(...) >>>> and also symmetric versions of undirected graphs >>>> like DiGraph(graphs.RandomBarabasiAlbert(...)) >>>> >>>> >>>> Le vendredi 13 mars 2020 15:21:53 UTC+1, Suraj Modi a écrit : >>>>> >>>>> Thank you, sir >>>>> can you kindly give me some edge-case test cases so that I could test >>>>> them? >>>>> >>>> -- 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/edcac7c4-8061-44ef-a1d3-37f105764180%40googlegroups.com.
