Content deleted Content added
mNo edit summary |
→Description of the algorithm: formatting - missing ' |
||
Line 64:
=== Description of the algorithm ===
The GHS algorithm assigns a ''level'' to each fragment, which is a non-decreasing integer with initial value 0. Each non-zero level fragment has an ''ID'', which is the ID of the core edge in the fragment, which is selected when the fragment is constructed. During the execution of the algorithm, each node can classify each of its incident edges into three categories:<ref name="GHS" /><ref name="Lynch" />
* '''Branch''' edges are those that have already been determined to be part of the MST.
* '''Rejected''' edges are those that have already been determined not to be part of the MST.
| |||