Before revision:  For this, the relation between any two nodes is characterized by the length of the shortest path between them , including the special case when there is no such path. The Graformer learns to weigh these node-node relations differently for different attention heads, thus virtually learning differently connected views of the input graph.
After revision:  For this, the relation between any two nodes is characterized by the length of the shortest path between them . Graformer learns to weigh these node-node relations differently for different attention heads, thus virtually learning differently connected views of the input graph.