parameters: (self, graph)
return_statement: return list(output_list)
docstring: search output list
          :param graph:
          :return:
docstring_summary: search output list
          :param graph:
          :return:
docstring_tokens: search output list : param graph : : return :
function: def _search_output_list(self, graph):
          """
          search output list
          :param graph:
          :return:
          """
          output_list=set()
          graph_cp=graph.copy()
  
          def recursive_search(node):
              """
              recursive search
              :param node:
              :return:
              """
              if node.get('out_search_flat') is not None:
                  return set()
              node['out_search_flat']=True
              outputs=node['output']
              result = set()
              if len(outputs) == 0:
                  result.add(node['name'])
              else:
                  for i in outputs:
              	    result |= recursive_search(graph[i])
              return result
  
  
          for i in graph_cp.values():
              output_list |= recursive_search(i)
          return list(output_list)
function_tokens: def _search_output_list ( self , graph ) : output_list = set ( ) graph_cp = graph . copy ( ) def recursive_search ( node ) : """
              recursive search
              :param node:
              :return:
              """ if node . get ( 'out_search_flat' ) is not None : return set ( ) node [ 'out_search_flat' ] = True outputs = node [ 'output' ] result = set ( ) if len ( outputs ) == 0 : result . add ( node [ 'name' ] ) else : for i in outputs : result |= recursive_search ( graph [ i ] ) return result for i in graph_cp . values ( ) : output_list |= recursive_search ( i ) return list ( output_list )