Class: Bundler::Molinillo::DependencyGraph

Classes and Modules

Class Bundler::Molinillo::DependencyGraph::Vertex

Constants

Edge = Struct.new(:origin, :destination, :requirement) A directed edge of a {DependencyGraph} @attr [Vertex] origin The origin of the directed edge @attr [Vertex] destination The destination of the directed edge @attr [Object] requirement The requirement the directed edge represents

Attributes

vertices

[R]

@return [{String => Vertex}] the vertices of the dependency graph, keyed

  by {Vertex#name}

Public Class methods

new()

tsort(vertices)

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

  all belong to the same graph.

@return [Array<Vertex>] The sorted vertices.

Public Instance methods

==(other)

@return [Boolean] whether the two dependency graphs are equal, determined

  by a recursive traversal of each {#root_vertices} and its
  {Vertex#successors}

add_child_vertex(name, payload, parent_names, requirement)

@param [String] name @param [Object] payload @param [Array<String>] parent_names @param [Object] requirement the requirement that is requiring the child @return [void]

add_edge(origin, destination, requirement)

Adds a new {Edge} to the dependency graph @param [Vertex] origin @param [Vertex] destination @param [Object] requirement the requirement that this edge represents @return [Edge] the added edge

add_vertex(name, payload, root = false)

@param [String] name @param [Object] payload @return [Vertex] the vertex that was added to `self`

detach_vertex_named(name)

Detaches the {vertex_named} `name` {Vertex} from the graph, recursively removing any non-root vertices that were orphaned in the process @param [String] name @return [void]

each() {|v| ...}

Enumerates through the vertices of the graph. @return [Array<Vertex>] The graph‘s vertices.

initialize_copy(other)

Initializes a copy of a {DependencyGraph}, ensuring that all {vertices} are properly copied.

inspect()

@return [String] a string suitable for debugging

root_vertex_named(name)

@param [String] name @return [Vertex,nil] the root vertex with the given name

tsort_each_child(vertex, &block)

tsort_each_node()

Alias for each

vertex_named(name)