
lowercase_											=	{0: [1, 2], 1: [0, 3], 2: [0], 3: [1], 4: [5, 6], 5: [4, 6], 6: [4, 5]}

lowercase_											=	{0: [1, 2, 3], 1: [0, 3], 2: [0], 3: [0, 1], 4: [], 5: []}


def     a__			(    snake_case   ,	snake_case   ,	snake_case    ):





  """simple docstring"""
  __SCREAMING_SNAKE_CASE     :					int			=						True
  __SCREAMING_SNAKE_CASE     :					Tuple			=						[]

  for neighbour in graph[vert]:
    if not visited[neighbour]:
      connected_verts += dfs(snake_case   ,	snake_case   ,	snake_case    )

  return [vert, *connected_verts]


def     a__			(    snake_case    ):





  """simple docstring"""
  __SCREAMING_SNAKE_CASE     :					List[str]			=						len(snake_case    )
  __SCREAMING_SNAKE_CASE     :					Optional[Any]			=						graph_size * [False]
  __SCREAMING_SNAKE_CASE     :					Any			=						[]

  for i in range(snake_case    ):
    if not visited[i]:
      __SCREAMING_SNAKE_CASE     :					Optional[Any]			=						dfs(snake_case   ,	snake_case   ,	snake_case    )
      components_list.append(snake_case    )

  return components_list


if __name__ == "__main__":
   import doctest

   doctest.testmod()


from collections import defaultdict


def     a__			(    snake_case    ):





  """simple docstring"""
  __SCREAMING_SNAKE_CASE     :					defaultdict[str, int]			=						defaultdict(snake_case    )
  # Creating a dictionary containing count of each word
  for word in sentence.split():
    occurrence[word] += 1
  return occurrence


if __name__ == "__main__":
   for word, count in word_occurrence("""INPUT STRING""").items():
      print(f'''{word}: {count}''')
