Explanation

Here are some examples to better understand Nodes and Seeds: (Normally there are no dots )

Left Image: 4 Nodes and Seed is 1234 Right Image: 5 Nodes and Seed is 1234

Here are some examples to better understand the Generating Process:

Left Image: 4 Nodes and Seed is 1234 Right Image: 5 Nodes and Seed is 1234

Here are Examples to Better Understand the Generating Process:

Left Image: Euclidean Nodes #87 Right Image: Euclidean Nodes #88

Euclidean Nodes #87 Nodes: 101 Seed: a13bebeb57e1ea699bd4d2d9ac7e58399644e884b8a 8783d96f6d146083f2430 Hash: 07f2bdef34ed16e3a1ba0dbb7e47b8fd981ce0ccb3e1bfe564d82c423cba7e47

Euclidean Nodes #88 Nodes: 105 Seed: 07f2bdef34ed16e3a1ba0dbb7e47b8fd981ce0ccb3e1bfe564d82c423cba7e47 Hash: 120bf6896dd33173fd22b7419012c6376fb5e4f539eb50bc54aaf68a8fa619c5

As you can see previous example, some nodes are not connected. Because, there is radius value which is between 0 to 1. The code draws a certain radius to each of the nodes point in the Euclidean Space. If another node point is inside this radius, the shortest distance between these two points is calculated using the Euclidean Distance formula and a straight line is drawn.

Theoretically If radius equals to 1 this means that all nodes are connected each other. If radius equals to 0 this means that all nodes are not connected.

10 Nodes and Radius is 1

10 Nodes and Radius is 0.4

Our radius values are depending on the number of nodes. Here are conditions:

Nodes Number = x

if 25 <= x <= 49;
    Radius = 0.5
else if 50 <= x <=99;
    Radius = 0.3
else if 100 <= x <=199;
    Radius = 0.25
else if 300 <= x <=399;
    Radius = 0.22
else if 400 <= x <=545;
    Radius = 0.18
else if   200 <= x <=299;
    Radius = 0.2