






"""simple docstring"""
from __future__ import annotations

def        snake_case   (     A__			,A__		):
			print(F"""Vertex\tShortest Distance from vertex {src}"""		)
			for i, d in enumerate(A__		):
						print(F"""{i}\t\t{d}"""		)

def        snake_case   (     A__			,A__			,A__		):
			for j in range(A__		):
						UpperCAmelCase_  :				Any      =      (graph[j][k] for k in ["src", "dst", "weight"])
						if distance[u] != float("inf"		) and distance[u] + w < distance[v]:
									return True
			return False

def        snake_case   (     A__			,A__			,A__			,A__		):
			UpperCAmelCase_  :				Optional[Any]      =      [float("inf"		)] * vertex_count
			UpperCAmelCase_  :				Any      =      0.0

			for _ in range(vertex_count - 1		):
						for j in range(A__		):
									UpperCAmelCase_  :				Tuple      =      (graph[j][k] for k in ["src", "dst", "weight"])

									if distance[u] != float("inf"		) and distance[u] + w < distance[v]:
												UpperCAmelCase_  :				List[Any]      =      distance[u] + w

			UpperCAmelCase_  :				Any      =      check_negative_cycle(A__			,A__			,A__		)
			if negative_cycle_exists:
						raise Exception("Negative cycle found"		)

			return distance


if __name__ == "__main__":
			import doctest

			doctest.testmod()

			lowerCamelCase_       			=   int(input('''Enter number of vertices: ''').strip())
			lowerCamelCase_       			=   int(input('''Enter number of edges: ''').strip())

			lowerCamelCase_       			=   [{} for _ in range(E)]

			for i in range(E):
						print('''Edge ''', i + 1)
						lowerCamelCase_			,	lowerCamelCase_			,	lowerCamelCase_       			=   (
						    int(x)
						    for x in input('''Enter source, destination, weight: ''').strip().split(''' ''')
						)
						lowerCamelCase_       			=   {'''src''': src, '''dst''': dest, '''weight''': weight}

			lowerCamelCase_       			=   int(input('''\nEnter shortest path source:''').strip())
			lowerCamelCase_       			=   bellman_ford(graph, V, E, source)
			print_distance(shortest_distance, 0)











"""simple docstring"""
class     UpperCamelCase_ :





	def __init__(   self      :				List[str]			,			lowerCAmelCase_      :				int			,			lowerCAmelCase_      :				int=None			,			lowerCAmelCase_      :				List[Any]=None		)		->    int:
				UpperCAmelCase_  :				int      =      data
				UpperCAmelCase_  :				Optional[int]      =      previous
				UpperCAmelCase_  :				int      =      next_node





	def __str__(   self      :				Dict		)		->    str:
				return f"""{self.data}"""





	def   _SCREAMING_SNAKE_CASE   (   self      :				Any		)		->    int:
				return self.data





	def   _SCREAMING_SNAKE_CASE   (   self      :				Dict		)		->    Union[str, Any]:
				return self.next





	def   _SCREAMING_SNAKE_CASE   (   self      :				Union[str, Any]		)		->    Optional[int]:
				return self.previous







class     UpperCamelCase_ :





	def __init__(   self      :				Any			,			lowerCAmelCase_      :				str		)		->    List[str]:
				UpperCAmelCase_  :				Union[str, Any]      =      head





	def __iter__(   self      :				Any		)		->    List[str]:
				return self





	def   _SCREAMING_SNAKE_CASE   (   self      :				Union[str, Any]		)		->    str:
				if not self.current:
							raise StopIteration
				else:
							UpperCAmelCase_  :				Optional[int]      =      self.current.get_data()
							UpperCAmelCase_  :				Dict      =      self.current.get_next()
							return value







