


'''simple docstring'''



_lowercase    :    Tuple			     =  {"""a""": ["""c""", """b"""], """b""": ["""d""", """e"""], """c""": [], """d""": [], """e""": []}
_lowercase    :    Any			     =  ["""a""", """b""", """c""", """d""", """e"""]


def    lowerCamelCase__   ( A     :    Any   ,     A     :    List[Any]   ,     A     :    Tuple  ):




						'''simple docstring'''






						UpperCAmelCase         =			start
						# add current to visited
						visited.append(A  )
						UpperCAmelCase         =			edges[current]
						for neighbor in neighbors:
												# if neighbor not in visited, visit
												if neighbor not in visited:
																		UpperCAmelCase         =			topological_sort(A   ,     A   ,     A  )
    # if all neighbors visited add current to sort
						sort.append(A  )
						# if all vertices haven't been visited select a new one to visit
						if len(A  ) != len(A  ):
												for vertice in vertices:
																		if vertice not in visited:
																								UpperCAmelCase         =			topological_sort(A   ,     A   ,     A  )
    # return sort
						return sort


if __name__ == "__main__":
	_lowercase    :    Union[str, Any]			     =  topological_sort("""a""", [], [])
	print(sort)





'''simple docstring'''



def    lowerCamelCase__   ( A     :    str  ):




						'''simple docstring'''






						assert column_title.isupper()
						UpperCAmelCase         =			0
						UpperCAmelCase         =			len(A  ) - 1
						UpperCAmelCase         =			0

						while index >= 0:
												UpperCAmelCase         =			(ord(column_title[index]  ) - 64) * pow(26   ,     A  )
												answer += value
												power += 1
												index -= 1

						return answer


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

	testmod()





