



'''simple docstring'''






from argparse import ArgumentParser

from .add_new_model import AddNewModelCommand
from .add_new_model_like import AddNewModelLikeCommand
from .convert import ConvertCommand
from .download import DownloadCommand
from .env import EnvironmentCommand
from .lfs import LfsCommands
from .pt_to_tf import PTtoTFCommand
from .run import RunCommand
from .serving import ServeCommand
from .user import UserCommands
def 				lowerCamelCase__	(						):
  a						: List[str]					       =					ArgumentParser('Transformers CLI tool'			,      usage='transformers-cli <command> [<args>]'    )
  a						: Optional[int]					       =					parser.add_subparsers(help='transformers-cli command helpers'    )

  # Register commands
  ConvertCommand.register_subcommand(_A    )
  DownloadCommand.register_subcommand(_A    )
  EnvironmentCommand.register_subcommand(_A    )
  RunCommand.register_subcommand(_A    )
  ServeCommand.register_subcommand(_A    )
  UserCommands.register_subcommand(_A    )
  AddNewModelCommand.register_subcommand(_A    )
  AddNewModelLikeCommand.register_subcommand(_A    )
  LfsCommands.register_subcommand(_A    )
  PTtoTFCommand.register_subcommand(_A    )

  # Let's go
  a						: Optional[int]					       =					parser.parse_args()

  if not hasattr(_A			,      'func'    ):
    parser.print_help()
    exit(1    )

  # Run
  a						: List[Any]					       =					args.func(_A    )
  service.run()


if __name__ == "__main__":
     main()







'''simple docstring'''






import math

class 							a__:







    def __init__(				self			:  int						,      __snake_case			:  Any=0     ):  # a graph with Node 0,1,...,N-1
      a						: List[Any]					       =					n
      a						: Optional[Any]					       =					[
          [math.inf for j in range(0						,      __snake_case     )] for i in range(0						,      __snake_case     )
      ]  # adjacency matrix for weight
      a						: Dict					       =					[
          [math.inf for j in range(0						,      __snake_case     )] for i in range(0						,      __snake_case     )
      ]  # dp[i][j] stores minimum distance from i to j







    def       lowercase_	(				self			:  int						,      __snake_case			:  str						,      __snake_case			:  Tuple						,      __snake_case			:  int     ):
      a						: str					       =					w







    def       lowercase_	(				self			:  int     ):
      for k in range(0						,      self.n     ):
        for i in range(0						,      self.n     ):
          for j in range(0						,      self.n     ):
            a						: str					       =					min(self.dp[i][j]						,      self.dp[i][k] + self.dp[k][j]     )







    def       lowercase_	(				self			:  List[str]						,      __snake_case			:  Any						,      __snake_case			:  List[str]     ):
      return self.dp[u][v]


if __name__ == "__main__":
     lowerCAmelCase: Any							=						Graph(5)
     graph.add_edge(0, 2, 9)
     graph.add_edge(0, 4, 1_0)
     graph.add_edge(1, 3, 5)
     graph.add_edge(2, 3, 7)
     graph.add_edge(3, 0, 1_0)
     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)