You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
After a little deliberation on slack, we decided to get subset of nodes and all of the edges that exist in the subset. Ultimately, we're not limited by the number of links, so that seems appropriate. The implementation of this approach is most simple and easy to debug.
This strategy won't work for very large graphs (since the chance of any nodes in a sample being connected might be low). In that case we should suggest path traversals in the overlay, and we'd have a more complex query
I'd like to add that right now we are always taking the first n number of nodes in the node table, and that we should consider other, potentially better alternatives.
Opening an issue as the start of a discussion: how do we want to enable network querying?
Is it by the number of nodes or 1-hop paths?
The text was updated successfully, but these errors were encountered: