

'''simple docstring'''







# Lint as: python3
# pylint: enable=line-too-long
# pylint: disable=g-import-not-at-top,g-bad-import-order,wrong-import-position

__lowerCamelCase						    =      '''2.13.1'''

import platform

import pyarrow
from packaging import version


if version.parse(platform.python_version()) < version.parse('''3.7'''):
      raise ImportWarning(
          '''To use `datasets`, Python>=3.7 is required, and the current version of Python doesn\'t match this condition.'''
      )

if version.parse(pyarrow.__version__).major < 8:
      raise ImportWarning(
          '''To use `datasets`, the module `pyarrow>=8.0.0` is required, and the current version of `pyarrow` doesn\'t match this condition.\n'''
          '''If you are running this in a Google Colab, you should probably just restart the runtime to use the right version of `pyarrow`.'''
      )

del platform
del pyarrow
del version

from .arrow_dataset import Dataset
from .arrow_reader import ReadInstruction
from .builder import ArrowBasedBuilder, BeamBasedBuilder, BuilderConfig, DatasetBuilder, GeneratorBasedBuilder
from .combine import concatenate_datasets, interleave_datasets
from .dataset_dict import DatasetDict, IterableDatasetDict
from .download import *
from .features import *
from .fingerprint import disable_caching, enable_caching, is_caching_enabled, set_caching_enabled
from .info import DatasetInfo, MetricInfo
from .inspect import (
    get_dataset_config_info,
    get_dataset_config_names,
    get_dataset_infos,
    get_dataset_split_names,
    inspect_dataset,
    inspect_metric,
    list_datasets,
    list_metrics,
)
from .iterable_dataset import IterableDataset
from .load import load_dataset, load_dataset_builder, load_from_disk, load_metric
from .metric import Metric
from .splits import (
    NamedSplit,
    NamedSplitAll,
    Split,
    SplitBase,
    SplitDict,
    SplitGenerator,
    SplitInfo,
    SubSplitInfo,
    percent,
)
from .tasks import *
from .utils import *
from .utils import logging


# deprecated modules
from datasets import arrow_dataset as _arrow_dataset  # isort:skip
from datasets import utils as _utils  # isort:skip
from datasets.utils import download_manager as _deprecated_download_manager  # isort:skip

__lowerCamelCase						    =      concatenate_datasets
__lowerCamelCase						    =      DownloadConfig
__lowerCamelCase						    =      DownloadManager
__lowerCamelCase						    =      DownloadMode
__lowerCamelCase						    =      DownloadConfig
__lowerCamelCase						    =      DownloadMode
__lowerCamelCase						    =      DownloadManager

del _arrow_dataset, _utils, _deprecated_download_manager



'''simple docstring'''







import heapq as hq
import math
from collections.abc import Iterator


class    A__ :



    def __init__(   self						,			UpperCamelCase__    )  -> Dict:





           '''simple docstring'''
           A_		   = str(id_    )
           A_		   = None
           A_		   = None
           A_		   = []
           A_		   = {}  # {vertex:distance}



    def __lt__(   self						,			UpperCamelCase__    )  -> Optional[int]:





           '''simple docstring'''
           return self.key < other.key



    def __repr__(   self    )  -> Dict:





           '''simple docstring'''
           return self.id



    def    snake_case_     (   self						,			UpperCamelCase__    )  -> Dict:





           '''simple docstring'''
           self.neighbors.append(UpperCamelCase__    )







    def    snake_case_     (   self						,			UpperCamelCase__						,			UpperCamelCase__    )  -> Optional[Any]:





           '''simple docstring'''
           A_		   = weight

def  UpperCAmelCase__      ( UpperCAmelCase__,    UpperCAmelCase__,    UpperCAmelCase__,    UpperCAmelCase__			)     ->     Optional[int]:
       # add the neighbors:
       graph[a - 1].add_neighbor(graph[b - 1]			)
       graph[b - 1].add_neighbor(graph[a - 1]			)
       # add the edges:
       graph[a - 1].add_edge(graph[b - 1],    UpperCAmelCase__			)
       graph[b - 1].add_edge(graph[a - 1],    UpperCAmelCase__			)
def  UpperCAmelCase__      ( UpperCAmelCase__,    UpperCAmelCase__			)     ->     list:
       A_		   = []
       for u in graph:
              A_		   = math.inf
              A_		   = None
       A_		   = 0
       A_		   = graph[:]
       while q:
              A_		   = min(UpperCAmelCase__			)
              q.remove(UpperCAmelCase__			)
              for v in u.neighbors:
                     if (v in q) and (u.edges[v.id] < v.key):
                            A_		   = u
                            A_		   = u.edges[v.id]
       for i in range(1,    len(UpperCAmelCase__			)			):
              a.append((int(graph[i].id			) + 1, int(graph[i].pi.id			) + 1)			)
       return a
def  UpperCAmelCase__      ( UpperCAmelCase__,    UpperCAmelCase__			)     ->     Iterator[tuple]:
       for u in graph:
              A_		   = math.inf
              A_		   = None
       A_		   = 0

       A_		   = list(UpperCAmelCase__			)
       hq.heapify(UpperCAmelCase__			)

       while h:
              A_		   = hq.heappop(UpperCAmelCase__			)
              for v in u.neighbors:
                     if (v in h) and (u.edges[v.id] < v.key):
                            A_		   = u
                            A_		   = u.edges[v.id]
                            hq.heapify(UpperCAmelCase__			)

       for i in range(1,    len(UpperCAmelCase__			)			):
              yield (int(graph[i].id			) + 1, int(graph[i].pi.id			) + 1)
def  UpperCAmelCase__      ( )     ->     None:
       pass


if __name__ == "__main__":
      import doctest

      doctest.testmod()
