...network

We assume that in the communication network, each processor has its own local memory, the processors are interconnected as a graph, and routing of messages is performed by the processors. The generalization to the case when processors, memories, and switches are distinct entities is straightforward, but complicates the definitions.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...nodes.

Technically, 225#225 is not an identity for the operation 226#226. Nonetheless, this leaffix computation correctly computes the height of each node in a binary tree. Moreover, this leaffix computation also generalizes to a directed tree with arbitrary vertex degree.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.