Yes! +1 bump - I am also interested in setting the graph nodes size based on the number of backlinks!
bump this!
Iām sharing the plugin I just made since I took inspiration from this post to add multiple functions to determine how nodes sizes can be computed 
Hey I was wondering is there a way to do the Topological propagation in reverse so that itād be the āstarting nodeā that was bigger rather than the last one in a chain? Iām playing around to see if its an option but canāt find anything.
I love this plugin! Thank you so much for making it.
Hi! It is not an option for now, so itās normal if you didnāt find it. But I think I can easily add an option to āinverseā every measure. It would be computed the same but instead of the value going from 0 for low measurements to 1 for high measurements, it would be 0 for high and 1 for low. Would that work in your use case? (basically imagine you can invert the current sizes so that the smallest becomes the biggest, and the other way around)
An efficient solution could be to outsource all additional computations to another worker thread that shares the buffer (node positions) with the main graph worker thread. (If this is technically possible.)
The heavy lifting is done at the very beginning of the graph view visualization when the nodes share almost the same place. But when they have spread, the compute time highly reduces through the quadtree data structure used in the graph worker thread.
It would therefore make sense to store the positions instead of recalculating them each time the graph view opens.