Random walker in Heterogeneous Graphs

Questions
#1

Hello !
Is there a random walker in Heterogeneous Graphs without any using any metapath?

I want to random walk from one node in heterogeneous graph and then collect nodes on the path.
The collected nodes will be grouped by node type and the most frequent nodes of each node type will be regraded as neighbors.

How can I realize this function by dgl?
Many thanks!

#2

You can try homogenize it with dgl.to_homogeneous() and perform random walk on that graph. dgl.to_homogeneous() also maintains the original node types and type-specific IDs in the output.

#3

This topic was automatically closed 30 days after the last reply. New replies are no longer allowed.