



"""simple docstring"""

def       __magic_name__    (   _lowerCamelCase				: Optional[Any]					):
							__a		:		int									=       [0] * len(__a					)
							__a		:		Optional[int]									=       []
							__a		:		List[str]									=       [1] * len(__a					)

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

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

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

																					if long_dist[vertex] + 1 > long_dist[x]:
																												__a		:		str									=       long_dist[vertex] + 1

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

							print(max(__a					)					)


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







longest_distance(graph)






"""simple docstring"""

from dataclasses import dataclass
from enum import Enum
from typing import List, Optional, Union

import numpy as np
import PIL
from PIL import Image

from ...utils import BaseOutput, is_torch_available, is_transformers_available




@dataclass
class SCREAMING_SNAKE_CASE__					(		__snake_case      ):
						_lowerCAmelCase							=					42
						_lowerCAmelCase							=					42


if is_transformers_available() and is_torch_available():
	from .pipeline_semantic_stable_diffusion import SemanticStableDiffusionPipeline

