Find all subgraphs in pairs for every subset of edges (c++ version)

Given a dataframe of edges with strength between nodes this function returns info on every subgraph state achieved by adding nodes in one-at-a-time in descending order of strength.

calculate_subgraph_structure_rcpp(
  associations,
  a_col = "a",
  b_col = "b",
  w_col = "w",
  return_subgraph_membership = FALSE
)

Arguments

associations	Dataframe of association between two ids with a strength
a_col, b_col	Names of columns that store the id's for the association pair
w_col	Name of the column storing the strength of association
return_subgraph_membership	Should an integer matrix of the subgraph membership for all nodes at all step be returned? This can be useful for comparing consistency of structure across different networks etc. but comes at the cost of speed and memory usage. This will also cause the algorithm to terminate after all nodes are merged into a giant component. This is to avoid execcessive memory usage.