class_docstr: Provides functionality to topologically sort a graph of hashable nodes
docstr: Returns an iterable of nodes in a topological order.
  
  The particular order that is returned may depend on the specific
  order in which the items were inserted in the graph.
  
  Using this method does not require to call "prepare" or "done". If any
  cycle is detected, :exc:`CycleError` will be raised.
docstr_tok: ["Returns","an","iterable","of","nodes","in","a","topological","order",".","The","particular","order","that","is","returned","may","depend","on","the","specific","order","in","which","the","items","were","inserted","in","the","graph",".","Using","this","method","does","not","require","to","call","``","prepare","''","or","``","done","''",".","If","any","cycle","is","detected",",",":","exc",":","`","CycleError","`","will","be","raised","."]
code: def static_order(self):
      """Returns an iterable of nodes in a topological order.
  
      The particular order that is returned may depend on the specific
      order in which the items were inserted in the graph.
  
      Using this method does not require to call "prepare" or "done". If any
      cycle is detected, :exc:`CycleError` will be raised.
      """
      self.prepare()
      while self.is_active():
          node_group = self.get_ready()
          yield from node_group
          self.done(*node_group)
  
file_path: catboost/contrib/tools/python3/src/Lib/graphlib.py
imports: from types import GenericAlias
label_desc: Use image node_id 10 for calling the TopologicalSorter obj's underlying member method code with example usage: obj.static_order() without return types