
"""simple docstring"""
import contextlib
import importlib
import io
import unittest

import transformers

# Try to import everything from transformers to ensure every object can be loaded.
from transformers import *  # noqa F406
from transformers.testing_utils import DUMMY_UNKNOWN_IDENTIFIER, require_flax, require_tf, require_torch
from transformers.utils import ContextManagers, find_labels, is_flax_available, is_tf_available, is_torch_available


if is_torch_available():
    from transformers import BertForPreTraining, BertForQuestionAnswering, BertForSequenceClassification

if is_tf_available():
    from transformers import TFBertForPreTraining, TFBertForQuestionAnswering, TFBertForSequenceClassification

if is_flax_available():
    from transformers import FlaxBertForPreTraining, FlaxBertForQuestionAnswering, FlaxBertForSequenceClassification


lowercase_       :						int     					=	DUMMY_UNKNOWN_IDENTIFIER
# An actual model hosted on huggingface.co

lowercase_       :						Tuple     					=	'''main'''
# Default branch name
lowercase_       :						Tuple     					=	'''f2c752cfc5c0ab6f4bdec59acea69eefbee381c2'''
# One particular commit (not the top of `main`)
lowercase_       :						str     					=	'''aaaaaaa'''
# This commit does not exist, so we should 404.

lowercase_       :						int     					=	'''d9e9f15bc825e4b2c9249e9578f884bbcb5e3684'''
# Sha-1 of config.json on the top of `main`, for checking purposes
lowercase_       :						List[Any]     					=	'''4b243c475af8d0a7754e87d7d096c92e5199ec2fe168a2ee7998e3b8e9bcb1d3'''





@contextlib.contextmanager
def    _lowerCAmelCase    (     )  ->    str:
  print("Welcome!"				)
  yield
  print("Bye!"				)





@contextlib.contextmanager
def    _lowerCAmelCase    (     )  ->    List[Any]:
  print("Bonjour!"				)
  yield
  print("Au revoir!"				)
class 			UpperCamelCase      (							unittest.TestCase  ):
     def 				__SCREAMING_SNAKE_CASE							(     self				):




       """simple docstring"""


       assert transformers.__spec__ is not None
       assert importlib.util.find_spec("transformers"				) is not None
class 			UpperCamelCase      (							unittest.TestCase  ):
     @unittest.mock.patch("sys.stdout"  ,     new_callable=io.StringIO				)
     def 				__SCREAMING_SNAKE_CASE							(     self  ,     snake_case__				):




       """simple docstring"""


       with ContextManagers([]				):
         print("Transformers are awesome!"				)
       # The print statement adds a new line at the end of the output
       self.assertEqual(mock_stdout.getvalue()  ,     "Transformers are awesome!\n"				)
     @unittest.mock.patch("sys.stdout"  ,     new_callable=io.StringIO				)
     def 				__SCREAMING_SNAKE_CASE							(     self  ,     snake_case__				):




       """simple docstring"""


       with ContextManagers([context_en()]				):
         print("Transformers are awesome!"				)
       # The output should be wrapped with an English welcome and goodbye
       self.assertEqual(mock_stdout.getvalue()  ,     "Welcome!\nTransformers are awesome!\nBye!\n"				)
     @unittest.mock.patch("sys.stdout"  ,     new_callable=io.StringIO				)
     def 				__SCREAMING_SNAKE_CASE							(     self  ,     snake_case__				):




       """simple docstring"""


       with ContextManagers([context_fr(), context_en()]				):
         print("Transformers are awesome!"				)
       # The output should be wrapped with an English and French welcome and goodbye
       self.assertEqual(mock_stdout.getvalue()  ,     "Bonjour!\nWelcome!\nTransformers are awesome!\nBye!\nAu revoir!\n"				)
     @require_torch
     def 				__SCREAMING_SNAKE_CASE							(     self				):




       """simple docstring"""


       self.assertEqual(find_labels(snake_case__				)  ,     ["labels"]				)
       self.assertEqual(find_labels(snake_case__				)  ,     ["labels", "next_sentence_label"]				)
       self.assertEqual(find_labels(snake_case__				)  ,     ["start_positions", "end_positions"]				)
       class 			UpperCamelCase      (							__SCREAMING_SNAKE_CASE  ):
            pass
       self.assertEqual(find_labels(snake_case__				)  ,     ["labels"]				)
     @require_tf
     def 				__SCREAMING_SNAKE_CASE							(     self				):




       """simple docstring"""


       self.assertEqual(find_labels(snake_case__				)  ,     ["labels"]				)
       self.assertEqual(find_labels(snake_case__				)  ,     ["labels", "next_sentence_label"]				)
       self.assertEqual(find_labels(snake_case__				)  ,     ["start_positions", "end_positions"]				)
       class 			UpperCamelCase      (							__SCREAMING_SNAKE_CASE  ):
            pass
       self.assertEqual(find_labels(snake_case__				)  ,     ["labels"]				)




     @require_flax
     def 				__SCREAMING_SNAKE_CASE							(     self				):




       """simple docstring"""


       self.assertEqual(find_labels(snake_case__				)  ,     []				)
       self.assertEqual(find_labels(snake_case__				)  ,     []				)
       self.assertEqual(find_labels(snake_case__				)  ,     []				)
       class 			UpperCamelCase      (							__SCREAMING_SNAKE_CASE  ):
            pass
       self.assertEqual(find_labels(snake_case__				)  ,     []				)





