



'''simple docstring'''






import jax.numpy as jnp

from ...utils import logging
from ..ta.modeling_flax_ta import FlaxTaEncoderModel, FlaxTaForConditionalGeneration, FlaxTaModel
from .configuration_mta import MTaConfig


lowerCAmelCase: Optional[Any]							=						logging.get_logger(__name__)

lowerCAmelCase: Any							=						'T5Config'
def 				lowerCamelCase__	(						_A			,      _A			,      _A    ):
  a						: List[Any]					       =					jnp.zeros_like(_A    )
  a						: Any					       =					shifted_input_ids.at[:, 1:].set(input_ids[:, :-1]    )
  a						: int					       =					shifted_input_ids.at[:, 0].set(_A    )

  a						: Optional[int]					       =					jnp.where(shifted_input_ids == -100			,      _A			,      _A    )
  return shifted_input_ids

class 							a__( lowerCamelCase__     ):
    lowercase__			=   """mt5"""
    lowercase__			=   MTaConfig

class 							a__( lowerCamelCase__     ):
    lowercase__			=   """mt5"""
    lowercase__			=   MTaConfig

class 							a__( lowerCamelCase__     ):
    lowercase__			=   """mt5"""
    lowercase__			=   MTaConfig







'''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)