Distributed minimum spanning tree: Difference between revisions

Content deleted Content added
FWDekker (talk | contribs)
Copy-edit, improve formatting, and improve some clarity
m Combining two fragments: typo, typo(s) fixed: aformentioned → aforementioned
Line 85:
<li><math>\mathit{weight}(e') < \mathit{weight}(e)</math></li>
</ol>
The second statement follows if the first one holds. For the first statement, suppose <math>n'</math> chose the edge <math>e</math> and sent a test message to <math>n</math> via edge <math>e</math>. Then, node <math>n</math> will delay the response (according to case 3 of "Finding the minimum weight incident outgoing edge"). Then, it is impossible that <math>n'</math> has already sent its convergecast message. By the aformentionedaforementioned conclusions 1 and 2, we can conclude it is safe to absorb <math>F</math> into <math>F'</math> since <math>e'</math> is still the minimum outgoing edge to report after <math>F</math> is absorbed.
</li></ol>