original_docstring: 
      Performs a forward pass through a list of sorted nodes.
  
      Arguments:
  
          `output_node`: A node in the graph, should be the output node (have no outgoing edges).
          `sorted_nodes`: A topologically sorted list of nodes.
  
      Returns the output Node's value
      
docstring: Performs a forward pass through a list of sorted nodes.
docstring_tokens: Performs a forward pass through a list of sorted nodes .
code: def forward_pass(output_node, sorted_nodes):
      """
      Performs a forward pass through a list of sorted nodes.
  
      Arguments:
  
          `output_node`: A node in the graph, should be the output node (have no outgoing edges).
          `sorted_nodes`: A topologically sorted list of nodes.
  
      Returns the output Node's value
      """
  
      for n in sorted_nodes:
          n.forward()
  
      return output_node.value
code_tokens: def forward_pass ( output_node , sorted_nodes ) : for n in sorted_nodes : n . forward ( ) return output_node . value
short_docstring: Performs a forward pass through a list of sorted nodes.
short_docstring_tokens: Performs a forward pass through a list of sorted nodes .
comment: """
      Performs a forward pass through a list of sorted nodes.
  
      Arguments:
  
          `output_node`: A node in the graph, should be the output node (have no outgoing edges).
          `sorted_nodes`: A topologically sorted list of nodes.
  
      Returns the output Node's value
      """