calculate the missing edges as an edgelist from an adjacency matrix with NaNs indicating missing links
calculate the missing edges as an edgelist from an adjacency matrix with NaNs indicating missing links
uses C code to quickly find all pairs of nodes for which we do not know whether there is a link or not, given an adjacency matrix with NaNs indicating unknown / unobserved linkage
Y_to_M(N, NM, directed, Y)
Arguments
N: number of nodes
NM: number of missing edges
directed: logical indicator of directedness; TRUE=>directed FALSE=>undirected