  We study directed random graphs (random graphs whose edges are directed) as
they evolve in discrete time by the addition of nodes and edges. For two
distinct evolution strategies, one that forces the graph to a condition of near
acyclicity at all times and another that allows the appearance of nontrivial
directed cycles, we provide analytic and simulation results related to the
distributions of degrees. Within the latter strategy, in particular, we
investigate the appearance and behavior of the strong components that were our
subject in the first part of this study.
