For each edge e, send min{e.v, e.w} to max{e.v, e.w}.

Shifts[i] is the start of the vertices to take on round i

Returns a small graph. Graph diagram with cosine similarity scores labeled: .71 .67 .63 0 --- 1 ---- 2 -- 5 | / | .75 | .89 | .77 | / | 3 -

Combines two hash values.

V must support ++

mark array or tables of i with DEL_EDGE for neghs in edgesD

Starting from the current position, skips all consecutive lines in the stream that start with '#' or are empty. The intent here is that lines startin