calculate the missing edges as an edgelist from an adjacency matrix with NaNs indicating missing links
计算与NaN的邻接矩阵作为EdgeList都表明缺少的环节缺边
译者:生物统计家园网 机器人LoveR
描述----------Description----------
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
使用C代码来快速找到所有节点对的,我们不知道是否有一个链接或不邻接矩阵表示未知/未观察到的联动与NaN的
用法----------Usage----------
参数----------Arguments----------
参数:N
number of nodes
的节点数量
参数:directed
logical indicator of directedness; TRUE=>directed FALSE=>undirected
TRUE =>定向FALSE =>无向逻辑指标directedness;