





def _a				(	lowerCamelCase:   List[Any] )	->						Any:







      '''simple docstring'''






      return [
          {
              0: [1, 2],
              1: [0, 2],
              2: [0, 1, 3, 5],
              3: [2, 4],
              4: [3],
              5: [2, 6, 8],
              6: [5, 7],
              7: [6, 8],
              8: [5, 7],
          },
          {
              0: [6],
              1: [9],
              2: [4, 5],
              3: [4],
              4: [2, 3],
              5: [2],
              6: [0, 7],
              7: [6],
              8: [],
              9: [1],
          },
          {
              0: [4],
              1: [6],
              2: [],
              3: [5, 6, 7],
              4: [0, 6],
              5: [3, 8, 9],
              6: [1, 3, 4, 7],
              7: [3, 6, 8, 9],
              8: [5, 7],
              9: [5, 7],
          },
          {
              0: [1, 3],
              1: [0, 2, 4],
              2: [1, 3, 4],
              3: [0, 2, 4],
              4: [1, 2, 3],
          },
      ][index]



def _a				(	lowerCamelCase:   dict[int, list[int]] )	->						list[tuple[int, int]]:







      '''simple docstring'''






      __A          =				0
      __A          =				len(lowerCamelCase )  # No of vertices in graph
      __A          =				[0] * n
      __A          =				[False] * n

      def dfs(lowerCamelCase:   Union[str, Any]					,				lowerCamelCase:   Dict					,				lowerCamelCase:   Tuple					,				lowerCamelCase:   Union[str, Any] ):
            __A          =				True
            __A          =				id_
            id_ += 1
            for to in graph[at]:
                  if to == parent:
                        pass
                  elif not visited[to]:
                        dfs(lowerCamelCase					,				lowerCamelCase					,				lowerCamelCase					,				id_ )
                        __A          =				min(low[at]					,				low[to] )
                        if id_ <= low[to]:
                              bridges.append((at, to) if at < to else (to, at) )
                  else:
                        # This edge is a back edge and cannot be a bridge
                        __A          =				min(low[at]					,				low[to] )

      __A          =				[]
      for i in range(lowerCamelCase ):
            if not visited[i]:
                  dfs(lowerCamelCase					,				-1					,				lowerCamelCase					,				id_ )
      return bridges


if __name__ == "__main__":
       import doctest

       doctest.testmod()












import requests

snake_case__					:							int													=     'https://newsapi.org/v1/articles?source=bbc-news&sortBy=top&apiKey='



def _a				(	lowerCamelCase:   str )	->						None:







      '''simple docstring'''






      __A          =				requests.get(_NEWS_API + bbc_news_api_key ).json()
      # each article in the list is a dict
      for i, article in enumerate(bbc_news_page['''articles''']					,				1 ):
            print(F"""{i}.) {article['title']}""" )


if __name__ == "__main__":
       fetch_bbc_news(bbc_news_api_key='<Your BBC News API key goes here>')