class     UpperCamelCase_ :





	def __init__(   self      :				List[str]		)		->    Tuple:
				UpperCAmelCase_  :				Tuple      =      None  # First node in list
				UpperCAmelCase_  :				Union[str, Any]      =      None  # Last node in list





	def __str__(   self      :				List[Any]		)		->    Optional[int]:
				UpperCAmelCase_  :				List[str]      =      self.head
				UpperCAmelCase_  :				int      =      []
				while current is not None:
							nodes.append(current.get_data()		)
							UpperCAmelCase_  :				Optional[Any]      =      current.get_next()
				return " ".join(str(lowerCAmelCase_		) for node in nodes		)





	def __contains__(   self      :				int			,			lowerCAmelCase_      :				int		)		->    List[str]:
				UpperCAmelCase_  :				Optional[int]      =      self.head
				while current:
							if current.get_data() == value:
										return True
							UpperCAmelCase_  :				Union[str, Any]      =      current.get_next()
				return False





	def __iter__(   self      :				int		)		->    Tuple:
				return LinkedListIterator(self.head		)





	def   _SCREAMING_SNAKE_CASE   (   self      :				List[Any]		)		->    Optional[int]:
				if self.head:
							return self.head.get_data()
				return None





	def   _SCREAMING_SNAKE_CASE   (   self      :				str		)		->    Optional[Any]:
				if self.tail:
							return self.tail.get_data()
				return None





	def   _SCREAMING_SNAKE_CASE   (   self      :				Optional[int]			,			lowerCAmelCase_      :				Node		)		->    None:
				if self.head is None:
							UpperCAmelCase_  :				Optional[int]      =      node
							UpperCAmelCase_  :				Union[str, Any]      =      node
				else:
							self.insert_before_node(self.head			,			lowerCAmelCase_		)





	def   _SCREAMING_SNAKE_CASE   (   self      :				Tuple			,			lowerCAmelCase_      :				Node		)		->    None:
				if self.head is None:
							self.set_head(lowerCAmelCase_		)
				else:
							self.insert_after_node(self.tail			,			lowerCAmelCase_		)





	def   _SCREAMING_SNAKE_CASE   (   self      :				int			,			lowerCAmelCase_      :				int		)		->    None:
				UpperCAmelCase_  :				Optional[Any]      =      Node(lowerCAmelCase_		)
				if self.head is None:
							self.set_head(lowerCAmelCase_		)
				else:
							self.set_tail(lowerCAmelCase_		)





	def   _SCREAMING_SNAKE_CASE   (   self      :				List[Any]			,			lowerCAmelCase_      :				Node			,			lowerCAmelCase_      :				Node		)		->    None:
				UpperCAmelCase_  :				Any      =      node
				UpperCAmelCase_  :				Tuple      =      node.previous

				if node.get_previous() is None:
							UpperCAmelCase_  :				List[Any]      =      node_to_insert
				else:
							UpperCAmelCase_  :				Dict      =      node_to_insert

				UpperCAmelCase_  :				Dict      =      node_to_insert





	def   _SCREAMING_SNAKE_CASE   (   self      :				Optional[int]			,			lowerCAmelCase_      :				Node			,			lowerCAmelCase_      :				Node		)		->    None:
				UpperCAmelCase_  :				Dict      =      node
				UpperCAmelCase_  :				int      =      node.next

				if node.get_next() is None:
							UpperCAmelCase_  :				int      =      node_to_insert
				else:
							UpperCAmelCase_  :				Optional[Any]      =      node_to_insert

				UpperCAmelCase_  :				Any      =      node_to_insert





	def   _SCREAMING_SNAKE_CASE   (   self      :				Tuple			,			lowerCAmelCase_      :				int			,			lowerCAmelCase_      :				int		)		->    None:
				UpperCAmelCase_  :				int      =      1
				UpperCAmelCase_  :				List[str]      =      Node(lowerCAmelCase_		)
				UpperCAmelCase_  :				Optional[Any]      =      self.head
				while node:
							if current_position == position:
										self.insert_before_node(lowerCAmelCase_			,			lowerCAmelCase_		)
										return
							current_position += 1
							UpperCAmelCase_  :				Optional[Any]      =      node.next
				self.insert_after_node(self.tail			,			lowerCAmelCase_		)





	def   _SCREAMING_SNAKE_CASE   (   self      :				Optional[Any]			,			lowerCAmelCase_      :				int		)		->    Node:
				UpperCAmelCase_  :				List[Any]      =      self.head
				while node:
							if node.get_data() == item:
										return node
							UpperCAmelCase_  :				Optional[int]      =      node.get_next()
				raise Exception("Node not found"		)





	def   _SCREAMING_SNAKE_CASE   (   self      :				str			,			lowerCAmelCase_      :				List[str]		)		->    Union[str, Any]:
				if (node := self.get_node(lowerCAmelCase_		)) is not None:
							if node == self.head:
										UpperCAmelCase_  :				Tuple      =      self.head.get_next()

							if node == self.tail:
										UpperCAmelCase_  :				Optional[int]      =      self.tail.get_previous()

							self.remove_node_pointers(lowerCAmelCase_		)





	@staticmethod
	def   _SCREAMING_SNAKE_CASE   (   lowerCAmelCase_      :				Node		)		->    None:
				if node.get_next():
							UpperCAmelCase_  :				int      =      node.previous

				if node.get_previous():
							UpperCAmelCase_  :				Optional[Any]      =      node.next

				UpperCAmelCase_  :				Optional[int]      =      None
				UpperCAmelCase_  :				Dict      =      None





	def   _SCREAMING_SNAKE_CASE   (   self      :				Union[str, Any]		)		->    str:
				return self.head is None





def        snake_case   (     ):
			pass


if __name__ == "__main__":
			import doctest

			doctest.testmod()



