code: 
  """simple docstring"""
  import unittest
  import warnings
  from dataclasses import dataclass
  
  from transformers.convert_slow_tokenizer import SpmConverter
  from transformers.testing_utils import get_tests_dir
  
  
  @dataclass
  class    _lowerCAmelCase						:
  							lowercase_     :     str
  
  
  
  
  
  class    _lowerCAmelCase						(						unittest.TestCase						):
  
  
  
  							def       _a   (      self   )							->							str:
  								_UpperCAmelCase =						get_tests_dir("fixtures/test_sentencepiece.model"   )
  								_UpperCAmelCase =						get_tests_dir("fixtures/test_sentencepiece_with_bytefallback.model"   )
  
  								_UpperCAmelCase =						FakeOriginalTokenizer(vocab_file=a_   )
  
  								with warnings.catch_warnings(record=a_   ) as w:
  									_UpperCAmelCase =						SpmConverter(a_   )
  								self.assertEqual(len(a_   ) ,						0   )
  
  								_UpperCAmelCase =						FakeOriginalTokenizer(vocab_file=a_   )
  
  								with warnings.catch_warnings(record=a_   ) as w:
  									_UpperCAmelCase =						SpmConverter(a_   )
  								self.assertEqual(len(a_   ) ,						1   )
  
  								self.assertIn(
  								    "The sentencepiece tokenizer that you are converting to a fast tokenizer uses the byte fallback option"
  								    " which is not implemented in the fast tokenizers." ,						str(w[0].message   ) ,						)
  
  
  
  
style_context: 
  """simple docstring"""
  import heapq
  
  
  
  
  def     __lowerCamelCase  (		UpperCamelCase__				,     UpperCamelCase__				,     UpperCamelCase__      ):
  
  
  	"""simple docstring"""
  
  
  
  
  
  
  	_UpperCAmelCase =						[(0, start)]  # cost from start node,end node
  	_UpperCAmelCase =						set()
  	while heap:
  		((_UpperCAmelCase) ,      (_UpperCAmelCase)) =						heapq.heappop(UpperCamelCase__      )
  		if u in visited:
  			continue
  		visited.add(UpperCamelCase__      )
  		if u == end:
  			return cost
  		for v, c in graph[u]:
  			if v in visited:
  				continue
  			_UpperCAmelCase =						cost + c
  			heapq.heappush(UpperCamelCase__				,     (next_item, v)      )
  	return -1
  
  
  __magic_name__		       =				{
      '''A''': [['''B''', 2], ['''C''', 5]],
      '''B''': [['''A''', 2], ['''D''', 3], ['''E''', 1], ['''F''', 1]],
      '''C''': [['''A''', 5], ['''F''', 3]],
      '''D''': [['''B''', 3]],
      '''E''': [['''B''', 4], ['''F''', 3]],
      '''F''': [['''C''', 3], ['''E''', 3]],
  }
  __magic_name__		       =				{
      '''B''': [['''C''', 1]],
      '''C''': [['''D''', 1]],
      '''D''': [['''F''', 1]],
      '''E''': [['''B''', 1], ['''F''', 3]],
      '''F''': [],
  }
  __magic_name__		       =				{
      '''B''': [['''C''', 1]],
      '''C''': [['''D''', 1]],
      '''D''': [['''F''', 1]],
      '''E''': [['''B''', 1], ['''G''', 2]],
      '''F''': [],
      '''G''': [['''F''', 1]],
  }
  
  __magic_name__		       =				dijkstra(G, '''E''', '''C''')
  print(short_distance)  # E -- 3 --> F -- 3 --> C == 6
  
  __magic_name__		       =				dijkstra(Ga, '''E''', '''F''')
  print(short_distance)  # E -- 3 --> F == 3
  
  __magic_name__		       =				dijkstra(Ga, '''E''', '''F''')
  print(short_distance)  # E -- 2 --> G -- 1 --> F == 3
  
  if __name__ == "__main__":
  			import doctest
  
  			doctest.testmod()
  
  
  
  
  