


'''simple docstring'''
def 	_A  (       A							,A							)  ->				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 	_A  (       A							,A							)  ->				Union[str, Any]:
	lowercase						:		Any   					=		[[float("inf"							) for _ in range(_lowerCamelCase							)] for _ in range(_lowerCamelCase							)]

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

	_print_dist(_lowerCamelCase							,_lowerCamelCase							)
	return dist, v


if __name__ == "__main__":
					lowerCAmelCase   : str             =				int(input("""Enter number of vertices: """))
					lowerCAmelCase   : Optional[int]             =				int(input("""Enter number of edges: """))

					lowerCAmelCase   : Optional[int]             =				[[float("""inf""") for i in range(v)] for j in range(v)]

					for i in range(v):
										lowerCAmelCase   : List[str]             =				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   : Tuple             =				int(input("""Enter source:"""))
										lowerCAmelCase   : Dict             =				int(input("""Enter destination:"""))
										lowerCAmelCase   : Tuple             =				float(input("""Enter weight:"""))
										lowerCAmelCase   : 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




"""simple docstring"""






import warnings

from ...utils import logging
from .image_processing_perceiver import PerceiverImageProcessor


UpperCAmelCase        =				logging.get_logger(__name__)



class 			lowercase					( lowercase__		):






			def __init__(self  :	str      ,*SCREAMING_SNAKE_CASE_  :	Any      ,**SCREAMING_SNAKE_CASE_  :	Optional[int]			)       ->	None:





				"""simple docstring"""


				warnings.warn(
				    '''The class PerceiverFeatureExtractor is deprecated and will be removed in version 5 of Transformers.'''
				    ''' Please use PerceiverImageProcessor instead.'''      ,SCREAMING_SNAKE_CASE_      ,)
				super().__init__(*SCREAMING_SNAKE_CASE_      ,**SCREAMING_SNAKE_CASE_			)


