There are a couple of node ranking solutions availabe that try to introduce some arbitrary logic to define good quality of a node. Some of them are proprietry and closed, which opens the door for manipulation.

Here we’re introducing another ranking mechanism, that is leveraging standard graph analytics tools. Because every sender is aiming to find the cheapest route, it is most obvious to make use of shortest path finding algorithms for weighted directed graphs.