from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_flax_available, is_torch_available


__lowerCamelCase      :			Tuple							       =		{
    '''configuration_longt5''': ['''LONGT5_PRETRAINED_CONFIG_ARCHIVE_MAP''', '''LongT5Config''', '''LongT5OnnxConfig'''],
}

try:
   if not is_torch_available():
      raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
   pass
else:
   __lowerCamelCase      :			Tuple							       =		[
       '''LONGT5_PRETRAINED_MODEL_ARCHIVE_LIST''',
       '''LongT5EncoderModel''',
       '''LongT5ForConditionalGeneration''',
       '''LongT5Model''',
       '''LongT5PreTrainedModel''',
   ]

try:
   if not is_flax_available():
      raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
   pass
else:
   __lowerCamelCase      :			Tuple							       =		[
       '''FlaxLongT5ForConditionalGeneration''',
       '''FlaxLongT5Model''',
       '''FlaxLongT5PreTrainedModel''',
   ]


if TYPE_CHECKING:
   from .configuration_longta import LONGT5_PRETRAINED_CONFIG_ARCHIVE_MAP, LongTaConfig, LongTaOnnxConfig

   try:
      if not is_torch_available():
         raise OptionalDependencyNotAvailable()
   except OptionalDependencyNotAvailable:
      pass
   else:
      from .modeling_longta import (
          LONGT5_PRETRAINED_MODEL_ARCHIVE_LIST,
          LongTaEncoderModel,
          LongTaForConditionalGeneration,
          LongTaModel,
          LongTaPreTrainedModel,
      )

   try:
      if not is_flax_available():
         raise OptionalDependencyNotAvailable()
   except OptionalDependencyNotAvailable:
      pass
   else:
      from .modeling_flax_longta import (
          FlaxLongTaForConditionalGeneration,
          FlaxLongTaModel,
          FlaxLongTaPreTrainedModel,
      )


else:
   import sys

   __lowerCamelCase      :			Tuple							       =		_LazyModule(__name__, globals()['''__file__'''], _import_structure, module_spec=__spec__)

def      __SCREAMING_SNAKE_CASE  ( __UpperCamelCase   :	List[Any]     )							-> Any:







  """simple docstring"""





  SCREAMING_SNAKE_CASE__      							=				[0] * len(__UpperCamelCase     )
  SCREAMING_SNAKE_CASE__      							=				[]
  SCREAMING_SNAKE_CASE__      							=				[1] * len(__UpperCamelCase     )

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

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

  while queue:
    SCREAMING_SNAKE_CASE__      							=				queue.pop(0     )
    for x in graph[vertex]:
      indegree[x] -= 1

      if long_dist[vertex] + 1 > long_dist[x]:
        SCREAMING_SNAKE_CASE__      							=				long_dist[vertex] + 1

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

  print(max(__UpperCamelCase     )     )


# Adjacency list of Graph
__lowerCamelCase      :			int							       =		{0: [2, 3, 4], 1: [2, 7], 2: [5], 3: [5, 7], 4: [7], 5: [6], 6: [7], 7: []}






longest_distance(graph)
