



'''simple docstring'''





from typing import TYPE_CHECKING

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


__a          =		{
    """configuration_cpmant""": ["""CPMANT_PRETRAINED_CONFIG_ARCHIVE_MAP""", """CpmAntConfig"""],
    """tokenization_cpmant""": ["""CpmAntTokenizer"""],
}

try:
       if not is_torch_available():
              raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
       pass
else:
       __a          =		[
           """CPMANT_PRETRAINED_MODEL_ARCHIVE_LIST""",
           """CpmAntForCausalLM""",
           """CpmAntModel""",
           """CpmAntPreTrainedModel""",
       ]


if TYPE_CHECKING:
       from .configuration_cpmant import CPMANT_PRETRAINED_CONFIG_ARCHIVE_MAP, CpmAntConfig
       from .tokenization_cpmant import CpmAntTokenizer

       try:
              if not is_torch_available():
                     raise OptionalDependencyNotAvailable()
       except OptionalDependencyNotAvailable:
              pass
       else:
              from .modeling_cpmant import (
                  CPMANT_PRETRAINED_MODEL_ARCHIVE_LIST,
                  CpmAntForCausalLM,
                  CpmAntModel,
                  CpmAntPreTrainedModel,
              )


else:
       import sys

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





"""simple docstring"""







def 				UpperCamelCase_    (    lowerCAmelCase__      :				Optional[Any]						)						->   Optional[int]:

  """simple docstring"""




  lowerCAmelCase_   :				Tuple								= [0] * len(lowerCAmelCase__						)
  lowerCAmelCase_   :				List[str]								= []
  lowerCAmelCase_   :				Tuple								= [1] * len(lowerCAmelCase__						)

  for values in graph.values():
    for i in values:
      indegree[i] += 1

  for i in range(len(lowerCAmelCase__						)						):
    if indegree[i] == 0:
      queue.append(lowerCAmelCase__						)

  while queue:
    lowerCAmelCase_   :				Union[str, Any]								= queue.pop(0						)
    for x in graph[vertex]:
      indegree[x] -= 1

      if long_dist[vertex] + 1 > long_dist[x]:
        lowerCAmelCase_   :				Any								= long_dist[vertex] + 1

      if indegree[x] == 0:
        queue.append(lowerCAmelCase__						)

  print(max(lowerCAmelCase__						)						)


# Adjacency list of Graph
lowercase__		:				Any          =	{0: [2, 3, 4], 1: [2, 7], 2: [5], 3: [5, 7], 4: [7], 5: [6], 6: [7], 7: []}
longest_distance(graph)





