original_docstring: Checks if an evaluation order can be found.
  
          A dependency graph is evaluatable if there are no circular
          dependencies, i.e., the graph is acyclic.
  
          Returns
          -------
          bool
              Indicating if the graph is evaluatable.
          
docstring: Checks if an evaluation order can be found.
  A dependency graph is evaluatable if there are no circular
  dependencies, i.e., the graph is acyclic.
  
  Returns
  
  bool
  Indicating if the graph is evaluatable.
docstring_tokens: Checks if an evaluation order can be found . A dependency graph is evaluatable if there are no circular dependencies i . e . the graph is acyclic . Returns bool Indicating if the graph is evaluatable .
code: def is_valid(self):
          """Checks if an evaluation order can be found.
  
          A dependency graph is evaluatable if there are no circular
          dependencies, i.e., the graph is acyclic.
  
          Returns
          -------
          bool
              Indicating if the graph is evaluatable.
          """
          return not self._find_first_cycle()
code_tokens: def is_valid ( self ) : return not self . _find_first_cycle ( )
short_docstring: Checks if an evaluation order can be found.
short_docstring_tokens: Checks if an evaluation order can be found .
comment: """Checks if an evaluation order can be found.
  
          A dependency graph is evaluatable if there are no circular
          dependencies, i.e., the graph is acyclic.
  
          Returns
          -------
          bool
              Indicating if the graph is evaluatable.
          """