code: def minimize_peak_memory(graph, scheduler_alg):
    
    if scheduler_alg == 'NAIVE':
      return _minimize_peak_memory_naive(graph)
    elif scheduler_alg == 'LIST':
      return _minimize_peak_memory_list(graph)
    else:
      raise NotImplementedError('{} is not a scheduler algorithm. It should be '
                                'one of NAIVE or LIST.'
                                .format(scheduler_alg))
docs: Computes a schedule to minimize peak memory.
  
    Args:
      graph: an mtf.auto_mtf.graph_interface.GraphInterface.
      scheduler_alg: a string, one of 'NAIVE' or 'LIST'
  
    Returns:
      an iterable of integers representing the schedule.