Class: Bundler::Molinillo::DependencyGraph::Vertex

explicit_requirements	[R]	@return [Arrary<Object>] the explicit requirements that required this vertex
graph	[RW]	@return [DependencyGraph] the graph this vertex is a node of
name	[RW]	@return [String] the name of the vertex
payload	[RW]	@return [Object] the payload the vertex holds

@param [DependencyGraph] graph see {graph} @param [String] name see {name} @param [Object] payload see {payload}

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

  by a recursive traversal of each {Vertex#successors}

Is there a path from `other` to `self` following edges in the dependency graph? @return true iff there is a path following edges within this {graph}

descendent?(other)

Alias for path_to?

eql?(other)

Alias for #==

@return [Fixnum] a hash for the vertex based upon its {name}

@return [Array<Edge>] the edges of {graph} that have `self` as their

  {Edge#destination}

@return [String] a string suitable for debugging

is_reachable_from?(other)

Alias for ancestor?

@return [Array<Edge>] the edges of {graph} that have `self` as their

  {Edge#origin}

Is there a path from `self` to `other` following edges in the dependency graph? @return true iff there is a path following edges within this {graph}

@return [Set<Vertex>] the vertices of {graph} that have an edge with

  `self` as their {Edge#destination}

@return [Set<Vertex>] the vertices of {graph} where `self` is an

  {#ancestor?}

@return [Array<Object>] all of the requirements that required

  this vertex

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

  solely by {#name} and {#payload} equality

@return [Set<Vertex>] the vertices of {graph} that have an edge with

  `self` as their {Edge#origin}