
'''simple docstring'''



import datasets


UpperCamelCase__      :		int       							=  "\\n@InProceedings{conneau2018xnli,\n  author = \"Conneau, Alexis\n                 and Rinott, Ruty\n                 and Lample, Guillaume\n                 and Williams, Adina\n                 and Bowman, Samuel R.\n                 and Schwenk, Holger\n                 and Stoyanov, Veselin\",\n  title = \"XNLI: Evaluating Cross-lingual Sentence Representations\",\n  booktitle = \"Proceedings of the 2018 Conference on Empirical Methods\n               in Natural Language Processing\",\n  year = \"2018\",\n  publisher = \"Association for Computational Linguistics\",\n  location = \"Brussels, Belgium\",\n}\n"

UpperCamelCase__      :		Tuple       							=  "\\nXNLI is a subset of a few thousand examples from MNLI which has been translated\ninto a 14 different languages (some low-ish resource). As with MNLI, the goal is\nto predict textual entailment (does sentence A imply/contradict/neither sentence\nB) and is a classification task (given two sentences, predict one of three\nlabels).\n"

UpperCamelCase__      :		str       							=  "\nComputes XNLI score which is just simple accuracy.\nArgs:\n    predictions: Predicted labels.\n    references: Ground truth labels.\nReturns:\n    'accuracy': accuracy\nExamples:\n\n    >>> predictions = [0, 1]\n    >>> references = [0, 1]\n    >>> xnli_metric = datasets.load_metric(\"xnli\")\n    >>> results = xnli_metric.compute(predictions=predictions, references=references)\n    >>> print(results)\n    {'accuracy': 1.0}\n"
def    lowerCAmelCase_	(				SCREAMING_SNAKE_CASE_    ,      SCREAMING_SNAKE_CASE_						)     ->     Dict:




   """simple docstring"""
   return (preds == labels).mean()







@datasets.utils.file_utils.add_start_docstrings(_DESCRIPTION  ,					_KWARGS_DESCRIPTION)
class    _a				(datasets.Metric):





       """simple docstring"""




       def        UpperCamelCase				(							self      )    ->			int:
          return datasets.MetricInfo(
              description=_DESCRIPTION       ,							citation=_CITATION       ,							inputs_description=_KWARGS_DESCRIPTION       ,							features=datasets.Features(
                  {
                      """predictions""": datasets.Value("""int64""" if self.config_name != """sts-b""" else """float32"""      ),
                      """references""": datasets.Value("""int64""" if self.config_name != """sts-b""" else """float32"""      ),
                  }      )       ,							codebase_urls=[]       ,							reference_urls=[]       ,							format="""numpy"""       ,							)






       def        UpperCamelCase				(							self       ,							A__       ,							A__      )    ->			Tuple:
          return {"accuracy": simple_accuracy(A__       ,							A__      )}








'''simple docstring'''



from __future__ import annotations
def    lowerCAmelCase_	(				SCREAMING_SNAKE_CASE_    ,      SCREAMING_SNAKE_CASE_						)     ->     Tuple:




   """simple docstring"""
   print(F"Vertex\tShortest Distance from vertex {src}"						)
   for i, d in enumerate(SCREAMING_SNAKE_CASE_						):
      print(F"{i}\t\t{d}"						)
def    lowerCAmelCase_	(				SCREAMING_SNAKE_CASE_    ,      SCREAMING_SNAKE_CASE_    ,      SCREAMING_SNAKE_CASE_						)     ->     List[Any]:




   """simple docstring"""
   for j in range(SCREAMING_SNAKE_CASE_						):
      _SCREAMING_SNAKE_CASE ,							_SCREAMING_SNAKE_CASE ,							_SCREAMING_SNAKE_CASE      =				(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    lowerCAmelCase_	(				SCREAMING_SNAKE_CASE_    ,      SCREAMING_SNAKE_CASE_    ,      SCREAMING_SNAKE_CASE_    ,      SCREAMING_SNAKE_CASE_						)     ->     list[float]:




   """simple docstring"""
   _SCREAMING_SNAKE_CASE      =				[float("""inf"""						)] * vertex_count
   _SCREAMING_SNAKE_CASE      =				0.0

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

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

   _SCREAMING_SNAKE_CASE      =				check_negative_cycle(SCREAMING_SNAKE_CASE_    ,      SCREAMING_SNAKE_CASE_    ,      SCREAMING_SNAKE_CASE_						)
   if negative_cycle_exists:
      raise Exception("""Negative cycle found"""						)

   return distance


if __name__ == "__main__":
     import doctest

     doctest.testmod()

     UpperCamelCase__      :		int       							=  int(input("Enter number of vertices: ").strip())
     UpperCamelCase__      :		int       							=  int(input("Enter number of edges: ").strip())

     UpperCamelCase__      :		list[dict[str, int]]       							=  [{} for _ in range(E)]

     for i in range(E):
          print("Edge ", i + 1)
          UpperCamelCase__							,      UpperCamelCase__							,      UpperCamelCase__      :		Dict       							=  (
              int(x)
              for x in input("Enter source, destination, weight: ").strip().split(" ")
          )
          UpperCamelCase__      :		Optional[Any]       							=  {"src": src, "dst": dest, "weight": weight}

     UpperCamelCase__      :		Optional[Any]       							=  int(input("\nEnter shortest path source:").strip())
     UpperCamelCase__      :		Any       							=  bellman_ford(graph, V, E, source)
     print_distance(shortest_distance, 0)






