| Algorithm A1. Evaluation of Node Current’s Rank and Node Sibling’s Rank | |
| 1: | Begin |
| 2: | input: node_id |
| 3: | input: min_sibling_rank |
| 4: | input: node_current_rank |
| 5: | input: parent_threshold_divisor |
| 6: | input: min_pst |
| 7: | input: threshold |
| 8: |
set min_pst = (min_sibling_rank – parent_threshold_divisor) |
| 9: | if node_current_rank < min_pst then |
| 10: | set threshold[node_id] = 5 |
| 11: | else |
| 12: | set threshold[node_id] = 4 |
| 13: | End if |
| 14: | End |
Official websites use .gov
A
.gov website belongs to an official
government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you've safely
connected to the .gov website. Share sensitive
information only on official, secure websites.