G(n,p) random graph

With the G(n,p) random graph app, you can finally create and draw Erdős—Rényi graphs at the click of a button, all from the palm of your hand! Impress your family, amaze your friends and daze your enemies as you switch between colors and layouts, flaunting graphs with hundreds of nodes and thousands of edges.

Features:
● Three different layouts: circular, spring, and random.
● Color selection for edges and vertices.
● Support for any edge-probability between 0 and 1.
● All our graphs are guaranteed connected with high probability (when p > (1+eps)log(n)/n asymptotically).

The model:
In the G(n,p) random graph model, first invented by Paul Erdős and Alfréd Rényi, n vertices are connected to each other via edges, where each pair of vertices is connected independently with probability p. It is one of the simplest random graph models, yet shows many interesting phenomena.
For more information, see:
https://sarcasticresonance.wordpress.com/2017/07/09/random-graphs-the-erdos-renyi-gnp-model/
or your standard textbook on combinatorics and random graphs.

Privacy policy: https://bitbucket.org/renang/randomgrapher/src/main/privacy_policy.md