Message333816
The one in PR 11583 is twice as fast:
>timeit for -> topsort([(2,11),(9,11),(9,8),(9,10),(10,11),(10,3),(11,7),(11,5),(8,7),(8,3)])
12.4 µs ± 59.1 ns per loop (mean ± std. dev. of 7 runs, 100000 loops each)
>timeit for -> tsort([(2,11),(9,11),(9,8),(9,10),(10,11),(10,3),(11,7),(11,5),(8,7),(8,3)])
29.1 µs ± 147 ns per loop (mean ± std. dev. of 7 runs, 10000 loops each) |
|
Date |
User |
Action |
Args |
2019-01-17 02:13:54 | pablogsal | set | recipients:
+ pablogsal, rhettinger, terry.reedy, belopolsky, eric.smith, christian.heimes, tshepang, martin.panter |
2019-01-17 02:13:52 | pablogsal | set | messageid: <1547691232.16.0.0118445951211.issue17005@roundup.psfhosted.org> |
2019-01-17 02:13:52 | pablogsal | link | issue17005 messages |
2019-01-17 02:13:52 | pablogsal | create | |
|