def 			lowercase_				(			_lowerCamelCase							:       int):
    lowercase__ :   Dict    					=				[0] * len(_lowerCamelCase)
    lowercase__ :   int    					=				[]
    lowercase__ :   List[str]    					=				[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:
        lowercase__ :   Union[str, Any]    					=				queue.pop(0)
        for x in graph[vertex]:
            indegree[x] -= 1

            if long_dist[vertex] + 1 > long_dist[x]:
                lowercase__ :   Dict    					=				long_dist[vertex] + 1

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

    print(max(_lowerCamelCase))


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

longest_distance(graph)






'''simple docstring'''



import numpy as np







def    a__       (  a__      ,    a__      ,    a__ = 1E-1_2      ,    a__ = 1_00      ,    ):




     """simple docstring"""


     assert np.shape(a__						)[0] == np.shape(a__						)[1]
     # Ensure proper dimensionality.
     assert np.shape(a__						)[0] == np.shape(a__						)[0]
     # Ensure inputs are either both complex or both real
     assert np.iscomplexobj(a__						) == np.iscomplexobj(a__						)
     __SCREAMING_SNAKE_CASE     =      np.iscomplexobj(a__						)
     if is_complex:
          # Ensure complex input_matrix is Hermitian
          assert np.array_equal(a__      ,    input_matrix.conj().T						)

     # Set convergence to False. Will define convergence when we exceed max_iterations
     # or when we have small changes from one iteration to next.

     __SCREAMING_SNAKE_CASE     =      False
     __SCREAMING_SNAKE_CASE     =      0
     __SCREAMING_SNAKE_CASE     =      0
     __SCREAMING_SNAKE_CASE     =      1E1_2

     while not convergence:
          # Multiple matrix by the vector.
          __SCREAMING_SNAKE_CASE     =      np.dot(a__      ,    a__						)
          # Normalize the resulting output vector.
          __SCREAMING_SNAKE_CASE     =      w / np.linalg.norm(a__						)
          # Find rayleigh quotient
          # (faster than usual b/c we know vector is normalized already)
          __SCREAMING_SNAKE_CASE     =      vector.conj().T if is_complex else vector.T
          __SCREAMING_SNAKE_CASE     =      np.dot(a__      ,    np.dot(a__      ,    a__						)						)

          # Check convergence.
          __SCREAMING_SNAKE_CASE     =      np.abs(lambda_ - lambda_previous						) / lambda_
          iterations += 1

          if error <= error_tol or iterations >= max_iterations:
               __SCREAMING_SNAKE_CASE     =      True

          __SCREAMING_SNAKE_CASE     =      lambda_

     if is_complex:
          __SCREAMING_SNAKE_CASE     =      np.real(lambda_						)

     return lambda_, vector







def    a__       (  ):




     """simple docstring"""


     __SCREAMING_SNAKE_CASE     =      np.array([[41, 4, 20], [4, 26, 30], [20, 30, 50]]						)
     __SCREAMING_SNAKE_CASE     =      np.array([41, 4, 20]						)
     __SCREAMING_SNAKE_CASE     =      real_input_matrix.astype(np.complexaaa						)
     __SCREAMING_SNAKE_CASE     =      np.triu(1J * complex_input_matrix      ,    1						)
     complex_input_matrix += imag_matrix
     complex_input_matrix += -1 * imag_matrix.T
     __SCREAMING_SNAKE_CASE     =      np.array([41, 4, 20]						).astype(np.complexaaa						)

     for problem_type in ["real", "complex"]:
          if problem_type == "real":
               __SCREAMING_SNAKE_CASE     =      real_input_matrix
               __SCREAMING_SNAKE_CASE     =      real_vector
          elif problem_type == "complex":
               __SCREAMING_SNAKE_CASE     =      complex_input_matrix
               __SCREAMING_SNAKE_CASE     =      complex_vector

          # Our implementation.
          __SCREAMING_SNAKE_CASE   ,			__SCREAMING_SNAKE_CASE     =      power_iteration(a__      ,    a__						)

          # Numpy implementation.

          # Get eigenvalues and eigenvectors using built-in numpy
          # eigh (eigh used for symmetric or hermetian matrices).
          __SCREAMING_SNAKE_CASE   ,			__SCREAMING_SNAKE_CASE     =      np.linalg.eigh(a__						)
          # Last eigenvalue is the maximum one.
          __SCREAMING_SNAKE_CASE     =      eigen_values[-1]
          # Last column in this matrix is eigenvector corresponding to largest eigenvalue.
          __SCREAMING_SNAKE_CASE     =      eigen_vectors[:, -1]

          # Check our implementation and numpy gives close answers.
          assert np.abs(eigen_value - eigen_value_max						) <= 1E-6
          # Take absolute values element wise of each eigenvector.
          # as they are only unique to a minus sign.
          assert np.linalg.norm(np.abs(a__						) - np.abs(a__						)						) <= 1E-6


if __name__ == "__main__":
  import doctest

  doctest.testmod()
  test_power_iteration()






