-
Sorry for disturbing you guys with this stupid question. My algorithm does not work and I have been debugging for a long time. So I would like to confirm every bit of the implementation is as expected. If I have a graph like below, two nodes A pointing to B
which is directed acyclic graph (DAG), and I have a adjacency matrix for its connection, say
the diagonals have value 1 meaning add self-loop for each node. Next I want to create a |
Beta Was this translation helpful? Give feedback.
Replies: 1 comment 1 reply
-
Check out the description of MessagePassing.message(...) here, based on that to construct a message from A to B, set |
Beta Was this translation helpful? Give feedback.
Check out the description of MessagePassing.message(...) here, based on that to construct a message from A to B, set
edge_index=[[0, 0, 1], [0, 1, 1]]
ifflow='source_to_target'
.