Erdős–Rényi Graphs

This applet generates the Erdős–Rényi graph G(k,p), that is a random graph with k nodes and where each pair of nodes is connected by an edge with probability p. Connected components are displayed in column ranked from the largest down to the smaller ones.