code: 
  
  
  
  
  
  '''simple docstring'''
  
  
  
  
  
  
  
  import json
  import os
  import unittest
  
  from transformers import HerbertTokenizer, HerbertTokenizerFast
  from transformers.models.herbert.tokenization_herbert import VOCAB_FILES_NAMES
  from transformers.testing_utils import get_tests_dir, require_tokenizers, slow
  
  from ...test_tokenization_common import TokenizerTesterMixin
  
  
  
  
  
  @require_tokenizers
  class 					_UpperCAmelCase							(		lowerCAmelCase_			,      unittest.TestCase     ):
  		a     :     Any     						=HerbertTokenizer
  		a     :     Any     						=HerbertTokenizerFast
  		a     :     Union[str, Any]     						=True
  		def 						lowerCamelCase__    (						self    ):
  
  
  
  					'''simple docstring'''
  
  					super().setUp()
  
  					# Use a simpler test file without japanese/chinese characters
  					with open(f'{get_tests_dir()}/fixtures/sample_text_no_unicode.txt',encoding="""utf-8"""    ) as f_data:
  								__lowerCAmelCase      		=       f_data.read().replace("""\n\n""","""\n"""    ).strip()
  
  					__lowerCAmelCase      		=       [
  					    """<s>""",
  					    """</s>""",
  					    """l""",
  					    """o""",
  					    """w""",
  					    """e""",
  					    """r""",
  					    """s""",
  					    """t""",
  					    """i""",
  					    """d""",
  					    """n""",
  					    """w</w>""",
  					    """r</w>""",
  					    """t</w>""",
  					    """lo""",
  					    """low""",
  					    """er</w>""",
  					    """low</w>""",
  					    """lowest</w>""",
  					    """newer</w>""",
  					    """wider</w>""",
  					    """,</w>""",
  					    """<unk>""",
  					]
  					__lowerCAmelCase      		=       dict(zip(__SCREAMING_SNAKE_CASE,range(len(__SCREAMING_SNAKE_CASE    )    )    )    )
  					__lowerCAmelCase      		=       ["""l o 123""", """lo w 1456""", """e r</w> 1789""", """"""]
  
  					__lowerCAmelCase      		=       os.path.join(self.tmpdirname,VOCAB_FILES_NAMES["""vocab_file"""]    )
  					__lowerCAmelCase      		=       os.path.join(self.tmpdirname,VOCAB_FILES_NAMES["""merges_file"""]    )
  					with open(self.vocab_file,"""w"""    ) as fp:
  								fp.write(json.dumps(__SCREAMING_SNAKE_CASE    )    )
  					with open(self.merges_file,"""w"""    ) as fp:
  								fp.write("""\n""".join(__SCREAMING_SNAKE_CASE    )    )
  		def 						lowerCamelCase__    (						self,__SCREAMING_SNAKE_CASE    ):
  
  
  
  					'''simple docstring'''
  
  					__lowerCAmelCase      		=       """lower newer"""
  					__lowerCAmelCase      		=       """lower newer"""
  					return input_text, output_text
  		def 						lowerCamelCase__    (						self    ):
  
  
  
  					'''simple docstring'''
  
  					__lowerCAmelCase      		=       self.tokenizer_class(vocab_file=self.vocab_file,merges_file=self.merges_file    )
  
  					__lowerCAmelCase      		=       """lower"""
  					__lowerCAmelCase      		=       ["""low""", """er</w>"""]
  					__lowerCAmelCase      		=       tokenizer.tokenize(__SCREAMING_SNAKE_CASE    )
  					self.assertListEqual(__SCREAMING_SNAKE_CASE,__SCREAMING_SNAKE_CASE    )
  
  					__lowerCAmelCase      		=       tokens + ["""<unk>"""]
  					__lowerCAmelCase      		=       [16, 17, 23]
  					self.assertListEqual(tokenizer.convert_tokens_to_ids(__SCREAMING_SNAKE_CASE    ),__SCREAMING_SNAKE_CASE    )
  		def 						lowerCamelCase__    (						self    ):
  
  
  
  					'''simple docstring'''
  
  					if not self.test_rust_tokenizer:
  								return
  
  					__lowerCAmelCase      		=       self.get_tokenizer()
  					__lowerCAmelCase      		=       self.get_rust_tokenizer()
  
  					__lowerCAmelCase      		=       """lower,newer"""
  
  					__lowerCAmelCase      		=       tokenizer.tokenize(__SCREAMING_SNAKE_CASE    )
  					__lowerCAmelCase      		=       rust_tokenizer.tokenize(__SCREAMING_SNAKE_CASE    )
  					self.assertListEqual(__SCREAMING_SNAKE_CASE,__SCREAMING_SNAKE_CASE    )
  
  					__lowerCAmelCase      		=       tokenizer.encode(__SCREAMING_SNAKE_CASE,add_special_tokens=__SCREAMING_SNAKE_CASE    )
  					__lowerCAmelCase      		=       rust_tokenizer.encode(__SCREAMING_SNAKE_CASE,add_special_tokens=__SCREAMING_SNAKE_CASE    )
  					self.assertListEqual(__SCREAMING_SNAKE_CASE,__SCREAMING_SNAKE_CASE    )
  
  					__lowerCAmelCase      		=       self.get_rust_tokenizer()
  					__lowerCAmelCase      		=       tokenizer.encode(__SCREAMING_SNAKE_CASE    )
  					__lowerCAmelCase      		=       rust_tokenizer.encode(__SCREAMING_SNAKE_CASE    )
  					self.assertListEqual(__SCREAMING_SNAKE_CASE,__SCREAMING_SNAKE_CASE    )
  
  
  
  
  
  
  
  		@slow
  		def 						lowerCamelCase__    (						self    ):
  
  
  
  					'''simple docstring'''
  
  					__lowerCAmelCase      		=       self.tokenizer_class.from_pretrained("""allegro/herbert-base-cased"""    )
  
  					__lowerCAmelCase      		=       tokenizer.encode("""konstruowanie sekwencji""",add_special_tokens=__SCREAMING_SNAKE_CASE    )
  					__lowerCAmelCase      		=       tokenizer.encode("""konstruowanie wielu sekwencji""",add_special_tokens=__SCREAMING_SNAKE_CASE    )
  
  					__lowerCAmelCase      		=       tokenizer.build_inputs_with_special_tokens(__SCREAMING_SNAKE_CASE    )
  					__lowerCAmelCase      		=       tokenizer.build_inputs_with_special_tokens(__SCREAMING_SNAKE_CASE,__SCREAMING_SNAKE_CASE    )
  
  					assert encoded_sentence == [0] + text + [2]
  					assert encoded_pair == [0] + text + [2] + text_a + [2]
  
  
