A cheap version of an inteface that should be improved Allows forking a state into multiple states

cluster, parent

Wrapper for a hash function

Used to compute the size of each subtree (leaffix)

Deterministic version

reset visited vertices

Deterministic version

Deterministic version

Used to compute the (low, hi) values of each subtree (leaffix)

vertex map function to update its p value according to PageRank equation

reset visited vertices

Aggregate metrics for a repeated experiment, repeated num_rounds times. */

hash32 is sufficient?

hash32 is sufficient

Note that the block degree is computable by differencing two starts. */

Finish Algorithm Types */

This is an approximate version of `CosineSimilarity`. Increasing `num_samples` increases the approximation accuracy. Let `m` be the number of undirec

This is an approximate version of `JaccardSimilarity`. Increasing `num_samples` increases the approximation accuracy. This is really only helpful for

The cosine similarity between two adjacent vertices u and v is (size of intersection of the closed neighborhoods of u and v) / (geometric mean of size

symmetric_graph

symmetric_graph

Union-Find options */

Index for an undirected graph from which clustering the graph with SCAN is quick, though index construction may be expensive.

The Jaccard similarity between two adjacent vertices u and v is (size of intersection of the closed neighborhoods of u and v) / (size of union of the

Jayanti-specific options */