Thank you for this wonderful DGL! I would like to use DGL to implement a function that aggregates information from multi-hop neighbors along a given path. However, from my knowledge, DGL only aggregates information from 1-hop neighbors. After struggling for some time, I only find this link https://github.com/dmlc/dgl/issues/939 that is related to my issue. However, the mentioned function
dgl.khop_graph does not fit my goal, since it just connects k-hop neighbor to the source node. By contrast, my goal is to aggregate information along a path, i.e., from n-hop neighbors to (n-1)-hop neighbors until n=1. I would truly appreciate it if anyone could help. Thank you so much.