Author gdr@garethrees.org
Recipients belopolsky, christian.heimes, eric.smith, gdr@garethrees.org, lukasz.langa, martin.panter, pablogsal, remi.lapeyre, rhettinger, terry.reedy, tshepang
Date 2020-01-09.12:33:02
SpamBayes Score -1.0
Marked as misclassified Yes
Message-id <1578573182.91.0.076924179128.issue17005@roundup.psfhosted.org>
In-reply-to
Content
I'd like to push back on the idea that graphs with isolated vertices are "unusual cases" as suggested by Raymond.

A very common use case (possibly the most common) for topological sorting is job scheduling. In this use case you have a collection of jobs, some of which have dependencies on other jobs, and you want to output a schedule according to which the jobs can be executed so that each job is executed after all its dependencies.

In this use case, any job that has no dependencies, and is not itself a dependency of any other job, is an isolated vertex in the dependency graph. This means that the proposed interface (that is, the interface taking only pairs of vertices) will not be suitable for this use case. Any any programmer who tries to use it for this use case will be setting themselves up for failure.
History
Date User Action Args
2020-01-09 12:33:03gdr@garethrees.orgsetrecipients: + gdr@garethrees.org, rhettinger, terry.reedy, belopolsky, eric.smith, christian.heimes, lukasz.langa, tshepang, martin.panter, pablogsal, remi.lapeyre
2020-01-09 12:33:02gdr@garethrees.orgsetmessageid: <1578573182.91.0.076924179128.issue17005@roundup.psfhosted.org>
2020-01-09 12:33:02gdr@garethrees.orglinkissue17005 messages
2020-01-09 12:33:02gdr@garethrees.orgcreate