5,323
edits
Parallel Algorithms: Difference between revisions
→A second connectivity algorithm
| Line 521: | Line 521: | ||
===A second connectivity algorithm=== | ===A second connectivity algorithm=== | ||
The second connectivity algorithms consists of <math>O(\log n)</math> iterations.<br> | |||
Each iteration takes constant time. | |||
* Probe quitting: | |||
* Hooking on smaller: | |||
* Hooking non-hooked-upon: | |||
* Parallel pointer jumping: | |||
===Minimum Spanning Forest=== | ===Minimum Spanning Forest=== | ||