2021-11-02

def _get_unique_neighs_list(self, nodes, num_sample=10):
    _set = set 
    to_neighs = [self.adj_lists[int(node)] for node in nodes] # 获取目标节点集的所有邻居节点[[v0的邻居],[v1的邻居],[v2的邻居]]
    if not num_sample is None: # 如果num_sample为实数的话
        _sample = random.sample  
        samp_neighs = [_set(_sample(to_neigh, num_sample)) if len(to_neigh) >= num_sample else to_neigh for to_neigh in to_neighs] # [set(随机采样的邻居集合),set(),set()]
        # 遍历所有邻居集合如果邻居节点数>=num_sample，就从邻居节点集中随机采样num_sample个邻居节点，否则直接把邻居节点集放进去
    else:
        samp_neighs = to_neighs 
    samp_neighs = [samp_neigh | set([nodes[i]]) for i, samp_neigh in enumerate(samp_neighs)] # 把源节点也放进去
    _unique_nodes_list = list(set.union(*samp_neighs)) #展平
    i = list(range(len(_unique_nodes_list))) # 重新编号
    unique_nodes = dict(list(zip(_unique_nodes_list, i)))
    return samp_neighs, unique_nodes, _unique_nodes_list