create a handy matrix of vectors to store the hopslist
建立一个方便的矩阵矢量存储hopslist
译者:生物统计家园网 机器人LoveR
描述----------Description----------
Designed for nternal use only; store the geodesic distances in a handy format Each node gets a vector in the hopslist matrix. Each row describes a node and for each row: The first diam entries state the number of nodes that are that distance away by shortest path where diam is the maximum shortest path between two nodes (the graph diameter). eg if entry 3 in row 4 is a 5 then there are exactly 5 nodes that are 4 hops away from node 3. This vector is followed by the indices of all the nodes, grouped by the length of the shortest paths.
设计只为nternal使用存储在一个方便的格式,每个节点都得到了矢量在hopslist矩阵测量距离。每一行描述一个节点,并为每一行的第一个直径条目的状态的节点的数目,该距离由最短路径的直径是最大的两个节点(图形直径)之间的最短路径。例如,如果3项第4行是一个有刚好有5个节点,从节点3是4个跃。这个向量是随后的所有节点的最短路径的长度,分组由由指数。
用法----------Usage----------
参数----------Arguments----------
参数:hops
matrix of geodesic distances
测量距离矩阵
参数:diam
diameter of the network
网络的直径
参数:N
total number of nodes in the network
网络中的节点的总数