




from __future__ import annotations

import time

lowerCAmelCase_						=			list[tuple[int, int]]

lowerCAmelCase_						=			[
    [0, 0, 0, 0, 0, 0, 0],
    [0, 1, 0, 0, 0, 0, 0],  # 0 are free path whereas 1's are obstacles
    [0, 0, 0, 0, 0, 0, 0],
    [0, 0, 1, 0, 0, 0, 0],
    [1, 0, 1, 0, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0],
    [0, 0, 0, 0, 1, 0, 0],
]

lowerCAmelCase_						=			[[-1, 0], [0, -1], [1, 0], [0, 1]]  # up, left, down, right
class 						_A :






  def __init__(  self		:     List[Any]				,						_A		:     int				,						_A		:     int				,						_A		:     int				,						_A		:     int				,						_A		:     Node | None				)		->   str:






       """simple docstring"""







       lowercase :       Any       =			pos_x
       lowercase :       Union[str, Any]       =			pos_y
       lowercase :       int       =			(pos_y, pos_x)
       lowercase :       List[str]       =			goal_x
       lowercase :       Optional[int]       =			goal_y
       lowercase :       Union[str, Any]       =			parent


class 						_A :






  def __init__(  self		:     Optional[Any]				,						_A		:     tuple[int, int]				,						_A		:     tuple[int, int]				)		->   List[Any]:






       """simple docstring"""







       lowercase :       int       =			Node(start[1]				,						start[0]				,						goal[1]				,						goal[0]				,						_A				)
       lowercase :       int       =			Node(goal[1]				,						goal[0]				,						goal[1]				,						goal[0]				,						_A				)

       lowercase :       List[str]       =			[self.start]
       lowercase :       Optional[int]       =			False






  def  __a      (  self		:     Dict				)		->   Path | None:






       """simple docstring"""







       while self.node_queue:
            lowercase :       Optional[Any]       =			self.node_queue.pop(0				)

            if current_node.pos == self.target.pos:
                 lowercase :       int       =			True
                 return self.retrace_path(_A				)

            lowercase :       Union[str, Any]       =			self.get_successors(_A				)

            for node in successors:
                 self.node_queue.append(_A				)

       if not self.reached:
            return [self.start.pos]
       return None






  def  __a      (  self		:     str				,						_A		:     Node				)		->   list[Node]:






       """simple docstring"""







       lowercase :       Union[str, Any]       =			[]
       for action in delta:
            lowercase :       List[str]       =			parent.pos_x + action[1]
            lowercase :       str       =			parent.pos_y + action[0]
            if not (0 <= pos_x <= len(grid[0]				) - 1 and 0 <= pos_y <= len(_A				) - 1):
                 continue

            if grid[pos_y][pos_x] != 0:
                 continue

            successors.append(
                Node(_A				,						_A				,						self.target.pos_y				,						self.target.pos_x				,						_A				)				)
       return successors






  def  __a      (  self		:     Any				,						_A		:     Node | None				)		->   Path:






       """simple docstring"""







       lowercase :       Optional[int]       =			node
       lowercase :       Dict       =			[]
       while current_node is not None:
            path.append((current_node.pos_y, current_node.pos_x)				)
            lowercase :       Tuple       =			current_node.parent
       path.reverse()
       return path


class 						_A :






  def __init__(  self		:     Optional[int]				,						_A		:     List[str]				,						_A		:     List[str]				)		->   int:






       """simple docstring"""







       lowercase :       str       =			BreadthFirstSearch(_A				,						_A				)
       lowercase :       Optional[Any]       =			BreadthFirstSearch(_A				,						_A				)
       lowercase :       List[str]       =			False






  def  __a      (  self		:     Tuple				)		->   Path | None:






       """simple docstring"""







       while self.fwd_bfs.node_queue or self.bwd_bfs.node_queue:
            lowercase :       str       =			self.fwd_bfs.node_queue.pop(0				)
            lowercase :       Tuple       =			self.bwd_bfs.node_queue.pop(0				)

            if current_bwd_node.pos == current_fwd_node.pos:
                 lowercase :       Optional[Any]       =			True
                 return self.retrace_bidirectional_path(
                     _A				,						_A				)

            lowercase :       Optional[int]       =			current_bwd_node
            lowercase :       Optional[int]       =			current_fwd_node

            lowercase :       Union[str, Any]       =			{
                self.fwd_bfs: self.fwd_bfs.get_successors(_A				),
                self.bwd_bfs: self.bwd_bfs.get_successors(_A				),
            }

            for bfs in [self.fwd_bfs, self.bwd_bfs]:
                 for node in successors[bfs]:
                      bfs.node_queue.append(_A				)

       if not self.reached:
            return [self.fwd_bfs.start.pos]
       return None






  def  __a      (  self		:     List[Any]				,						_A		:     Node				,						_A		:     Node				)		->   Path:






       """simple docstring"""







       lowercase :       Optional[Any]       =			self.fwd_bfs.retrace_path(_A				)
       lowercase :       Union[str, Any]       =			self.bwd_bfs.retrace_path(_A				)
       bwd_path.pop()
       bwd_path.reverse()
       lowercase :       Optional[int]       =			fwd_path + bwd_path
       return path


