



from math import pi, sqrt, tan



def 			_lowerCAmelCase       (					__lowerCAmelCase      )   ->					Tuple:


				"""simple docstring"""

				if side_length < 0:
								raise ValueError('''surface_area_cube() only accepts non-negative values'''      )
				return 6 * side_length**2



def 			_lowerCAmelCase       (					__lowerCAmelCase  ,  __lowerCAmelCase  ,  __lowerCAmelCase      )   ->					str:


				"""simple docstring"""

				if length < 0 or breadth < 0 or height < 0:
								raise ValueError('''surface_area_cuboid() only accepts non-negative values'''      )
				return 2 * ((length * breadth) + (breadth * height) + (length * height))



def 			_lowerCAmelCase       (					__lowerCAmelCase      )   ->					List[Any]:


				"""simple docstring"""

				if radius < 0:
								raise ValueError('''surface_area_sphere() only accepts non-negative values'''      )
				return 4 * pi * radius**2



def 			_lowerCAmelCase       (					__lowerCAmelCase      )   ->					Union[str, Any]:


				"""simple docstring"""

				if radius < 0:
								raise ValueError('''surface_area_hemisphere() only accepts non-negative values'''      )
				return 3 * pi * radius**2



def 			_lowerCAmelCase       (					__lowerCAmelCase  ,  __lowerCAmelCase      )   ->					List[Any]:


				"""simple docstring"""

				if radius < 0 or height < 0:
								raise ValueError('''surface_area_cone() only accepts non-negative values'''      )
				return pi * radius * (radius + (height**2 + radius**2) ** 0.5)



def 			_lowerCAmelCase       (					__lowerCAmelCase  ,  __lowerCAmelCase  ,  __lowerCAmelCase      )   ->					Union[str, Any]:


				"""simple docstring"""

				if radius_a < 0 or radius_a < 0 or height < 0:
								raise ValueError(
								    '''surface_area_conical_frustum() only accepts non-negative values'''      )
				snake_case__	:      List[str]     		=	(height**2 + (radius_a - radius_a) ** 2) ** 0.5
				return pi * ((slant_height * (radius_a + radius_a)) + radius_a**2 + radius_a**2)



def 			_lowerCAmelCase       (					__lowerCAmelCase  ,  __lowerCAmelCase      )   ->					List[str]:


				"""simple docstring"""

				if radius < 0 or height < 0:
								raise ValueError('''surface_area_cylinder() only accepts non-negative values'''      )
				return 2 * pi * radius * (height + radius)



def 			_lowerCAmelCase       (					__lowerCAmelCase  ,  __lowerCAmelCase      )   ->					Tuple:


				"""simple docstring"""

				if torus_radius < 0 or tube_radius < 0:
								raise ValueError('''surface_area_torus() only accepts non-negative values'''      )
				if torus_radius < tube_radius:
								raise ValueError(
								    '''surface_area_torus() does not support spindle or self intersecting tori'''      )
				return 4 * pow(__snake_case  ,  2      ) * torus_radius * tube_radius



def 			_lowerCAmelCase       (					__lowerCAmelCase  ,  __lowerCAmelCase      )   ->					Optional[int]:


				"""simple docstring"""

				if length < 0 or width < 0:
								raise ValueError('''area_rectangle() only accepts non-negative values'''      )
				return length * width



def 			_lowerCAmelCase       (					__lowerCAmelCase      )   ->					List[Any]:


				"""simple docstring"""

				if side_length < 0:
								raise ValueError('''area_square() only accepts non-negative values'''      )
				return side_length**2



def 			_lowerCAmelCase       (					__lowerCAmelCase  ,  __lowerCAmelCase      )   ->					Any:


				"""simple docstring"""

				if base < 0 or height < 0:
								raise ValueError('''area_triangle() only accepts non-negative values'''      )
				return (base * height) / 2



