parameters: (input_set)
return_statement: return result
docstring: implementation of Tarjan topological sort to sort proxies using consumer
      dependencies as graph edges.
docstring_summary: implementation of Tarjan topological sort to sort proxies using consumer
      dependencies as graph edges.
docstring_tokens: implementation of Tarjan topological sort to sort proxies using consumer dependencies as graph edges .
function: def __toposort(input_set):
      """implementation of Tarjan topological sort to sort proxies using consumer
      dependencies as graph edges."""
      result = []
      marked_set = set()
      while marked_set != input_set:
          unmarked_node = (input_set - marked_set).pop()
          __toposort_visit(result, unmarked_node, input_set, marked_set)
      result.reverse()
      return result
function_tokens: def __toposort ( input_set ) : result = [ ] marked_set = set ( ) while marked_set != input_set : unmarked_node = ( input_set - marked_set ) . pop ( ) __toposort_visit ( result , unmarked_node , input_set , marked_set ) result . reverse ( ) return result