`make-random-gnp-digraph`procedureNaive implementation of a random uniform graph: given number of nodes

`N`, probability`P`, random number generator function`R`, and initial state`S`, samples node indices from a binomial distribution`N,P`, and creates edges determined by the sample values. Argument`loops`specifies if a node can connect to itself in the graph.