Radius is the number of hops from a node to other nodes. It defaults to 1, which means nearest neighbors on relations. Radius 2 would add one more hop from each node.
The larger the radius, the more recursion the algorithm will endure in terms of querying against each node in the graph.
Personally, I think Radius = 2 would be nice.
Another "?" issue will be to make nodes clickable. They are not at this time. But, making them clickable renders radius far less important.
Radius is the number of hops from a node to other nodes. It defaults to 1, which means nearest neighbors on relations. Radius 2 would add one more hop from each node. The larger the radius, the more recursion the algorithm will endure in terms of querying against each node in the graph.
Personally, I think Radius = 2 would be nice. Another "?" issue will be to make nodes clickable. They are not at this time. But, making them clickable renders radius far less important.