method

tsort

Ruby latest stable (v2_5_5) - 0 notes - Class: DependencyGraph

1_8_6_287
1_8_7_72
1_8_7_330
1_9_1_378
1_9_2_180
1_9_3_125
1_9_3_392
2_1_10
2_2_9
2_4_6 (0)
2_5_5 (0)
2_6_3 (0)
What's this?

tsort(vertices) public

Topologically sorts the given vertices. @param [Enumerable] vertices the vertices to be sorted, which must

all belong to the same graph.

@return [Array] The sorted vertices.

Show source

# File lib/rubygems/resolver/molinillo/lib/molinillo/dependency_graph.rb, line 34
    def self.tsort(vertices)
      TSort.tsort(
        lambda { |b| vertices.each(&b) },
        lambda { |v, &b| (v.successors & vertices).each(&b) }
      )
    end

tsort

Related methods

Flowdock - Team Inbox With Chat for Software Developers