






from typing import Union

import fire
import torch
from tqdm import tqdm
def 					snake_case_						(   lowerCAmelCase_				:  str				,				lowerCAmelCase_				:  str = "cpu"				,				lowerCAmelCase_				:  Union[str, None] = None					):
							__lowercase					:							List[Any]			=   torch.load(lowerCAmelCase_				,				map_location=lowerCAmelCase_					)
							for k, v in tqdm(state_dict.items()					):
														if not isinstance(lowerCAmelCase_				,				torch.Tensor					):
																					raise TypeError("""FP16 conversion only works on paths that are saved state dicts, like pytorch_model.bin"""					)
														__lowercase					:							int			=   v.half()
							if save_path is None:  # overwrite src_path
														__lowercase					:							Optional[Any]			=   src_path
							torch.save(lowerCAmelCase_				,				lowerCAmelCase_					)


if __name__ == "__main__":
	fire.Fire(convert)







import math

class 						lowerCAmelCase   :

					'''simple docstring'''

					def __init__(     self :		Tuple						,   __a :		int=0							)	->     Optional[Any]:  # a graph with Node 0,1,...,N-1


												"""simple docstring"""

												__lowercase					:							Any			=   n
												__lowercase					:							Optional[int]			=   [
												    [math.inf for j in range(0						,   __a							)] for i in range(0						,   __a							)
												]  # adjacency matrix for weight
												__lowercase					:							Dict			=   [
												    [math.inf for j in range(0						,   __a							)] for i in range(0						,   __a							)
												]  # dp[i][j] stores minimum distance from i to j



					def 					lowerCAmelCase (     self :		int						,   __a :		Optional[int]						,   __a :		Tuple						,   __a :		Dict							)	->     Dict:


												"""simple docstring"""

												__lowercase					:							Any			=   w



					def 					lowerCAmelCase (     self :		List[str]							)	->     Tuple:


												"""simple docstring"""

												for k in range(0						,   self.n							):
																			for i in range(0						,   self.n							):
																										for j in range(0						,   self.n							):
																																	__lowercase					:							List[str]			=   min(self.dp[i][j]						,   self.dp[i][k] + self.dp[k][j]							)



					def 					lowerCAmelCase (     self :		Any						,   __a :		Any						,   __a :		str							)	->     int:


												"""simple docstring"""

												return self.dp[u][v]


if __name__ == "__main__":
	lowerCamelCase       :       int        =				Graph(5)
	graph.add_edge(0, 2, 9)
	graph.add_edge(0, 4, 10)
	graph.add_edge(1, 3, 5)
	graph.add_edge(2, 3, 7)
	graph.add_edge(3, 0, 10)
	graph.add_edge(3, 1, 2)
	graph.add_edge(3, 2, 1)
	graph.add_edge(3, 4, 6)
	graph.add_edge(4, 1, 3)
	graph.add_edge(4, 2, 4)
	graph.add_edge(4, 3, 9)
	graph.floyd_warshall()
	graph.show_min(1, 4)
	graph.show_min(0, 3)