


import warnings

from ...utils import logging
from .image_processing_segformer import SegformerImageProcessor


snake_case__			 =						logging.get_logger(__name__)


class 					lowerCAmelCase_ (       _a):




						def __init__(	self						:   Any   ,     *__A						:   List[str]   ,     **__A						:   str						)      ->None:






									"""simple docstring"""






									warnings.warn(
									    "The class SegformerFeatureExtractor is deprecated and will be removed in version 5 of Transformers."
									    " Please use SegformerImageProcessor instead."   ,     __A   ,     )
									super().__init__(*__A   ,     **__A						)






class 					lowerCAmelCase_ :




						def __init__(	self						:   Optional[int]						)      ->Optional[Any]:






									"""simple docstring"""






									a__ :Tuple						  =    {}




						def  _snake_case					(	self						:   Tuple						)      ->None:






									"""simple docstring"""






									print(self.vertex						)
									for i in self.vertex:
												print(__A   ,     " -> "   ,     " -> ".join([str(__A						) for j in self.vertex[i]]						)						)




						def  _snake_case					(	self						:   Optional[int]   ,     __A						:   int   ,     __A						:   int						)      ->None:






									"""simple docstring"""






									if from_vertex in self.vertex:
												self.vertex[from_vertex].append(__A						)
									else:
												# else make a new vertex
												a__ :Any						  =    [to_vertex]




						def  _snake_case					(	self						:   Optional[int]						)      ->None:






									"""simple docstring"""






									a__ :List[Any]						  =    [False] * len(self.vertex						)

									# call the recursive helper function
									for i in range(len(self.vertex						)						):
												if not visited[i]:
															self.dfs_recursive(__A   ,     __A						)






						def  _snake_case					(	self						:   Union[str, Any]   ,     __A						:   int   ,     __A						:   list						)      ->None:






									"""simple docstring"""






									a__ :Dict						  =    True

									print(__A   ,     end=" "						)

									# Recur for all the vertices that are adjacent to this node
									for i in self.vertex:
												if not visited[i]:
															self.dfs_recursive(__A   ,     __A						)


if __name__ == "__main__":
		snake_case__			 =						Graph()
		g.add_edge(0, 1)
		g.add_edge(0, 2)
		g.add_edge(1, 2)
		g.add_edge(2, 0)
		g.add_edge(2, 3)
		g.add_edge(3, 3)

		g.print_graph()
		print('''DFS:''')
		g.dfs()

		# OUTPUT:
		# 0  ->  1 -> 2
		# 1  ->  2
		# 2  ->  0 -> 3
		# 3  ->  3
		# DFS:
		#  0 1 2 3


