

'''simple docstring'''

def 					__UpperCamelCase				(						lowercase__    :	dict			):






     '''simple docstring'''





     __lowercase      		=set()
     # edges = list of graph's edges
     __lowercase      		=get_edges(lowercase__			)

     # 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(lowercase__			)
          chosen_vertices.add(lowercase__			)
          for edge in edges.copy():
               if from_node in edge or to_node in edge:
                    edges.discard(lowercase__			)
     return chosen_vertices

def 					__UpperCamelCase				(						lowercase__    :	dict			):






     '''simple docstring'''





     __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'''

def 					__UpperCamelCase				(						lowercase__    :	List[str],       lowercase__    :	Tuple			):






     '''simple docstring'''





     __lowercase      		=[0 for i in range(r + 1			)]
     # nc0 = 1
     __lowercase      		=1
     for i in range(1,       n + 1			):
          # to compute current row from previous row.
          __lowercase      		=min(lowercase__,       lowercase__			)
          while j > 0:
               c[j] += c[j - 1]
               j -= 1
     return c[r]







print(binomial_coefficient(n=10, r=5))


