clement
Regular
Hello guys
Following the work of Stefan (http://www.speedsolving.com/forum/showthread.php?20492-Blonk-numbers-and-Center-of-the-Cubieverse), I wanted to derive some visuals of this.
My graph is defined as:
- the vertices are all the competitors who did at least 20 competitions (data from ~one month ago, sorry)
- an edge between two competitors is weighted with the number of competitions they made together
To represent the graph, I choose Himmeli (http://www.finndiane.fi/software/himmeli).
The graph is built as the atoms of a molecule who tried to minimize its energy: the stronger is the link between two atoms, the more likely they will be close.
The result is here: http://s89pq2.1fichier.com/Speedcubers_all.pdf
I also displayed only the minimum spanning tree of this graph (http://en.wikipedia.org/wiki/Minimum_spanning_tree)(well, with maximizing the sum of the weights).
Result here: http://8kceui.1fichier.com/Speedcubers_mst.pdf
For the vertices:
circle = Europe
square = North America
triangle = Asia
Enjoy !
Following the work of Stefan (http://www.speedsolving.com/forum/showthread.php?20492-Blonk-numbers-and-Center-of-the-Cubieverse), I wanted to derive some visuals of this.
My graph is defined as:
- the vertices are all the competitors who did at least 20 competitions (data from ~one month ago, sorry)
- an edge between two competitors is weighted with the number of competitions they made together
To represent the graph, I choose Himmeli (http://www.finndiane.fi/software/himmeli).
The graph is built as the atoms of a molecule who tried to minimize its energy: the stronger is the link between two atoms, the more likely they will be close.
The result is here: http://s89pq2.1fichier.com/Speedcubers_all.pdf
I also displayed only the minimum spanning tree of this graph (http://en.wikipedia.org/wiki/Minimum_spanning_tree)(well, with maximizing the sum of the weights).
Result here: http://8kceui.1fichier.com/Speedcubers_mst.pdf
For the vertices:
circle = Europe
square = North America
triangle = Asia
Enjoy !
Last edited: