current n_hop implementation is not useful as the graph quickly becomes overpopulated edges. modify n_hop sampler to limit the branching factor (max degree) for each node.
The idea is to eagerly rune extra edges when new node is added.
It's an optimal heuristic, that will have a configuration parameter to limit the maximal subgraph degree (for more expansion), or just check the maximal degree of every node (faster, but would result lower expansion and higher branching factor).
current n_hop implementation is not useful as the graph quickly becomes overpopulated edges. modify n_hop sampler to limit the branching factor (max degree) for each node. The idea is to eagerly rune extra edges when new node is added. It's an optimal heuristic, that will have a configuration parameter to limit the maximal subgraph degree (for more expansion), or just check the maximal degree of every node (faster, but would result lower expansion and higher branching factor).