






def 						a    (		lowerCamelCase_       ):






				'''simple docstring'''
				lowercase__     				=    set()
				# To detect a back edge, keep track of vertices currently in the recursion stack
				lowercase__     				=    set()
				return any(
				    node not in visited and depth_first_search(lowerCamelCase_	,     lowerCamelCase_	,     lowerCamelCase_	,     lowerCamelCase_       )
				    for node in graph       )






def 						a    (		lowerCamelCase_	,     lowerCamelCase_	,     lowerCamelCase_	,     lowerCamelCase_       ):






				'''simple docstring'''
				visited.add(lowerCamelCase_       )
				rec_stk.add(lowerCamelCase_       )

				for node in graph[vertex]:
								if node not in visited:
												if depth_first_search(lowerCamelCase_	,     lowerCamelCase_	,     lowerCamelCase_	,     lowerCamelCase_       ):
																return True
								elif node in rec_stk:
												return True

    # The node needs to be removed from recursion stack before function ends
				rec_stk.remove(lowerCamelCase_       )
				return False


if __name__ == "__main__":
							from doctest import testmod

							testmod()












class    _UpperCAmelCase      :

				"""simple docstring"""




				def __init__(  self		:					Optional[int],						lowerCamelCase		:					Union[str, Any]						):

								'''simple docstring'''
								# we need a list not a string, so do something to change the type
								lowercase__     				=    arr.split(''','''						)




				def        lowercase__     (  self		:					Optional[int]						):

								'''simple docstring'''
								lowercase__     				=    [int(self.array[0]						)] * len(self.array						)
								lowercase__     				=    [int(self.array[0]						)] * len(self.array						)
								for i in range(1,						len(self.array						)						):
												lowercase__     				=    max(
												    int(self.array[i]						) + sum_value[i - 1],						int(self.array[i]						)						)
												lowercase__     				=    max(sum_value[i],						rear[i - 1]						)
								return rear[len(self.array						) - 1]


if __name__ == "__main__":
							A__			:    Dict         =				input('please input some numbers:')
							A__			:    Union[str, Any]         =				SubArray(whole_array)
							A__			:    int         =				array.solve_sub_array()
							print(('the results is:', re))




