






"""simple docstring"""







a					:							Union[str, Any]    =						"""\n# Transformers installation\n! pip install transformers datasets\n# To install from source instead of the last release, comment the command above and uncomment the following one.\n# ! pip install git+https://github.com/huggingface/transformers.git\n"""

a					:							List[str]    =						[{"""type""": """code""", """content""": INSTALL_CONTENT}]
a					:							List[Any]    =						{
    """{processor_class}""": """FakeProcessorClass""",
    """{model_class}""": """FakeModelClass""",
    """{object_class}""": """FakeObjectClass""",
}








from __future__ import annotations

from collections import deque
from collections.abc import Iterator
from dataclasses import dataclass





@dataclass
class     lowerCamelCase      :
	UpperCamelCase_  :					int
	UpperCamelCase_  :					int





class     lowerCamelCase      :







	def __init__(     self      :Dict   ,     lowercase      :int			)		->      Union[str, Any]:







				"""simple docstring"""






				SCREAMING_SNAKE_CASE     						= [[] for _ in range(lowercase			)]
				SCREAMING_SNAKE_CASE     						= size







	def __getitem__(     self      :Union[str, Any]   ,     lowercase      :int			)		->      Iterator[Edge]:







				"""simple docstring"""






				return iter(self._graph[vertex]			)







	@property
	def  snake_case__     (     self      :List[Any]			)		->      str:







				"""simple docstring"""






				return self._size







	def  snake_case__     (     self      :Optional[Any]   ,     lowercase      :int   ,     lowercase      :int   ,     lowercase      :int			)		->      List[Any]:







				"""simple docstring"""






				if weight not in (0, 1):
							raise ValueError('''Edge weight must be either 0 or 1.'''			)

				if to_vertex < 0 or to_vertex >= self.size:
							raise ValueError('''Vertex indexes must be in [0; size).'''			)

				self._graph[from_vertex].append(Edge(lowercase   ,     lowercase			)			)







	def  snake_case__     (     self      :List[str]   ,     lowercase      :int   ,     lowercase      :int			)		->      int | None:







				"""simple docstring"""






				SCREAMING_SNAKE_CASE     						= deque([start_vertex]			)
				SCREAMING_SNAKE_CASE     						= [None] * self.size
				SCREAMING_SNAKE_CASE     						= 0

				while queue:
							SCREAMING_SNAKE_CASE     						= queue.popleft()
							SCREAMING_SNAKE_CASE     						= distances[current_vertex]
							if current_distance is None:
										continue

							for edge in self[current_vertex]:
										SCREAMING_SNAKE_CASE     						= current_distance + edge.weight
										SCREAMING_SNAKE_CASE     						= distances[edge.destination_vertex]
										if (
										    isinstance(lowercase   ,     lowercase			)
										    and new_distance >= dest_vertex_distance
										):
													continue
										SCREAMING_SNAKE_CASE     						= new_distance
										if edge.weight == 0:
													queue.appendleft(edge.destination_vertex			)
										else:
													queue.append(edge.destination_vertex			)

				if distances[finish_vertex] is None:
							raise ValueError('''No path from start_vertex to finish_vertex.'''			)

				return distances[finish_vertex]


if __name__ == "__main__":
							import doctest

							doctest.testmod()