Skip+

Ok, so this project is a bit different. It is a visualization of a self-stabilizing Skip+-graph I made with a friend of mine! We programmed the interactions between the nodes and the visualization of their connections. We also implemented the ability to run a distributed hashing table on the graph as a bonus!
A Skip+-graph is extremely resilient against outages because of its smart design. It has a degree of Θ(log n), a diameter of Θ(log n) and an expansion of Θ(1) with high a likelihood, with n being the amount of nodes.
You can interpret the circles as computers in a network and the edges as relationships between them. Edges can be either unidirectional or bidirectional as symbolized by the arrows. Each node is visualized one time in each i-layer while retaining the same horizontal position and its random string.
The code is freely available for all you lovelies here https://github.com/bjoluc/skiphash
I hope you found this at least a bit interesting :D