Distributed Computation of a Spanning Tree Without Local Detection of the Global Termination
We give here a version of the Spanning Tree that will run in a distributed way.
We assume that a unique vertex has initially label A, all other vertices having label N and all edges having label 0.
