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] <about:invalid#zClosurez>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. <about:invalid#zClosurez>Thanks and Regards,
<about:invalid#zClosurez> Suraj Modi <about:invalid#zClosurez>
--
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/47901038-74e6-4038-8026-76f08015b218%40googlegroups.com.
