This is a simulation of a random, scale-free network. It is based on the Barabási–Albert model, an algorithm for generating these kinds of networks. It uses a preferential attachment mechanism, meaning that the probability for a new node to connect to a particular existing node is determined by the degree (i.e. the amount of connections) of the existing node. A new node enters every 2 seconds. The amount of connections a new node forms and whether preferential attachment is used (otherwise nodes will attach at random) can be changed below and will go into effect once the simulation is restarted.