7883ac7a42
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. WWW: https://github.com/ruby/tsort
3 lines
161 B
Text
3 lines
161 B
Text
TIMESTAMP = 1609598805
|
|
SHA256 (rubygem/tsort-0.1.0.gem) = c9f9b27e4a19d5ac061ae8f170f17cf7b8c0a8d2918d4aba49efbb33d8141793
|
|
SIZE (rubygem/tsort-0.1.0.gem) = 9728
|