Message411179
No, the code works fine. I just wish the docs weren't so muddled.
I wish the docs started by saying:
> The graph is a dict of {'start_node': ['end_nodes',]}
> The topological sorter puts the end_nodes before their start_nodes.
[note: this is what the code currently does]
Then the docs could introduce and use different terminology: "tasks" and their "dependencies".
Everyone understands what those are.
And nowhere does it need to say the word "predecessors".
But honestly, I think I'm going to throw in the towel and give up on this endeavor. |
|
Date |
User |
Action |
Args |
2022-01-21 20:06:54 | dam1784 | set | recipients:
+ dam1784, tim.peters, rhettinger, eric.smith, python-dev, Dennis Sweeney |
2022-01-21 20:06:54 | dam1784 | set | messageid: <1642795614.64.0.431010536611.issue46071@roundup.psfhosted.org> |
2022-01-21 20:06:54 | dam1784 | link | issue46071 messages |
2022-01-21 20:06:54 | dam1784 | create | |
|