pylibcugraph.get_two_hop_neighbors#
- pylibcugraph.get_two_hop_neighbors(
- ResourceHandle resource_handle,
- _GPUGraph graph,
- start_vertices,
- bool_t do_expensive_check,
Compute vertex pairs that are two hops apart. The resulting pairs are sorted before returning.
- Parameters:
- resource_handleResourceHandle
Handle to the underlying device resources needed for referencing data and running algorithms.
- graphSGGraph or MGGraph
The input graph, for either Single or Multi-GPU operations.
- start_verticesOptional array of starting vertices
If None use all, if specified compute two-hop neighbors for these starting vertices
- Returns:
- return a cupy arrays of ‘first’ and ‘second’ or a ‘cugraph_vertex_pairs_t’
- which can be directly passed to the similarity algorithm?