D and lowD updated to after updates and rebalanced pack table to arrays if new degree is low enough, **delete table all deleted edges are removed chan

D and lowD updated to after updates and rebalanced pack table to arrays if new degree is low enough, **delete table all deleted edges are removed chan

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

Move constructor

For each edge e, request e.v.p from e.v and e.w.p from e.w; let the received values be x and y, respectively; if y < x then send y to v and to x else

For each edge e, request e.v.p from e.v and e.w.p from e.w; let the received values be x and y, respectively; if y < x then send y to v and to x else

Returns the value if an equal value is found in the table otherwise returns the "empty" element. due to prioritization, can quit early if v is greater

All scheduler threads quit after this is called.