5,337
edits
Parallel Algorithms: Difference between revisions
→List Ranking Cluster
| Line 361: | Line 361: | ||
* Step 2: List ranking | * Step 2: List ranking | ||
* Step 3: For every edge e: u->v, preorder(v) = n-distance(e) + 1 | * Step 3: For every edge e: u->v, preorder(v) = n-distance(e) + 1 | ||
===Technique: Pointer Jumping=== | |||
List Ranking<br> | |||
Input: A dense array A. For each element, we have a node pointing to the next element in the array. | |||
==Resources== | ==Resources== | ||