def get_dependent_dists(dists, dist):
 if (dist not in dists):
  raise DistlibException((u'given distribution %r is not a member of the list' % dist.name))
 graph = make_graph(dists)
 dep = [dist]
 todo = graph.reverse_list[dist]
 while todo:
  d = todo.pop()
  dep.append(d)
  for succ in graph.reverse_list[d]:
   if (succ not in dep):
    todo.append(succ)
 dep.pop(0)
 return dep

def get_dependent_dists ( dists , dist ) : if ( dist not in dists ) : raise DistlibException ( ( u'given distribution %r is not a member of the list' % dist . name ) ) graph = make_graph ( dists ) dep = [ dist ] todo = graph . reverse_list [ dist ] while todo : d = todo . pop ( ) dep . append ( d ) for succ in graph . reverse_list [ d ] : if ( succ not in dep ) : todo . append ( succ ) dep . pop ( 0 ) return dep
recursively generate a list of distributions from *dists* that are dependent on *dist* .