class Molinillo::DependencyGraph::Vertex

def recursive_predecessors

Returns:
  • (Array) - the vertices of {#graph} where `self` is a
def recursive_predecessors
  vertices = predecessors
  vertices += vertices.map(&:recursive_predecessors).flatten(1)
  vertices.uniq!
  vertices
end