


'''simple docstring'''

from typing import TYPE_CHECKING

# rely on isort to merge the imports
from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_torch_available, is_vision_available


lowerCAmelCase				:Optional[Any]        =      {
    '''configuration_efficientnet''': [
        '''EFFICIENTNET_PRETRAINED_CONFIG_ARCHIVE_MAP''',
        '''EfficientNetConfig''',
        '''EfficientNetOnnxConfig''',
    ]
}

try:
							if not is_vision_available():
														raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
							pass
else:
							lowerCAmelCase				:List[Any]        =      ['''EfficientNetImageProcessor''']

try:
							if not is_torch_available():
														raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
							pass
else:
							lowerCAmelCase				:List[str]        =      [
							    '''EFFICIENTNET_PRETRAINED_MODEL_ARCHIVE_LIST''',
							    '''EfficientNetForImageClassification''',
							    '''EfficientNetModel''',
							    '''EfficientNetPreTrainedModel''',
							]

if TYPE_CHECKING:
							from .configuration_efficientnet import (
							    EFFICIENTNET_PRETRAINED_CONFIG_ARCHIVE_MAP,
							    EfficientNetConfig,
							    EfficientNetOnnxConfig,
							)

							try:
														if not is_vision_available():
																					raise OptionalDependencyNotAvailable()
							except OptionalDependencyNotAvailable:
														pass
							else:
														from .image_processing_efficientnet import EfficientNetImageProcessor

							try:
														if not is_torch_available():
																					raise OptionalDependencyNotAvailable()
							except OptionalDependencyNotAvailable:
														pass
							else:
														from .modeling_efficientnet import (
														    EFFICIENTNET_PRETRAINED_MODEL_ARCHIVE_LIST,
														    EfficientNetForImageClassification,
														    EfficientNetModel,
														    EfficientNetPreTrainedModel,
														)

else:
							import sys

							lowerCAmelCase				:Optional[Any]        =      _LazyModule(__name__, globals()['''__file__'''], _import_structure)



'''simple docstring'''

from __future__ import annotations

from sys import maxsize
from typing import Generic, TypeVar

lowerCAmelCase				:Any        =      TypeVar('''T''')





def lowerCamelCase      (      lowerCAmelCase    :     int		):





	"""simple docstring"""







	return (position - 1) // 2





def lowerCamelCase      (      lowerCAmelCase    :     int		):





	"""simple docstring"""







	return (2 * position) + 1





def lowerCamelCase      (      lowerCAmelCase    :     int		):





	"""simple docstring"""







	return (2 * position) + 2
class _lowerCamelCase	(						Generic[T]							):



		'''simple docstring'''







		def __init__( self		:						Union[str, Any]      )  ->			None:
			__magic_name__	:   list[tuple[T, int]]					     =					[]
			__magic_name__	:   dict[T, int]					     =					{}
			__magic_name__	:   int					     =					0







		def __len__( self		:						Optional[int]      )  ->			int:
			return self.elements







		def __repr__( self		:						Optional[Any]      )  ->			str:
			return str(self.heap      )







		def        __lowerCAmelCase		( self		:						List[Any]      )  ->			bool:
			# Check if the priority queue is empty
			return self.elements == 0







		def        __lowerCAmelCase		( self		:						Dict  ,					_A		:						T  ,					_A		:						int      )  ->			None:
			# Add an element with given priority to the queue
			self.heap.append((elem, weight)      )
			__magic_name__	:   List[str]					     =					self.elements
			self.elements += 1
			self._bubble_up(_A      )







		def        __lowerCAmelCase		( self		:						List[Any]      )  ->			T:
			# Remove and return the element with lowest weight (highest priority)
			if self.elements > 1:
				self._swap_nodes(0  ,					self.elements - 1      )
			__magic_name__     ,    __magic_name__	:   Optional[Any]					     =					self.heap.pop()
			del self.position_map[elem]
			self.elements -= 1
			if self.elements > 0:
				__magic_name__     ,    __magic_name__	:   Tuple					     =					self.heap[0]
				self._bubble_down(_A      )
			return elem







		def        __lowerCAmelCase		( self		:						Dict  ,					_A		:						T  ,					_A		:						int      )  ->			None:
			# Update the weight of the given key
			__magic_name__	:   Optional[Any]					     =					self.position_map[elem]
			__magic_name__	:   Any					     =					(elem, weight)
			if position > 0:
				__magic_name__	:   Optional[int]					     =					get_parent_position(_A      )
				__magic_name__     ,    __magic_name__	:   Any					     =					self.heap[parent_position]
				if parent_weight > weight:
					self._bubble_up(_A      )
				else:
					self._bubble_down(_A      )
			else:
				self._bubble_down(_A      )







		def        __lowerCAmelCase		( self		:						Optional[int]  ,					_A		:						T      )  ->			None:
			# Place a node at the proper position (upward movement) [to be used internally
			# only]
			__magic_name__	:   Union[str, Any]					     =					self.position_map[elem]
			if curr_pos == 0:
				return None
			__magic_name__	:   Optional[Any]					     =					get_parent_position(_A      )
			__magic_name__     ,    __magic_name__	:   Any					     =					self.heap[curr_pos]
			__magic_name__     ,    __magic_name__	:   int					     =					self.heap[parent_position]
			if parent_weight > weight:
				self._swap_nodes(_A  ,					_A      )
				return self._bubble_up(_A      )
			return None







		def        __lowerCAmelCase		( self		:						int  ,					_A		:						T      )  ->			None:
			# Place a node at the proper position (downward movement) [to be used
			# internally only]
			__magic_name__	:   Dict					     =					self.position_map[elem]
			__magic_name__     ,    __magic_name__	:   List[str]					     =					self.heap[curr_pos]
			__magic_name__	:   str					     =					get_child_left_position(_A      )
			__magic_name__	:   List[str]					     =					get_child_right_position(_A      )
			if child_left_position < self.elements and child_right_position < self.elements:
				__magic_name__     ,    __magic_name__	:   int					     =					self.heap[child_left_position]
				__magic_name__     ,    __magic_name__	:   int					     =					self.heap[child_right_position]
				if child_right_weight < child_left_weight and child_right_weight < weight:
					self._swap_nodes(_A  ,					_A      )
					return self._bubble_down(_A      )
			if child_left_position < self.elements:
				__magic_name__     ,    __magic_name__	:   Any					     =					self.heap[child_left_position]
				if child_left_weight < weight:
					self._swap_nodes(_A  ,					_A      )
					return self._bubble_down(_A      )
			else:
				return None
			if child_right_position < self.elements:
				__magic_name__     ,    __magic_name__	:   str					     =					self.heap[child_right_position]
				if child_right_weight < weight:
					self._swap_nodes(_A  ,					_A      )
					return self._bubble_down(_A      )
			return None







		def        __lowerCAmelCase		( self		:						int  ,					_A		:						int  ,					_A		:						int      )  ->			None:
			# Swap the nodes at the given positions
			__magic_name__	:   List[Any]					     =					self.heap[nodea_pos][0]
			__magic_name__	:   Union[str, Any]					     =					self.heap[nodea_pos][0]
			__magic_name__     ,    __magic_name__	:   Optional[Any]					     =					(
			    self.heap[nodea_pos],
			    self.heap[nodea_pos],
			)
			__magic_name__	:   Optional[Any]					     =					nodea_pos
			__magic_name__	:   Optional[Any]					     =					nodea_pos