"""simple docstring"""
def    _lowerCAmelCase    (     lowerCamelCase__							:							str,						lowerCamelCase__							:							str				)  ->    Union[str, Any]:
  print("\nThe shortest path matrix using Floyd Warshall algorithm\n"				)
  for i in range(lowerCamelCase__				):
    for j in range(lowerCamelCase__				):
      if dist[i][j] != float("inf"				):
        print(int(dist[i][j]				),						end="\t"				)
      else:
        print("INF",						end="\t"				)
    print()





def    _lowerCAmelCase    (     lowerCamelCase__							:							Dict,						lowerCamelCase__							:							Any				)  ->    List[str]:
  _SCREAMING_SNAKE_CASE   :				List[Any]							    = [[float("inf"				) for _ in range(lowerCamelCase__				)] for _ in range(lowerCamelCase__				)]

  for i in range(lowerCamelCase__				):
    for j in range(lowerCamelCase__				):
      _SCREAMING_SNAKE_CASE   :				List[Any]							    = graph[i][j]

      # check vertex k against all other vertices (i, j)
  for k in range(lowerCamelCase__				):
    # looping through rows of graph array
    for i in range(lowerCamelCase__				):
      # looping through columns of graph array
      for j in range(lowerCamelCase__				):
        if (
            dist[i][k] != float("inf"				)
            and dist[k][j] != float("inf"				)
            and dist[i][k] + dist[k][j] < dist[i][j]
        ):
          _SCREAMING_SNAKE_CASE   :				List[Any]							    = dist[i][k] + dist[k][j]

  _print_dist(lowerCamelCase__,						lowerCamelCase__				)
  return dist, v


if __name__ == "__main__":
      lowercase_       :						Tuple     					=	int(input('''Enter number of vertices: '''))
      lowercase_       :						List[Any]     					=	int(input('''Enter number of edges: '''))

      lowercase_       :						Optional[Any]     					=	[[float('''inf''') for i in range(v)] for j in range(v)]

      for i in range(v):
            lowercase_       :						Tuple     					=	0.0

            # src and dst are indices that must be within the array size graph[e][v]
            # failure to follow this will result in an error
      for i in range(e):
            print('''\nEdge ''', i + 1)
            lowercase_       :						str     					=	int(input('''Enter source:'''))
            lowercase_       :						Optional[Any]     					=	int(input('''Enter destination:'''))
            lowercase_       :						Union[str, Any]     					=	float(input('''Enter weight:'''))
            lowercase_       :						str     					=	weight

      floyd_warshall(graph, v)

      # Example Input
      # Enter number of vertices: 3
      # Enter number of edges: 2

      # # generated graph from vertex and edge inputs
      # [[inf, inf, inf], [inf, inf, inf], [inf, inf, inf]]
      # [[0.0, inf, inf], [inf, 0.0, inf], [inf, inf, 0.0]]

      # specify source, destination and weight for edge #1
      # Edge  1
      # Enter source:1
      # Enter destination:2
      # Enter weight:2

      # specify source, destination and weight for edge #2
      # Edge  2
      # Enter source:2
      # Enter destination:1
      # Enter weight:1

      # # Expected Output from the vertice, edge and src, dst, weight inputs!!
      # 0		INF	INF
      # INF	0	2
      # INF	1	0



