See sub pages.

• We provide tools to generate randomly connected graphs (undirected and directed). These tools are useful in testing distributed algorithms. On the one hand, a lot of connected networks in reality seem to be random while keeping connected, thus we would like to generate graphs like such. On the other hand, we would like the (random) procedure to have a chance to cover any possible topologies since we also want to take into account those extreme topologies.
• If requiring a (strongly) connected (di)graph with a low average degree (connectivity ratio), the complexity/running time of the strict/naive Monte Carlo approach will increase dramatically when the size of the network grows. Thus some structure based strategies are needed to develop a highly efficient algorithm.