class _lowerCamelCase	(						Generic[T]							):



		'''simple docstring'''







		def __init__( self		:						Union[str, Any]      )  ->			None:
			__magic_name__	:   dict[T, dict[T, int]]					     =					{}
			__magic_name__	:   int					     =					0







		def __repr__( self		:						str      )  ->			str:
			return str(self.connections      )







		def __len__( self		:						Union[str, Any]      )  ->			int:
			return self.nodes







		def        __lowerCAmelCase		( self		:						Dict  ,					_A		:						T      )  ->			None:
			# Add a node in the graph if it is not in the graph
			if node not in self.connections:
				__magic_name__	:   str					     =					{}
				self.nodes += 1







		def        __lowerCAmelCase		( self		:						List[str]  ,					_A		:						T  ,					_A		:						T  ,					_A		:						int      )  ->			None:
			# Add an edge between 2 nodes in the graph
			self.add_node(_A      )
			self.add_node(_A      )
			__magic_name__	:   Any					     =					weight
			__magic_name__	:   Dict					     =					weight







def lowerCamelCase      (      lowerCAmelCase    :     GraphUndirectedWeighted[T]		,		):





	"""simple docstring"""







	__magic_name__	:   dict[T, int]					     =					{node: maxsize for node in graph.connections}
	__magic_name__	:   dict[T, T | None]					     =					{node: None for node in graph.connections}

	__magic_name__	:   MinPriorityQueue[T]					     =					MinPriorityQueue()
	for node, weight in dist.items():
		priority_queue.push(lowerCAmelCase		,		lowerCAmelCase		)

	if priority_queue.is_empty():
		return dist, parent

	# initialization
	__magic_name__	:   Any					     =					priority_queue.extract_min()
	__magic_name__	:   List[str]					     =					0
	for neighbour in graph.connections[node]:
		if dist[neighbour] > dist[node] + graph.connections[node][neighbour]:
			__magic_name__	:   Any					     =					dist[node] + graph.connections[node][neighbour]
			priority_queue.update_key(lowerCAmelCase		,		dist[neighbour]		)
			__magic_name__	:   Tuple					     =					node

    # running prim's algorithm
	while not priority_queue.is_empty():
		__magic_name__	:   Tuple					     =					priority_queue.extract_min()
		for neighbour in graph.connections[node]:
			if dist[neighbour] > dist[node] + graph.connections[node][neighbour]:
				__magic_name__	:   int					     =					dist[node] + graph.connections[node][neighbour]
				priority_queue.update_key(lowerCAmelCase		,		dist[neighbour]		)
				__magic_name__	:   Union[str, Any]					     =					node
	return dist, parent