| 摘要 |
<p>A set of trees is created, block 11 and a leaf node which is not an internal node for any tree is arbitrarily selected, block 12. The selected node is appended to an ordered list, block 15, in a loop with checking of all nodes, block 16, having an edge with a label x into it but no edge with the label x out of it. It is detected if there are any nodes left, block 17 and updated execution commands are sent, block 18, to the routers if there are no more nodes, otherwise the method returns to block 12.</p> |
