Each step of the algorithm (also referred to as a hop) updates all node representations in parallel.
a node is updated as a function of messages from its direct neighbours, and a message is possibly specific to a certain relation.