(:documentation "Generate a 'classic' random graph G(n, m) with n vertexes and m edges."))
;;; ---------------------------------------------------------------------------
(:documentation "Generate a 'classic' random graph G(n, m) with n vertexes and m edges."))
;;; ---------------------------------------------------------------------------
(:documentation "Generate the Erd\"os-R\'enyi random graph G\(n, p\). I.e., a graph with n vertexes where
each possible edge appears with probability p. This implementation is from Efficient Generation
of Large Random Networks \(see batagelj-generation-2005 in doab\)."))
(:documentation "Generate the Erd\"os-R\'enyi random graph G\(n, p\). I.e., a graph with n vertexes where
each possible edge appears with probability p. This implementation is from Efficient Generation
of Large Random Networks \(see batagelj-generation-2005 in doab\)."))