Skip to content
Discussion options

You must be logged in to vote

The size argument just refers to the shape of the underlying adjacency matrix encoded by edge_index. In most cases, this is simply (edge_index[0].max() + 1, edge_index[1].max()). How we propagate information is independent of the size argument and is solely described by edge_index. Since we assume that an undirected graph holds both directions within edge_index, that also means that "both partites" will receive messages.

Replies: 1 comment 1 reply

Comment options

You must be logged in to vote
1 reply
@Sidharth3301
Comment options

Answer selected by Sidharth3301
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Category
Q&A
Labels
None yet
2 participants