Return a graph where the successors of any node
uare nodes reachable from
uby the given metapath.
If the beginning node type
sand ending node type
tare the same, it will return a homogeneous graph with node type
s = t. Otherwise, a unidirectional bipartite graph with source node type
sand destination node type
In both cases, two nodes
vwill be connected with an edge
(u, v)if there exists one path matching the metapath from
The result graph keeps the node set of type
tin the original graph even if they might have no neighbor.
The features of the source/destination node type in the original graph would be copied to the new graph.
A homogeneous or bipartite graph.