Author pablogsal
Recipients belopolsky, christian.heimes, eric.smith, martin.panter, pablogsal, rhettinger, terry.reedy, tshepang
Date 2019-01-17.02:12:11
SpamBayes Score -1.0
Marked as misclassified Yes
Message-id <1547691131.14.0.933184333115.issue17005@roundup.psfhosted.org>
In-reply-to
Content
The one in PR 11583 is twice as faster:

>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)
History
Date User Action Args
2019-01-17 02:13:54pablogsalunlinkissue17005 messages
2019-01-17 02:12:13pablogsalsetrecipients: + pablogsal, rhettinger, terry.reedy, belopolsky, eric.smith, christian.heimes, tshepang, martin.panter
2019-01-17 02:12:11pablogsalsetmessageid: <1547691131.14.0.933184333115.issue17005@roundup.psfhosted.org>
2019-01-17 02:12:11pablogsallinkissue17005 messages
2019-01-17 02:12:11pablogsalcreate