I love to visualize huge graphs (this is a hobby: http://anvaka.github.io/pm/ ). One problem however that keeps me awake at night, is data overload in such graphs.
If I render all connections inside a graph, I get hairball of mess:
The mess can be reduced, if I render only those connections whose link is shorter than X pixels:
This works for smaller graphs (less than
200k nodes), but fails on larger graphs (with more than
1,000k nodes) nodes themselves overload the graph and look like white noise:
(you can see last graph here: Github Followers)
I'm somewhat desperate at this point, and asking very generic question: What would you recommend to use to avoid data overload with large graphs?