measure the communication volume of the current graph distribution

Compute the number of fill-edges using the algorithm in Rose et al. "Algorithmic Aspects of Vertex Elimination on Graphs", SIAM J. Comput., Vol. 5, No

detect paths of nodes with any weight

only detect paths of nodes with weight 1

Starting a 'start_node', find neighboring nodes of degree 3 that share at least one neighbor with 'init_node'. Node x is ignored if ignore[x] == true

preconditition: no negative cycles

preconditition: no negative cycles

scanning arcs incident to node i */

deal with self-loops */

* parse_long_options -- * Parse long options in argc/argv argument vector. * Returns -1 if short_too is set and the option does not match long_opt

* parse_long_options -- * Parse long options in argc/argv argument vector. * Returns -1 if short_too is set and the option does not match long_opt

public api */

public api */