if __name__ == "__main__":
 # all coordinates are given in format [y,x]
 import doctest

 doctest.testmod()
 lowerCAmelCase_						=			(0, 0)
 lowerCAmelCase_						=			(len(grid) - 1, len(grid[0]) - 1)
 for elem in grid:
  print(elem)

 lowerCAmelCase_						=			time.time()
 lowerCAmelCase_						=			BreadthFirstSearch(init, goal)
 lowerCAmelCase_						=			bfs.search()
 lowerCAmelCase_						=			time.time() - start_bfs_time

 print('Unidirectional BFS computation time : ', bfs_time)

 lowerCAmelCase_						=			time.time()
 lowerCAmelCase_						=			BidirectionalBreadthFirstSearch(init, goal)
 lowerCAmelCase_						=			bd_bfs.search()
 lowerCAmelCase_						=			time.time() - start_bd_bfs_time

 print('Bidirectional BFS computation time : ', bd_bfs_time)





from sklearn.metrics import mean_squared_error

import datasets


lowerCAmelCase_						=			'\\n@article{scikit-learn,\n title={Scikit-learn: Machine Learning in {P}ython},\n author={Pedregosa, F. and Varoquaux, G. and Gramfort, A. and Michel, V.\n         and Thirion, B. and Grisel, O. and Blondel, M. and Prettenhofer, P.\n         and Weiss, R. and Dubourg, V. and Vanderplas, J. and Passos, A. and\n         Cournapeau, D. and Brucher, M. and Perrot, M. and Duchesnay, E.},\n journal={Journal of Machine Learning Research},\n volume={12},\n pages={2825--2830},\n year={2011}\n}\n'

lowerCAmelCase_						=			'\\nMean Squared Error(MSE) is the average of the square of difference between the predicted\nand actual values.\n'


lowerCAmelCase_						=			'\nArgs:\n    predictions: array-like of shape (n_samples,) or (n_samples, n_outputs)\n        Estimated target values.\n    references: array-like of shape (n_samples,) or (n_samples, n_outputs)\n        Ground truth (correct) target values.\n    sample_weight: array-like of shape (n_samples,), default=None\n        Sample weights.\n    multioutput: {"raw_values", "uniform_average"} or array-like of shape (n_outputs,), default="uniform_average"\n        Defines aggregating of multiple output values. Array-like value defines weights used to average errors.\n\n        "raw_values" : Returns a full set of errors in case of multioutput input.\n\n        "uniform_average" : Errors of all outputs are averaged with uniform weight.\n\n    squared : bool, default=True\n        If True returns MSE value, if False returns RMSE (Root Mean Squared Error) value.\n\nReturns:\n    mse : mean squared error.\nExamples:\n\n    >>> mse_metric = datasets.load_metric("mse")\n    >>> predictions = [2.5, 0.0, 2, 8]\n    >>> references = [3, -0.5, 2, 7]\n    >>> results = mse_metric.compute(predictions=predictions, references=references)\n    >>> print(results)\n    {\'mse\': 0.375}\n    >>> rmse_result = mse_metric.compute(predictions=predictions, references=references, squared=False)\n    >>> print(rmse_result)\n    {\'mse\': 0.6123724356957945}\n\n    If you\'re using multi-dimensional lists, then set the config as follows :\n\n    >>> mse_metric = datasets.load_metric("mse", "multilist")\n    >>> predictions = [[0.5, 1], [-1, 1], [7, -6]]\n    >>> references = [[0, 2], [-1, 2], [8, -5]]\n    >>> results = mse_metric.compute(predictions=predictions, references=references)\n    >>> print(results)\n    {\'mse\': 0.7083333333333334}\n    >>> results = mse_metric.compute(predictions=predictions, references=references, multioutput=\'raw_values\')\n    >>> print(results) # doctest: +NORMALIZE_WHITESPACE\n    {\'mse\': array([0.41666667, 1. ])}\n'
@datasets.utils.file_utils.add_start_docstrings(_DESCRIPTION      ,       _KWARGS_DESCRIPTION				)
class 						_A (  datasets.Metric				):






  def  __a      (  self		:     List[Any]				)		->   Optional[Any]:






       """simple docstring"""







       return datasets.MetricInfo(
           description=_DESCRIPTION				,						citation=_CITATION				,						inputs_description=_KWARGS_DESCRIPTION				,						features=datasets.Features(self._get_feature_types()				)				,						reference_urls=[
               '''https://scikit-learn.org/stable/modules/generated/sklearn.metrics.mean_squared_error.html'''
           ]				,						)






  def  __a      (  self		:     List[Any]				)		->   int:






       """simple docstring"""







       if self.config_name == "multilist":
            return {
                "predictions": datasets.Sequence(datasets.Value('''float'''				)				),
                "references": datasets.Sequence(datasets.Value('''float'''				)				),
            }
       else:
            return {
                "predictions": datasets.Value('''float'''				),
                "references": datasets.Value('''float'''				),
            }






  def  __a      (  self		:     Any				,						_A		:     Dict				,						_A		:     Any				,						_A		:     Any=None				,						_A		:     Any="uniform_average"				,						_A		:     Optional[Any]=True				)		->   Dict:






       """simple docstring"""







       lowercase :       Any       =			mean_squared_error(
           _A				,						_A				,						sample_weight=_A				,						multioutput=_A				,						squared=_A				)

       return {"mse": mse}