def 			_lowerCAmelCase       (					__lowerCAmelCase  ,  __lowerCAmelCase  ,  __lowerCAmelCase      )   ->					List[str]:


				"""simple docstring"""

				if sidea < 0 or sidea < 0 or sidea < 0:
								raise ValueError('''area_triangle_three_sides() only accepts non-negative values'''      )
				elif sidea + sidea < sidea or sidea + sidea < sidea or sidea + sidea < sidea:
								raise ValueError('''Given three sides do not form a triangle'''      )
				snake_case__	:      Dict     		=	(sidea + sidea + sidea) / 2
				snake_case__	:      List[Any]     		=	sqrt(
				    semi_perimeter
				    * (semi_perimeter - sidea)
				    * (semi_perimeter - sidea)
				    * (semi_perimeter - sidea)      )
				return area



def 			_lowerCAmelCase       (					__lowerCAmelCase  ,  __lowerCAmelCase      )   ->					List[Any]:


				"""simple docstring"""

				if base < 0 or height < 0:
								raise ValueError('''area_parallelogram() only accepts non-negative values'''      )
				return base * height



def 			_lowerCAmelCase       (					__lowerCAmelCase  ,  __lowerCAmelCase  ,  __lowerCAmelCase      )   ->					List[str]:


				"""simple docstring"""

				if basea < 0 or basea < 0 or height < 0:
								raise ValueError('''area_trapezium() only accepts non-negative values'''      )
				return 1 / 2 * (basea + basea) * height



def 			_lowerCAmelCase       (					__lowerCAmelCase      )   ->					List[str]:


				"""simple docstring"""

				if radius < 0:
								raise ValueError('''area_circle() only accepts non-negative values'''      )
				return pi * radius**2



def 			_lowerCAmelCase       (					__lowerCAmelCase  ,  __lowerCAmelCase      )   ->					str:


				"""simple docstring"""

				if radius_x < 0 or radius_y < 0:
								raise ValueError('''area_ellipse() only accepts non-negative values'''      )
				return pi * radius_x * radius_y



def 			_lowerCAmelCase       (					__lowerCAmelCase  ,  __lowerCAmelCase      )   ->					List[Any]:


				"""simple docstring"""

				if diagonal_a < 0 or diagonal_a < 0:
								raise ValueError('''area_rhombus() only accepts non-negative values'''      )
				return 1 / 2 * diagonal_a * diagonal_a



def 			_lowerCAmelCase       (					__lowerCAmelCase  ,  __lowerCAmelCase      )   ->					Dict:


				"""simple docstring"""

				if not isinstance(__snake_case  ,  __snake_case      ) or sides < 3:
								raise ValueError(
								    '''area_reg_polygon() only accepts integers greater than or \
equal to three as number of sides'''      )
				elif length < 0:
								raise ValueError(
								    '''area_reg_polygon() only accepts non-negative values as \
length of a side'''      )
				return (sides * length**2) / (4 * tan(pi / sides      ))
				return (sides * length**2) / (4 * tan(pi / sides      ))


if __name__ == "__main__":
				import doctest

				doctest.testmod(verbose=True)  # verbose so we can see methods missing tests

				print('''[DEMO] Areas of various geometric shapes: \n''')
				print(f"""Rectangle: {area_rectangle(10, 20) = }""")
				print(f"""Square: {area_square(10) = }""")
				print(f"""Triangle: {area_triangle(10, 10) = }""")
				print(f"""Triangle: {area_triangle_three_sides(5, 12, 13) = }""")
				print(f"""Parallelogram: {area_parallelogram(10, 20) = }""")
				print(f"""Rhombus: {area_rhombus(10, 20) = }""")
				print(f"""Trapezium: {area_trapezium(10, 20, 30) = }""")
				print(f"""Circle: {area_circle(20) = }""")
				print(f"""Ellipse: {area_ellipse(10, 20) = }""")
				print('''\nSurface Areas of various geometric shapes: \n''')
				print(f"""Cube: {surface_area_cube(20) = }""")
				print(f"""Cuboid: {surface_area_cuboid(10, 20, 30) = }""")
				print(f"""Sphere: {surface_area_sphere(20) = }""")
				print(f"""Hemisphere: {surface_area_hemisphere(20) = }""")
				print(f"""Cone: {surface_area_cone(10, 20) = }""")
				print(f"""Conical Frustum: {surface_area_conical_frustum(10, 20, 30) = }""")
				print(f"""Cylinder: {surface_area_cylinder(10, 20) = }""")
				print(f"""Torus: {surface_area_torus(20, 10) = }""")
				print(f"""Equilateral Triangle: {area_reg_polygon(3, 10) = }""")
				print(f"""Square: {area_reg_polygon(4, 10) = }""")
				print(f"""Reqular Pentagon: {area_reg_polygon(5, 10) = }""")









