



from __future__ import annotations






def      __lowercase       (			a__							,       a__       )    ->			set[str]:
							__SCREAMING_SNAKE_CASE							,	__SCREAMING_SNAKE_CASE									= set(a__       ), [start]

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


lowerCAmelCase__		:					Tuple							={
    '''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'''))











import os






def      __lowercase       (			a__ = "input.txt"       )    ->			int:

							with open(os.path.join(os.path.dirname(a__       )							,       a__       )       ) as input_file:
														__SCREAMING_SNAKE_CASE									= [
														    [int(a__       ) for element in line.split(','       )]
														    for line in input_file.readlines()
														]

							__SCREAMING_SNAKE_CASE									= len(a__       )
							__SCREAMING_SNAKE_CASE									= len(matrix[0]       )

							__SCREAMING_SNAKE_CASE									= [[-1 for _ in range(a__       )] for _ in range(a__       )]
							for i in range(a__       ):
														__SCREAMING_SNAKE_CASE									= matrix[i][0]

							for j in range(1							,       a__       ):
														for i in range(a__       ):
																					__SCREAMING_SNAKE_CASE									= minimal_path_sums[i][j - 1] + matrix[i][j]

														for i in range(1							,       a__       ):
																					__SCREAMING_SNAKE_CASE									= min(
																					    minimal_path_sums[i][j]							,       minimal_path_sums[i - 1][j] + matrix[i][j]       )

														for i in range(rows - 2							,       -1							,       -1       ):
																					__SCREAMING_SNAKE_CASE									= min(
																					    minimal_path_sums[i][j]							,       minimal_path_sums[i + 1][j] + matrix[i][j]       )

							return min(minimal_path_sums_row[-1] for minimal_path_sums_row in minimal_path_sums       )


if __name__ == "__main__":
			print(F'''{solution() = }''')






