




from collections import namedtuple

_lowerCamelCase	:		Tuple							       =   namedtuple("""from_to""", """from_ to""")

_lowerCamelCase	:		Dict							       =   {
    """cubicmeter""": from_to(1, 1),
    """litre""": from_to(0.001, 1000),
    """kilolitre""": from_to(1, 1),
    """gallon""": from_to(0.00_454, 264.172),
    """cubicyard""": from_to(0.76_455, 1.30_795),
    """cubicfoot""": from_to(0.028, 35.3_147),
    """cup""": from_to(0.000_236_588, 4_226.75),
}







def SCREAMING_SNAKE_CASE				(       lowercase_ ,				lowercase_ ,				lowercase_						)   ->       float:



       """simple docstring"""

       if from_type not in METRIC_CONVERSION:
              raise ValueError(
                  f"""Invalid 'from_type' value: {from_type!r}  Supported values are:\n"""
                  + ''', '''.join(lowercase_						)						)
       if to_type not in METRIC_CONVERSION:
              raise ValueError(
                  f"""Invalid 'to_type' value: {to_type!r}.  Supported values are:\n"""
                  + ''', '''.join(lowercase_						)						)
       return value * METRIC_CONVERSION[from_type].from_ * METRIC_CONVERSION[to_type].to


if __name__ == "__main__":
  import doctest

  doctest.testmod()








def SCREAMING_SNAKE_CASE				(       lowercase_						)   ->       Any:



       """simple docstring"""

       A__       =    [0] * len(lowercase_						)
       A__       =    []
       A__       =    [1] * len(lowercase_						)

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

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

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

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

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

       print(max(lowercase_						)						)


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


