



from __future__ import annotations

def 	SCREAMING_SNAKE_CASE_							(	_snake_case	:dict	,   _snake_case	:str				)  ->     set[str]:
   _A  ,    _A      =       set(_snake_case				), [start]

   while stack:
      _A      =       stack.pop()
      explored.add(_snake_case				)
      # Differences from BFS:
      # 1) pop last element instead of first one
      # 2) add adjacent elements to stack without exploring them
      for adj in reversed(graph[v]				):
         if adj not in explored:
            stack.append(_snake_case				)
   return explored


UpperCAmelCase_		 =					{
    """A""": ["""B""", """C""", """D"""],
    """B""": ["""A""", """D""", """E"""],
    """C""": ["""A""", """F"""],
    """D""": ["""B""", """D"""],
    """E""": ["""B""", """F"""],
    """F""": ["""C""", """E""", """G"""],
    """G""": ["""F"""],
}

if __name__ == "__main__":
   import doctest

   doctest.testmod()
   print(depth_first_search(G, """A"""))








def 	SCREAMING_SNAKE_CASE_							(	_snake_case	:int				)  ->     int:
   if not isinstance(_snake_case	,   _snake_case				):
      raise ValueError('''Input must be an integer'''				)
   if input_num <= 0:
      raise ValueError('''Input must be positive'''				)
   return sum(
       divisor for divisor in range(1	,   input_num // 2 + 1				) if input_num % divisor == 0				)


if __name__ == "__main__":
   import doctest

   doctest.testmod()



