D and lowD updated to after updates and rebalanced pack table to arrays if new degree is low enough all deleted edges are removed status is not change

called after degrees are updated&rebalanced and downSizeTables D is now new degrees remove tables that 1) packed to array 2) has zero entry

returns all the current entries compacted into a sequence

Returns a list of all binaries under `benchmarks/`.

returns the next block for this group, reallocates if nec.

can't be used during update, D must align with current entries

The max-degree version */

prioritized linear probing a new key will bump an existing key up if it has a higher priority an equal key will replace an old key if replaceQ(new,old

is_high(D[v]);}

called before tables and status are rebalanced, but already updated, u is now H (before update) edges are updated and packed based on VtxUpdate delete

for each w that changes from L to H, remove HLH where w is involved require w is now L and is changing to H called before tables are rebalanced and st

u is now H (after update), called after tables AND DEGREES are rebalanced degree is updated to after rebalanced

for each w that changes from H to L, increment HLH where w is involved require w is now H and is changing to L called after tables are rebalanced and