





'''simple docstring'''






import tempfile
import unittest

from make_student import create_student_by_copying_alternating_layers

from transformers import AutoConfig
from transformers.file_utils import cached_property
from transformers.testing_utils import require_torch


A__				:   List[Any]      ='''sshleifer/bart-tiny-random'''
A__				:   Any      ='''patrickvonplaten/t5-tiny-random'''




@require_torch
class  UpperCAmelCase     (			unittest.TestCase   ):




      @cached_property
      def 				lowercase__    (			self			: Union[str, Any]  )				->      int:
            return AutoConfig.from_pretrained(_snake_case  )




      def 				lowercase__    (			self			: Optional[int]  )				->      List[str]:
            _lowerCAmelCase							     =							create_student_by_copying_alternating_layers(_snake_case			,			tempfile.mkdtemp()			,			e=1			,			d=1  )
            self.assertEqual(student.config.num_hidden_layers			,			1  )




      def 				lowercase__    (			self			: Tuple  )				->      Any:
            _lowerCAmelCase							     =							create_student_by_copying_alternating_layers(_snake_case			,			tempfile.mkdtemp()			,			e=1			,			d=_snake_case  )




      def 				lowercase__    (			self			: Tuple  )				->      Tuple:
            _lowerCAmelCase							     =							create_student_by_copying_alternating_layers(_snake_case			,			tempfile.mkdtemp()			,			e=1			,			d=_snake_case  )
            self.assertEqual(student.config.encoder_layers			,			1  )
            self.assertEqual(student.config.decoder_layers			,			self.teacher_config.encoder_layers  )




      def 				lowercase__    (			self			: List[Any]  )				->      Any:
            _lowerCAmelCase							     =							create_student_by_copying_alternating_layers(_snake_case			,			tempfile.mkdtemp()			,			e=1			,			d=1  )
            self.assertEqual(student.config.encoder_layers			,			1  )
            self.assertEqual(student.config.decoder_layers			,			1  )




      def 				lowercase__    (			self			: Any  )				->      List[Any]:



            with self.assertRaises(_snake_case  ):
                  create_student_by_copying_alternating_layers(_snake_case			,			tempfile.mkdtemp()			,			e=_snake_case			,			d=_snake_case  )











"""simple docstring"""







def      __UpperCAmelCase      (    __lowerCamelCase						,     __lowerCamelCase	)							->      List[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      __UpperCAmelCase      (    __lowerCamelCase						,     __lowerCamelCase	)							->      Optional[Any]:
		lowercase__   :    str				=			[[float('''inf'''	) for _ in range(__lowerCamelCase	)] for _ in range(__lowerCamelCase	)]

		for i in range(__lowerCamelCase	):
				for j in range(__lowerCamelCase	):
						lowercase__   :    List[str]				=			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]
								):
										lowercase__   :    str				=			dist[i][k] + dist[k][j]

		_print_dist(__lowerCamelCase						,     __lowerCamelCase	)
		return dist, v


if __name__ == "__main__":
							lowerCAmelCase_   						=   int(input('Enter number of vertices: '))
							lowerCAmelCase_   						=   int(input('Enter number of edges: '))

							lowerCAmelCase_   						=   [[float('inf') for i in range(v)] for j in range(v)]

							for i in range(v):
														lowerCAmelCase_   						=   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)
														lowerCAmelCase_   						=   int(input('Enter source:'))
														lowerCAmelCase_   						=   int(input('Enter destination:'))
														lowerCAmelCase_   						=   float(input('Enter weight:'))
														lowerCAmelCase_   						=   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
