TSort TSort implements topological sorting using Tarjan's algorithm for strongly connected components. TSort is designed to be able to be used with any object which can be interpreted as a directed graph. TSort requires two methods to interpret an object as a graph, tsort_each_node and tsort_each_child. * tsort_each_node is used to iterate for all nodes over a graph. * tsort_each_child is used to iterate for child nodes of a given node. The equality of nodes are defined by eql? and hash since TSort uses Hash internally.
| OS | Architecture | Version |
|---|---|---|
| (none) |
Binary packages can be installed with the high-level tool pkgin (which can be installed with pkg_add) or pkg_add(1) (installed by default). The NetBSD packages collection is also designed to permit easy installation from source.
The pkg_admin audit command locates any installed package which has been mentioned in security advisories as having vulnerabilities.
Please note the vulnerabilities database might not be fully accurate, and not every bug is exploitable with every configuration.
Problem reports, updates or suggestions for this package should be reported with send-pr.