Fast get k-hop subgraphs for all nodes #7106
Answered
by
rusty1s
xiachenrui
asked this question in
Q&A
-
Hi all, I want to get k-hop subgraphs for all nodes of a graph (5,000 nodes). What is the fastest method do you think ? Thanks ! |
Beta Was this translation helpful? Give feedback.
Answered by
rusty1s
Apr 3, 2023
Replies: 1 comment 1 reply
-
Yeah, I would be using |
Beta Was this translation helpful? Give feedback.
1 reply
Answer selected by
xiachenrui
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Yeah, I would be using
NeighborLoader
for this. You can accelerate by increasing thenum_workers
argument.ray
sounds like overkill for this task.