Random connected graph generation
-
Updated
Nov 8, 2017 - Java
Random connected graph generation
Erdos-Renyi G(n,p) random graphs over a multilayer social network in Java 21, with the degree distribution and giant-component threshold asserted against their analytic values.
Algorithm developed for the research paper “Lights Out on Nearly Complete Graphs”
Add a description, image, and links to the random-graphs topic page so that developers can more easily learn about it.
To associate your repository with the random-graphs topic, visit your repo's landing page and select "manage topics."