"""simple docstring"""



# Author: OMKAR PATHAK, Nwachukwu Chidiebere

# Use a Python dictionary to construct the graph.
from __future__ import annotations

from pprint import pformat
from typing import Generic, TypeVar

_UpperCamelCase		:  Optional[Any]						=		TypeVar('T')

class        a     (   Generic[T]	):







    def __init__(			self							,		_lowerCamelCase = True       ):
      lowercase							    =       {}  # dictionary of lists
      lowercase							    =       directed







    def 			UpperCamelCase_      (			self							,		_lowerCamelCase							,		_lowerCamelCase       ):

      if not self.directed:  # For undirected graphs
        # if both source vertex and destination vertex are both present in the
        # adjacency list, add destination vertex to source vertex list of adjacent
        # vertices and add source vertex to destination vertex list of adjacent
        # vertices.
        if source_vertex in self.adj_list and destination_vertex in self.adj_list:
          self.adj_list[source_vertex].append(_lowerCamelCase       )
          self.adj_list[destination_vertex].append(_lowerCamelCase       )
        # if only source vertex is present in adjacency list, add destination vertex
        # to source vertex list of adjacent vertices, then create a new vertex with
        # destination vertex as key and assign a list containing the source vertex
        # as it's first adjacent vertex.
        elif source_vertex in self.adj_list:
          self.adj_list[source_vertex].append(_lowerCamelCase       )
          lowercase							    =       [source_vertex]
        # if only destination vertex is present in adjacency list, add source vertex
        # to destination vertex list of adjacent vertices, then create a new vertex
        # with source vertex as key and assign a list containing the source vertex
        # as it's first adjacent vertex.
        elif destination_vertex in self.adj_list:
          self.adj_list[destination_vertex].append(_lowerCamelCase       )
          lowercase							    =       [destination_vertex]
        # if both source vertex and destination vertex are not present in adjacency
        # list, create a new vertex with source vertex as key and assign a list
        # containing the destination vertex as it's first adjacent vertex also
        # create a new vertex with destination vertex as key and assign a list
        # containing the source vertex as it's first adjacent vertex.
        else:
          lowercase							    =       [destination_vertex]
          lowercase							    =       [source_vertex]
      else:  # For directed graphs
        # if both source vertex and destination vertex are present in adjacency
        # list, add destination vertex to source vertex list of adjacent vertices.
        if source_vertex in self.adj_list and destination_vertex in self.adj_list:
          self.adj_list[source_vertex].append(_lowerCamelCase       )
        # if only source vertex is present in adjacency list, add destination
        # vertex to source vertex list of adjacent vertices and create a new vertex
        # with destination vertex as key, which has no adjacent vertex
        elif source_vertex in self.adj_list:
          self.adj_list[source_vertex].append(_lowerCamelCase       )
          lowercase							    =       []
        # if only destination vertex is present in adjacency list, create a new
        # vertex with source vertex as key and assign a list containing destination
        # vertex as first adjacent vertex
        elif destination_vertex in self.adj_list:
          lowercase							    =       [destination_vertex]
        # if both source vertex and destination vertex are not present in adjacency
        # list, create a new vertex with source vertex as key and a list containing
        # destination vertex as it's first adjacent vertex. Then create a new vertex
        # with destination vertex as key, which has no adjacent vertex
        else:
          lowercase							    =       [destination_vertex]
          lowercase							    =       []

      return self







    def __repr__(			self       ):
      return pformat(self.adj_list       )