style_context: 
  
  
  
  
  
  '''simple docstring'''
  
  
  
  
  
  
  
  import math
  import sys
  
  
  
  
  
  class 					_UpperCAmelCase							:
  		def __init__(						self    ):
  
  
  
  					'''simple docstring'''
  
  					__lowerCAmelCase      		=       0
  					__lowerCAmelCase      		=       []
  					__lowerCAmelCase      		=       {}  # To store the pos of node in array
  		def 						lowerCamelCase__    (						self    ):
  
  
  
  					'''simple docstring'''
  
  					return self.cur_size == 0
  		def 						lowerCamelCase__    (						self,__SCREAMING_SNAKE_CASE    ):
  
  
  
  					'''simple docstring'''
  
  					__lowerCAmelCase      		=       self.left(__SCREAMING_SNAKE_CASE    )
  					__lowerCAmelCase      		=       self.right(__SCREAMING_SNAKE_CASE    )
  					if lc < self.cur_size and self.array(__SCREAMING_SNAKE_CASE    )[0] < self.array(__SCREAMING_SNAKE_CASE    )[0]:
  								__lowerCAmelCase      		=       lc
  					else:
  								__lowerCAmelCase      		=       idx
  					if rc < self.cur_size and self.array(__SCREAMING_SNAKE_CASE    )[0] < self.array(__SCREAMING_SNAKE_CASE    )[0]:
  								__lowerCAmelCase      		=       rc
  					if smallest != idx:
  								self.swap(__SCREAMING_SNAKE_CASE,__SCREAMING_SNAKE_CASE    )
  								self.min_heapify(__SCREAMING_SNAKE_CASE    )
  		def 						lowerCamelCase__    (						self,__SCREAMING_SNAKE_CASE    ):
  
  
  
  					'''simple docstring'''
  
  					__lowerCAmelCase      		=       self.cur_size
  					self.cur_size += 1
  					self.array.append((sys.maxsize, tup[1])    )
  					self.decrease_key((sys.maxsize, tup[1]),tup[0]    )
  		def 						lowerCamelCase__    (						self    ):
  
  
  
  					'''simple docstring'''
  
  					__lowerCAmelCase      		=       self.array[0][1]
  					__lowerCAmelCase      		=       self.array[self.cur_size - 1]
  					self.cur_size -= 1
  					self.min_heapify(1    )
  					del self.pos[min_node]
  					return min_node
  		def 						lowerCamelCase__    (						self,__SCREAMING_SNAKE_CASE    ):
  
  
  
  					'''simple docstring'''
  
  					return 2 * i + 1
  		def 						lowerCamelCase__    (						self,__SCREAMING_SNAKE_CASE    ):
  
  
  
  					'''simple docstring'''
  
  					return 2 * i + 2
  		def 						lowerCamelCase__    (						self,__SCREAMING_SNAKE_CASE    ):
  
  
  
  					'''simple docstring'''
  
  					return math.floor(i / 2    )
  		def 						lowerCamelCase__    (						self,__SCREAMING_SNAKE_CASE,__SCREAMING_SNAKE_CASE    ):
  
  
  
  					'''simple docstring'''
  
  					__lowerCAmelCase      		=       j
  					__lowerCAmelCase      		=       i
  					__lowerCAmelCase      		=       self.array[i]
  					__lowerCAmelCase      		=       self.array[j]
  					__lowerCAmelCase      		=       temp
  
  
  
  
  
  
  
  		def 						lowerCamelCase__    (						self,__SCREAMING_SNAKE_CASE,__SCREAMING_SNAKE_CASE    ):
  
  
  
  					'''simple docstring'''
  
  					__lowerCAmelCase      		=       self.pos[tup[1]]
  					# assuming the new_d is atmost old_d
  					__lowerCAmelCase      		=       (new_d, tup[1])
  					while idx > 0 and self.array[self.par(__SCREAMING_SNAKE_CASE    )][0] > self.array[idx][0]:
  								self.swap(__SCREAMING_SNAKE_CASE,self.par(__SCREAMING_SNAKE_CASE    )    )
  								__lowerCAmelCase      		=       self.par(__SCREAMING_SNAKE_CASE    )
  
  
  
  
  
  class 					_UpperCAmelCase							:
  		def __init__(						self,__SCREAMING_SNAKE_CASE    ):
  
  
  
  					'''simple docstring'''
  
  					__lowerCAmelCase      		=       {}  # To store graph: u -> (v,w)
  					__lowerCAmelCase      		=       num  # Number of nodes in graph
  					# To store the distance from source vertex
  					__lowerCAmelCase      		=       [0] * self.num_nodes
  					__lowerCAmelCase      		=       [-1] * self.num_nodes  # To store the path
  		def 						lowerCamelCase__    (						self,__SCREAMING_SNAKE_CASE,__SCREAMING_SNAKE_CASE,__SCREAMING_SNAKE_CASE    ):
  
  
  
  					'''simple docstring'''
  
  					if u in self.adjList:
  								self.adjList[u].append((v, w)    )
  					else:
  								__lowerCAmelCase      		=       [(v, w)]
  
  					# Assuming undirected graph
  					if v in self.adjList:
  								self.adjList[v].append((u, w)    )
  					else:
  								__lowerCAmelCase      		=       [(u, w)]
  		def 						lowerCamelCase__    (						self    ):
  
  
  
  					'''simple docstring'''
  
  					for u in self.adjList:
  								print(__SCREAMING_SNAKE_CASE,"""->""",""" -> """.join(str(f'{v}({w})'    ) for v, w in self.adjList[u]    )    )
  		def 						lowerCamelCase__    (						self,__SCREAMING_SNAKE_CASE    ):
  
  
  
  					'''simple docstring'''
  
  					__lowerCAmelCase      		=       [-1] * self.num_nodes
  					# src is the source node
  					__lowerCAmelCase      		=       0
  					__lowerCAmelCase      		=       PriorityQueue()
  					q.insert((0, src)    )  # (dist from src, node)
  					for u in self.adjList:
  								if u != src:
  											__lowerCAmelCase      		=       sys.maxsize  # Infinity
  											__lowerCAmelCase      		=       -1
  
  					while not q.is_empty():
  								__lowerCAmelCase      		=       q.extract_min()  # Returns node with the min dist from source
  								# Update the distance of all the neighbours of u and
  								# if their prev dist was INFINITY then push them in Q
  								for v, w in self.adjList[u]:
  											__lowerCAmelCase      		=       self.dist[u] + w
  											if self.dist[v] > new_dist:
  														if self.dist[v] == sys.maxsize:
  																	q.insert((new_dist, v)    )
  														else:
  																	q.decrease_key((self.dist[v], v),__SCREAMING_SNAKE_CASE    )
  														__lowerCAmelCase      		=       new_dist
  														__lowerCAmelCase      		=       u
  
          # Show the shortest distances from src
  					self.show_distances(__SCREAMING_SNAKE_CASE    )
  		def 						lowerCamelCase__    (						self,__SCREAMING_SNAKE_CASE    ):
  
  
  
  					'''simple docstring'''
  
  					print(f'Distance from node: {src}'    )
  					for u in range(self.num_nodes    ):
  								print(f'Node {u} has distance: {self.dist[u]}'    )
  
  
  
  
  
  
  
  		def 						lowerCamelCase__    (						self,__SCREAMING_SNAKE_CASE,__SCREAMING_SNAKE_CASE    ):
  
  
  
  					'''simple docstring'''
  
  					__lowerCAmelCase      		=       []
  					__lowerCAmelCase      		=       0
  					__lowerCAmelCase      		=       dest
  					# Backtracking from dest to src
  					while self.par[temp] != -1:
  								path.append(__SCREAMING_SNAKE_CASE    )
  								if temp != src:
  											for v, w in self.adjList[temp]:
  														if v == self.par[temp]:
  																	cost += w
  																	break
  								__lowerCAmelCase      		=       self.par[temp]
  					path.append(__SCREAMING_SNAKE_CASE    )
  					path.reverse()
  
  					print(f'----Path to reach {dest} from {src}----'    )
  					for u in path:
  								print(f'{u}',end=""" """    )
  								if u != dest:
  											print("""-> """,end=""""""    )
  
  					print("""\nTotal cost of path: """,__SCREAMING_SNAKE_CASE    )
  
  
  if __name__ == "__main__":
  	_a      :				str											=					Graph(9)
  	graph.add_edge(0, 1, 4)
  	graph.add_edge(0, 7, 8)
  	graph.add_edge(1, 2, 8)
  	graph.add_edge(1, 7, 1_1)
  	graph.add_edge(2, 3, 7)
  	graph.add_edge(2, 8, 2)
  	graph.add_edge(2, 5, 4)
  	graph.add_edge(3, 4, 9)
  	graph.add_edge(3, 5, 1_4)
  	graph.add_edge(4, 5, 1_0)
  	graph.add_edge(5, 6, 2)
  	graph.add_edge(6, 7, 1)
  	graph.add_edge(6, 8, 6)
  	graph.add_edge(7, 8, 7)
  	graph.show_graph()
  	graph.dijkstra(0)
  	graph.show_path(0, 4)
  
  # OUTPUT
  # 0 -> 1(4) -> 7(8)
  # 1 -> 0(4) -> 2(8) -> 7(11)
  # 7 -> 0(8) -> 1(11) -> 6(1) -> 8(7)
  # 2 -> 1(8) -> 3(7) -> 8(2) -> 5(4)
  # 3 -> 2(7) -> 4(9) -> 5(14)
  # 8 -> 2(2) -> 6(6) -> 7(7)
  # 5 -> 2(4) -> 3(14) -> 4(10) -> 6(2)
  # 4 -> 3(9) -> 5(10)
  # 6 -> 5(2) -> 7(1) -> 8(6)
  # Distance from node: 0
  # Node 0 has distance: 0
  # Node 1 has distance: 4
  # Node 2 has distance: 12
  # Node 3 has distance: 19
  # Node 4 has distance: 21
  # Node 5 has distance: 11
  # Node 6 has distance: 9
  # Node 7 has distance: 8
  # Node 8 has distance: 14
  # ----Path to reach 4 from 0----
  # 0 -> 7 -> 6 -> 5 -> 4
  # Total cost of path:  21
  
  