def __call__(self, index, graph):
neighbors = graph.neighbors[index]<EOL>if not len(neighbors) == len(self.numbers):<EOL><INDENT>return False<EOL><DEDENT>neighbor_numbers = sorted([graph.numbers[neighbor] for neighbor in neighbors])<EOL>return neighbor_numbers == self.numbers<EOL>
Return True only if each neighbor can be linked with an atom number

           Arguments:
            | ``index``  --  the index of the vertex/edge on which the criterion is
                             applied
            | ``graph``  --  the graph on which the criterion is tested