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)A matrix of missing edges M
number of nodes
number of missing edges
logical indicator of directedness; TRUE=>directed FALSE=>undirected
input adjacency matrix
Michael Salter-Townshend
Y_to_E, E_to_Y, Y_to_nonE