Message360019
I'll add ts.py, which was a work-in-progress that implements a minor variation of most everything I typed about. If nothing else, its _find_cycle is useful as a non-recursive linear-time cycle finder (recursion is deadly here because recursive depth-first search can easily "blow the stack" on larger graphs).
There's also "if 1:"/"else:" blocks that set up parallel cases, using threads or processes, and two ways of managing the parallelism (the one I showed before, and a more elaborate one that puts an upper bound on how large the queues can grow - which is sometimes "a problem" for multiprocessing.queue). |
|
Date |
User |
Action |
Args |
2020-01-15 02:56:47 | tim.peters | set | recipients:
+ tim.peters, rhettinger, terry.reedy, belopolsky, orsenthil, eric.smith, christian.heimes, lukasz.langa, tshepang, gdr@garethrees.org, martin.panter, pablogsal, remi.lapeyre |
2020-01-15 02:56:47 | tim.peters | set | messageid: <1579057007.62.0.473489648329.issue17005@roundup.psfhosted.org> |
2020-01-15 02:56:47 | tim.peters | link | issue17005 messages |
2020-01-15 02:56:47 | tim.peters | create | |
|