import math




def       _snake_case	(   lowerCAmelCase							:   float   , lowerCAmelCase							:   float	):
		"""simple docstring"""







		if initial_intensity < 0:
				raise ValueError("The value of intensity cannot be negative"	)
				# handling of negative values of initial intensity
		if angle < 0 or angle > 3_6_0:
				raise ValueError("In Malus Law, the angle is in the range 0-360 degrees"	)
				# handling of values out of allowed range
		return initial_intensity * (math.cos(math.radians(lowerCAmelCase	)	) ** 2)


if __name__ == "__main__":
		import doctest

		doctest.testmod(name='''malus_law''')



from __future__ import annotations

def 	snake_case__			(    SCREAMING_SNAKE_CASE_		:    dict	,     SCREAMING_SNAKE_CASE_		:    str			):



     '''simple docstring'''





     lowercase__      , lowercase__    :   List[str]      =       set(SCREAMING_SNAKE_CASE_			), [start]

     while stack:
          lowercase__    :   Union[str, Any]      =       stack.pop()
          explored.add(SCREAMING_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(SCREAMING_SNAKE_CASE_			)
     return explored


snake_case_			  = {
    '''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'''))

