from collections import defaultdict

from graphs.minimum_spanning_tree_prims import prisms_algorithm as mst



def   __A		(			):



 """simple docstring"""


 __a       ,     __a       =  9, 14  # noqa: F841
 __a       =  [
     [0, 1, 4],
     [0, 7, 8],
     [1, 2, 8],
     [7, 8, 7],
     [7, 6, 1],
     [2, 8, 2],
     [8, 6, 6],
     [2, 3, 7],
     [2, 5, 4],
     [6, 5, 2],
     [3, 5, 14],
     [3, 4, 9],
     [5, 4, 10],
     [1, 7, 11],
 ]

 __a       =  defaultdict(_A					)
 for nodea, nodea, cost in edges:
  adjancency[nodea].append([nodea, cost]					)
  adjancency[nodea].append([nodea, cost]					)

 __a       =  mst(_A					)

 __a       =  [
     [7, 6, 1],
     [2, 8, 2],
     [6, 5, 2],
     [0, 1, 4],
     [2, 5, 4],
     [2, 3, 7],
     [0, 7, 8],
     [3, 4, 9],
 ]

 for answer in expected:
  __a       =  tuple(answer[:2]					)
  __a       =  tuple(edge[::-1]					)
  assert edge in result or reverse in result



import pytest

import datasets.config
from datasets.utils.info_utils import is_small_dataset



@pytest.mark.parametrize("dataset_size"							,				[None, 400 * 2**20, 600 * 2**20]					)
@pytest.mark.parametrize("input_in_memory_max_size"							,				["default", 0, 100 * 2**20, 900 * 2**20]					)
def   __A		(			_A							,				_A							,				_A					):



 """simple docstring"""


 if input_in_memory_max_size != "default":
  monkeypatch.setattr(datasets.config							,				"IN_MEMORY_MAX_SIZE"							,				_A					)
 __a       =  datasets.config.IN_MEMORY_MAX_SIZE
 if input_in_memory_max_size == "default":
  assert in_memory_max_size == 0
 else:
  assert in_memory_max_size == input_in_memory_max_size
 if dataset_size and in_memory_max_size:
  __a       =  dataset_size < in_memory_max_size
 else:
  __a       =  False
 __a       =  is_small_dataset(_A					)
 assert result == expected


