the effective number of bytes assuming assymetry

Checks that `actual_clustering` has the expected clusters.

Googletest-like equality matcher for `scan::EdgeSimilarity` where the tolerance on the `similarity` field is a parameter.

Checks that `clustering` has the expected clusters and returns true if the check passes. The implementation may be inefficient, so don't expect this

Checks that `DetermineUnclusteredType` identifies hubs and outliers as expected. TODO(tomtseng): It would be cleaner to have a unit test that tests `

Reads any edge of an out-edge list after the first edge. */

Returns (uintE) -> std::optional<std::tuple<vertex, vertex-data>>.

a 32-bit hash function

Returns the next non-empty bucket from the bucket structure. The return value's bkt_id is null_bkt when no further buckets remain.

Computes a bucket_dest for an identifier moving from bucket_id prev to bucket_id next.

flag \in {1,2,3}

flag \in {1,2,3}

updates last_ngh