Anyone able to review #11736? It's a truly linear time implementation of Lex BFS. I spent some time on the original paper to fully understand the algorithm (not well described) and find the issues in the original code.
Le lundi 31 août 2020 à 19:05:13 UTC+2, Matthias Koeppe a écrit : > On Saturday, August 15, 2020 at 3:11:18 PM UTC-7, Matthias Koeppe wrote: >> >> On Friday, August 14, 2020 at 6:49:44 AM UTC-7, Sébastien Labbé wrote: >>> >>> I made the size of list go from 130 to 120 this afternoon. Who can do >>> better? >>> >> >> Thanks to everyone who helped bring this down to 100. >> >> > 78 now. > > -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-devel/a6b42192-d432-4cbe-86bd-7e90a94fcff1n%40googlegroups.com.
