def get_new_edges(self, level):
if level == <NUM_LIT:0>:<EOL><INDENT>edges0 = [(<NUM_LIT:0>, <NUM_LIT:1>), (<NUM_LIT:0>, <NUM_LIT:2>)]<EOL><DEDENT>elif level >= (self.max_size-<NUM_LIT:1>)//<NUM_LIT:2>:<EOL><INDENT>edges0 = []<EOL><DEDENT>else:<EOL><INDENT>l2 = level*<NUM_LIT:2><EOL>edges0 = [(l2-<NUM_LIT:1>, l2+<NUM_LIT:1>), (l2, l2+<NUM_LIT:2>)]<EOL><DEDENT>return edges0, []<EOL>
Get new edges from the pattern graph for the graph search algorithm

           The level argument denotes the distance of the new edges from the
           starting vertex in the pattern graph.