code: def find_merge_points(function_addr, function_endpoints, graph):
          merge_points = set()
          for node in graph.nodes():
              if graph.in_degree(node) > 1:
                  merge_points.add(node)
          ordered_merge_points = CFGUtils.quasi_topological_sort_nodes(graph, merge_points)
          addrs = [n.addr for n in ordered_merge_points]
          return addrs