



# Copyright 2023 The HuggingFace Team. All rights reserved.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
#     http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_torch_available


UpperCAmelCase__       =	{
    "configuration_mgp_str": ["MGP_STR_PRETRAINED_CONFIG_ARCHIVE_MAP", "MgpstrConfig"],
    "processing_mgp_str": ["MgpstrProcessor"],
    "tokenization_mgp_str": ["MgpstrTokenizer"],
}

try:
							if not is_torch_available():
														raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
							pass
else:
							UpperCAmelCase__       =	[
							    "MGP_STR_PRETRAINED_MODEL_ARCHIVE_LIST",
							    "MgpstrModel",
							    "MgpstrPreTrainedModel",
							    "MgpstrForSceneTextRecognition",
							]

if TYPE_CHECKING:
							from .configuration_mgp_str import MGP_STR_PRETRAINED_CONFIG_ARCHIVE_MAP, MgpstrConfig
							from .processing_mgp_str import MgpstrProcessor
							from .tokenization_mgp_str import MgpstrTokenizer

							try:
														if not is_torch_available():
																					raise OptionalDependencyNotAvailable()
							except OptionalDependencyNotAvailable:
														pass
							else:
														from .modeling_mgp_str import (
														    MGP_STR_PRETRAINED_MODEL_ARCHIVE_LIST,
														    MgpstrForSceneTextRecognition,
														    MgpstrModel,
														    MgpstrPreTrainedModel,
														)
else:
							import sys

							UpperCAmelCase__       =	_LazyModule(__name__, globals()["__file__"], _import_structure, module_spec=__spec__)





UpperCAmelCase__       =	{
    "A": ["B", "C", "E"],
    "B": ["A", "D", "E"],
    "C": ["A", "F", "G"],
    "D": ["B"],
    "E": ["A", "B", "D"],
    "F": ["C"],
    "G": ["C"],
}





def 							A     (					_UpperCAmelCase    :       dict							,       _UpperCAmelCase    :       Optional[int]							,       _UpperCAmelCase    :       List[Any]   )    ->			list[str]:







			'''simple docstring'''
			_UpperCAmelCase			=       set()
			# keep track of all the paths to be checked
			_UpperCAmelCase			=       [[start]]

			# return path if start is goal
			if start == goal:
						return [start]

			# keeps looping until all possible paths have been checked
			while queue:
						# pop the first path from the queue
						_UpperCAmelCase			=       queue.pop(0   )
						# get the last node from the path
						_UpperCAmelCase			=       path[-1]
						if node not in explored:
									_UpperCAmelCase			=       graph[node]
									# go through all neighbour nodes, construct a new path and
									# push it into the queue
									for neighbour in neighbours:
												_UpperCAmelCase			=       list(_UpperCAmelCase   )
												new_path.append(_UpperCAmelCase   )
												queue.append(_UpperCAmelCase   )
												# return path if neighbour is goal
												if neighbour == goal:
															return new_path

            # mark node as explored
									explored.add(_UpperCAmelCase   )

    # in case there's no path between the 2 nodes
			return []





def 							A     (					_UpperCAmelCase    :       dict							,       _UpperCAmelCase    :       Any							,       _UpperCAmelCase    :       List[str]   )    ->			int:







			'''simple docstring'''
			if not graph or start not in graph or target not in graph:
						return -1
			if start == target:
						return 0
			_UpperCAmelCase			=       [start]
			_UpperCAmelCase			=       set(_UpperCAmelCase   )
			# Keep tab on distances from `start` node.
			_UpperCAmelCase			=       {start: 0, target: -1}
			while queue:
						_UpperCAmelCase			=       queue.pop(0   )
						if node == target:
									_UpperCAmelCase			=       (
									    dist[node] if dist[target] == -1 else min(dist[target]							,       dist[node]   )
									)
						for adjacent in graph[node]:
									if adjacent not in visited:
												visited.add(_UpperCAmelCase   )
												queue.append(_UpperCAmelCase   )
												_UpperCAmelCase			=       dist[node] + 1
			return dist[target]


if __name__ == "__main__":
							print(bfs_shortest_path(demo_graph, "G", "D"))  # returns ['G', 'C', 'A', 'B', 'D']
							print(bfs_shortest_path_distance(demo_graph, "G", "D"))  # returns 4
