Improve graph layout algorithm

[todo]

Graph layout algorithm is a brute force n-body, with algorithmical complexity of O(n^2), with n the number of nodes. There are algorithms that achieve at least O(n*log(n)) complexity, but they require a b-tree creation. We need to investigate at how many nodes the nlog(n) algorithm starts to make sense and whether or not this is actually useful in real life due to data pollution.

---

This issue was generated by todo based on a todo comment in dbd2586.