Given `clustering` that's populated for all core vertices, populate `clustering` for all non-core vertices. Arguments: neighbor_order Neighbor order

Same as AttachNoncoresToClusters, but with a consistent, deterministic result. Does not attempt to be particularly efficient.

Creates a `VertexSet` for holding up to `capacity` elements.

pack deletions in array removes edges from tables to delete empty tables, call updateDegreesDeleteFromTable() after minor rebalancing not packing tabl

must be called before cleanUpEdgeTablesDeletion because markEdgeArrayInsertion starts from D[u]

requrie: tables and edges updated might swap u,v, so must make a new copy when pass in count the delta triangle caused by counting wedges of (u,v) for