Figure 5From: Efficient network generation under general preferential attachment The Increment operation of the heap-based tree structure. The constant-time operation heap_exchange is demonstrated in Figure 4. The two while loops collectively over an item’s O(log|V|) ancestors, so Increment is a O(log|V|) operation.Back to article page