"""simple docstring"""


from __future__ import annotations





def      lowerCamelCase_					(   __lowerCAmelCase  ,       __lowerCAmelCase							)				->   set[str]:




						'''simple docstring'''



						lowerCamelCase__   , lowerCamelCase__   =set(__lowerCAmelCase							), [start]

						while stack:
												lowerCamelCase__   =stack.pop()
												explored.add(__lowerCAmelCase							)
												# 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(__lowerCAmelCase							)
						return explored


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



"""simple docstring"""


def      lowerCamelCase_					(   __lowerCAmelCase							)				->   bool:




						'''simple docstring'''



						return number & 1 == 0


if __name__ == "__main__":
	import doctest

	doctest.testmod()


