def __getitem__(self, n):
        all_edge_dict = self.all_edge_dict
        return dict((node, all_edge_dict) for node in 
                    set(self.adj) - set(self.adj[n]) - set([n]))
Return a dict of neighbors of node n in the dense graph.
dataset/ETHPy150Open networkx/networkx/networkx/algorithms/approximation/kcomponents.py/_AntiGraph.__getitem__