'''simple docstring'''


def   A_      (       SCREAMING_SNAKE_CASE_						)			->set:
  lowercase_     =       set()
  # edges = list of graph's edges
  lowercase_     =       get_edges(SCREAMING_SNAKE_CASE_						)

  # While there are still elements in edges list, take an arbitrary edge
  # (from_node, to_node) and add his extremity to chosen_vertices and then
  # remove all arcs adjacent to the from_node and to_node
  while edges:
    lowercase_     ,	lowercase_     =       edges.pop()
    chosen_vertices.add(SCREAMING_SNAKE_CASE_						)
    chosen_vertices.add(SCREAMING_SNAKE_CASE_						)
    for edge in edges.copy():
      if from_node in edge or to_node in edge:
        edges.discard(SCREAMING_SNAKE_CASE_						)
  return chosen_vertices

def   A_      (       SCREAMING_SNAKE_CASE_						)			->set:
  lowercase_     =       set()
  for from_node, to_nodes in graph.items():
    for to_node in to_nodes:
      edges.add((from_node, to_node)						)
  return edges


if __name__ == "__main__":
       import doctest

       doctest.testmod()

       # graph = {0: [1, 3], 1: [0, 3], 2: [0, 3, 4], 3: [0, 1, 2], 4: [2, 3]}
       # print(f"Matching vertex cover:\n{matching_min_vertex_cover(graph)}")


'''simple docstring'''


import requests

__snake_case						  =		"""https://newsapi.org/v1/articles?source=bbc-news&sortBy=top&apiKey="""

def   A_      (       SCREAMING_SNAKE_CASE_						)			->None:
  # fetching a list of articles in json format
  lowercase_     =       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>""")

