Distributed Computation of a Spanning Tree With Local Detection of Termination, Each Process is Identified by a Unique Name
We assume that each vertex is identified by a unique name, its identity, which is known to the vertex initially. For simplicity, we assume that the identity of each vertex is a positive integer.
Initially, each vertex i is labelled with (A,i) and each edge is labelled 0.
