cugraph.structure.graph_implementation.simpleGraphImpl.get_two_hop_neighbors

simpleGraphImpl.get_two_hop_neighbors(start_vertices=None)

Compute vertex pairs that are two hops apart. The resulting pairs are sorted before returning.

Parameters:

start_verticesInt or List (default=None)

Subset of vertices to compute two hop neighbors on. If None, compute

for all nodes.

Returns:

dfcudf.DataFrame

df[first]cudf.Series

the first vertex id of a pair, if an external vertex id is defined by only one column

df[second]cudf.Series

the second vertex id of a pair, if an external vertex id is defined by only one column