def _init_edges(self):
        if self.acyclic:
            self._init_acyclic_edges()
            return
        for i in range(len(self.nodes)):
            # rnd.randint(, self.max_neighbours+1)
            neighbours = self.max_neighbours
            query_res = self.nodes_tree.query(
                self.nodes[i], k=neighbours+1)

            self.FSs[i] = query_res[1][1:]
            for node_index in self.FSs[i]:
                self.BSs[node_index] = np.append(self.BSs[node_index], [i])

            self.FS_costs[i] = query_res[0][1:]
Initialize random edges filling the FSs struct
dataset/ETHPy150Open dnlcrl/PyGraphArt/src/graph.py/Graph._init_edges