We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
The C++ API provides an algorithm k_hop_nbrs that identifies all vertices that are distance k from a particular vertex.
k_hop_nbrs
The C API only exposes 2-hop neighbors, which is required for jaccard/sorensen/overlap similarity computations.
We should provide the generalized version (making k a parameter) and deprecate the 2-hop version in the C API.
The content you are editing has changed. Please copy your edits and refresh the page.
The text was updated successfully, but these errors were encountered:
not needed at this point.
Sorry, something went wrong.
ChuckHastings
No branches or pull requests
The C++ API provides an algorithm
k_hop_nbrs
that identifies all vertices that are distance k from a particular vertex.The C API only exposes 2-hop neighbors, which is required for jaccard/sorensen/overlap similarity computations.
We should provide the generalized version (making k a parameter) and deprecate the 2-hop version in the C API.
Tasks
The text was updated successfully, but these errors were encountered: