Graph storage and operations#
Graph structure storage Actually, it is the graph structure of one relation, represented in CSR format. |
|
Append neighbor_node_tenosr to target_node_tensor, keep target_node_tensor unchanged and do unique e.g. if target_node_tensor is [3, 11, 2, 10], neighbor_node_tensor is [4, 5, 2, 11, 6, 9, 10, 5], output_unique_node may be [3, 11, 2, 10, 6, 4, 9, 5], order of 6, 4, 9, 5 may change. |
|
Add self loop to sampled CSR graph NOTE: this function will not check if there is already self loop in the raw CSR graph. |
|
|
Unweighted neighborhood sample in CSR WholeGraph |
|
Weighted neighborhood sample in CSR WholeGraph |