creates an in-memory copy of the graph.

copy u's neighbors to table with OLD_EDGE insert top tables if needed

copy u's neighbors to table with OLD_EDGE insert top tables if needed

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

update triangle count for a wedge with val1 and val2 edges flag is true if inserts, false if deletes

update triangle count for a wedge with val1 and val2 edges flag is true if inserts, false if deletes

degree must be <= old_degree

degree must be <= old_degree

flag \in {1,2,3}

Pre-condition: k must be present in T. do not support removing and inserting at the same time needs to be more thoroughly tested currently always retu

change to tombstone if found, return true if deleted, false if not found does not support delete and insert at the same time can run update/find at th

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