Hi
Thank you for the wonderful DGL. Now I would like to implement a function that achieves node-aware aggregation. Specifically, at a specific layer, for different center nodes i, I would like to aggregate its neighbors of n_i hop along a given path (like the shortest path) in one shot, where n_i is different for different center nodes in a graph. I wonder if it is possible to implement this function with DGL. I will greatly appreciate it if anyone could help. Thank you!
Best,
Yongcheng