





"""simple docstring"""


from .data_collator import (
    DataCollatorForLanguageModeling,
    DataCollatorForPermutationLanguageModeling,
    DataCollatorForSeqaSeq,
    DataCollatorForSOP,
    DataCollatorForTokenClassification,
    DataCollatorForWholeWordMask,
    DataCollatorWithPadding,
    DefaultDataCollator,
    default_data_collator,
)
from .metrics import glue_compute_metrics, xnli_compute_metrics
from .processors import (
    DataProcessor,
    InputExample,
    InputFeatures,
    SingleSentenceClassificationProcessor,
    SquadExample,
    SquadFeatures,
    SquadVaProcessor,
    SquadVaProcessor,
    glue_convert_examples_to_features,
    glue_output_modes,
    glue_processors,
    glue_tasks_num_labels,
    squad_convert_examples_to_features,
    xnli_output_modes,
    xnli_processors,
    xnli_tasks_num_labels,
)







"""simple docstring"""


def 					lowercase__    (					lowercase_			)					->		set:




      """simple docstring"""

      _UpperCamelCase      :	Union[str, Any]						=       set()
      # edges = list of graph's edges
      _UpperCamelCase      :	Union[str, Any]						=       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:
            _UpperCamelCase,  _UpperCamelCase      :	str						=       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 					lowercase__    (					lowercase_			)					->		set:




      """simple docstring"""

      _UpperCamelCase      :	List[str]						=       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)}")
