





from typing import TYPE_CHECKING

# rely on isort to merge the imports
from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_sentencepiece_available, is_torch_available


_UpperCamelCase       :				List[Any]           =			{
    """configuration_ernie_m""": ["""ERNIE_M_PRETRAINED_CONFIG_ARCHIVE_MAP""", """ErnieMConfig"""],
}

try:
    if not is_sentencepiece_available():
        raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
    pass
else:
    _UpperCamelCase       :				Any           =			["""ErnieMTokenizer"""]

try:
    if not is_torch_available():
        raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
    pass
else:
    _UpperCamelCase       :				List[str]           =			[
        """ERNIE_M_PRETRAINED_MODEL_ARCHIVE_LIST""",
        """ErnieMForMultipleChoice""",
        """ErnieMForQuestionAnswering""",
        """ErnieMForSequenceClassification""",
        """ErnieMForTokenClassification""",
        """ErnieMModel""",
        """ErnieMPreTrainedModel""",
        """ErnieMForInformationExtraction""",
    ]


if TYPE_CHECKING:
    from .configuration_ernie_m import ERNIE_M_PRETRAINED_CONFIG_ARCHIVE_MAP, ErnieMConfig

    try:
        if not is_sentencepiece_available():
            raise OptionalDependencyNotAvailable()
    except OptionalDependencyNotAvailable:
        pass
    else:
        from .tokenization_ernie_m import ErnieMTokenizer

    try:
        if not is_torch_available():
            raise OptionalDependencyNotAvailable()
    except OptionalDependencyNotAvailable:
        pass
    else:
        from .modeling_ernie_m import (
            ERNIE_M_PRETRAINED_MODEL_ARCHIVE_LIST,
            ErnieMForInformationExtraction,
            ErnieMForMultipleChoice,
            ErnieMForQuestionAnswering,
            ErnieMForSequenceClassification,
            ErnieMForTokenClassification,
            ErnieMModel,
            ErnieMPreTrainedModel,
        )


else:
    import sys

    _UpperCamelCase       :				List[Any]           =			_LazyModule(__name__, globals()["""__file__"""], _import_structure, module_spec=__spec__)









'''simple docstring'''





from __future__ import annotations

from queue import Queue
class 					lowercase							:


    '''simple docstring'''

    def __init__(       self  :  Optional[int]  )				->				None:

     '''simple docstring'''




     lowerCamelCase__	=  {}

    def  a__					(       self  :  Optional[int]  )				->				None:

     '''simple docstring'''




     for i in self.vertices:
      print(__lowerCamelCase					,  " : "					,  " -> ".join([str(__lowerCamelCase  ) for j in self.vertices[i]]  )  )

    def  a__					(       self  :  Optional[Any]					,  __lowerCamelCase  :  int					,  __lowerCamelCase  :  int  )				->				None:

     '''simple docstring'''




     if from_vertex in self.vertices:
      self.vertices[from_vertex].append(__lowerCamelCase  )
     else:
      lowerCamelCase__	=  [to_vertex]




    def  a__					(       self  :  Optional[int]					,  __lowerCamelCase  :  int  )				->				set[int]:

     '''simple docstring'''




     lowerCamelCase__	=  set()

     # create a first in first out queue to store all the vertices for BFS
     lowerCamelCase__	=  Queue()

     # mark the source node as visited and enqueue it
     visited.add(__lowerCamelCase  )
     queue.put(__lowerCamelCase  )

     while not queue.empty():
      lowerCamelCase__	=  queue.get()

      # loop through all adjacent vertex and enqueue it if not yet visited
      for adjacent_vertex in self.vertices[vertex]:
       if adjacent_vertex not in visited:
        queue.put(__lowerCamelCase  )
        visited.add(__lowerCamelCase  )
     return visited


if __name__ == "__main__":
 from doctest import testmod

 testmod(verbose=True)

 __A				:				Optional[Any]					=		Graph()
 g.add_edge(0, 1)
 g.add_edge(0, 2)
 g.add_edge(1, 2)
 g.add_edge(2, 0)
 g.add_edge(2, 3)
 g.add_edge(3, 3)

 g.print_graph()
 # 0  :  1 -> 2
 # 1  :  2
 # 2  :  0 -> 3
 # 3  :  3

 assert sorted(g.bfs(2)) == [0, 1, 2, 3]

