






'''simple docstring'''







def 						_UpperCamelCase							(     snake_case__							,			snake_case__							,			snake_case__							,			snake_case__							):
      __A		   =      int((lower_bound + upper_bound) // 2							)
      if array[r] == value:
            return r
      if lower_bound >= upper_bound:
            return -1
      if array[r] < value:
            return binary_search(snake_case__							,			r + 1							,			snake_case__							,			snake_case__							)
      else:
            return binary_search(snake_case__							,			snake_case__							,			r - 1							,			snake_case__							)


def 						_UpperCamelCase							(     snake_case__							,			snake_case__							):
      __A		   =      0
      if matrix[index][0] == value:
            return [index, 0]
      while index < len(snake_case__							) and matrix[index][0] < value:
            __A		   =      binary_search(matrix[index]							,			0							,			len(matrix[index]							) - 1							,			snake_case__							)
            if r != -1:
                  return [index, r]
            index += 1
      return [-1, -1]


if __name__ == "__main__":
       import doctest

       doctest.testmod()










'''simple docstring'''







from __future__ import annotations

from queue import Queue






class 					a__    :
     '''simple docstring'''







     def __init__(self    :	Any					)  ->       None:
           __A		   =      {}






     def     _UpperCamelCase   (self    :	Optional[int]					)  ->       None:
           for i in self.vertices:
                 print(lowercase__				,				" : "				,				" -> ".join([str(lowercase__					) for j in self.vertices[i]]					)					)






     def     _UpperCamelCase   (self    :	Union[str, Any]				,				lowercase__    :	int				,				lowercase__    :	int					)  ->       None:
           if from_vertex in self.vertices:
                 self.vertices[from_vertex].append(lowercase__					)
           else:
                 __A		   =      [to_vertex]






     def     _UpperCamelCase   (self    :	Optional[int]				,				lowercase__    :	int					)  ->       set[int]:
           __A		   =      set()

           # create a first in first out queue to store all the vertices for BFS
           __A		   =      Queue()

           # mark the source node as visited and enqueue it
           visited.add(lowercase__					)
           queue.put(lowercase__					)

           while not queue.empty():
                 __A		   =      queue.get()

                 # loop through all adjacent vertex and enqueue it if not yet visited
                 for adjacent_vertex in self.vertices[vertex]:
                       if adjacent_vertex not in visited:
                             queue.put(lowercase__					)
                             visited.add(lowercase__					)
           return visited


if __name__ == "__main__":
       from doctest import testmod

       testmod(verbose=True)

       __A      :       Dict      =	Graph()
       g.add_edge(0, 1)
       g.add_edge(0, 2)
       g.add_edge(1, 2)
       g.add_edge(2, 0)
       g.add_edge(2, 3)
       g.add_edge(3, 3)

       g.print_graph()
       # 0  :  1 -> 2
       # 1  :  2
       # 2  :  0 -> 3
       # 3  :  3

       assert sorted(g.bfs(2)) == [0, 1, 2, 3]


