





'''simple docstring'''






from math import pi, sqrt, tan
def        UpperCamelCase__				(		lowerCAmelCase  ):





      """simple docstring"""


      if side_length < 0:
            raise ValueError("""surface_area_cube() only accepts non-negative values"""  )
      return 6 * side_length**2
def        UpperCamelCase__				(		lowerCAmelCase							,     lowerCAmelCase							,     lowerCAmelCase  ):





      """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        UpperCamelCase__				(		lowerCAmelCase  ):





      """simple docstring"""


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





      """simple docstring"""


      if radius < 0:
            raise ValueError("""surface_area_hemisphere() only accepts non-negative values"""  )
      return 3 * pi * radius**2
def        UpperCamelCase__				(		lowerCAmelCase							,     lowerCAmelCase  ):





      """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        UpperCamelCase__				(		lowerCAmelCase							,     lowerCAmelCase							,     lowerCAmelCase  ):





      """simple docstring"""


      if radius_a < 0 or radius_a < 0 or height < 0:
            raise ValueError(
                """surface_area_conical_frustum() only accepts non-negative values"""  )
      _lowerCAmelCase												=							(height**2 + (radius_a - radius_a) ** 2) ** 0.5
      return pi * ((slant_height * (radius_a + radius_a)) + radius_a**2 + radius_a**2)
def        UpperCamelCase__				(		lowerCAmelCase							,     lowerCAmelCase  ):





      """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        UpperCamelCase__				(		lowerCAmelCase							,     lowerCAmelCase  ):





      """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(lowerCAmelCase							,     2  ) * torus_radius * tube_radius
def        UpperCamelCase__				(		lowerCAmelCase							,     lowerCAmelCase  ):





      """simple docstring"""


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





      """simple docstring"""


      if side_length < 0:
            raise ValueError("""area_square() only accepts non-negative values"""  )
      return side_length**2
def        UpperCamelCase__				(		lowerCAmelCase							,     lowerCAmelCase  ):





      """simple docstring"""


      if base < 0 or height < 0:
            raise ValueError("""area_triangle() only accepts non-negative values"""  )
      return (base * height) / 2
def        UpperCamelCase__				(		lowerCAmelCase							,     lowerCAmelCase							,     lowerCAmelCase  ):





      """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"""  )
      _lowerCAmelCase												=							(sidea + sidea + sidea) / 2
      _lowerCAmelCase												=							sqrt(
          semi_perimeter
          * (semi_perimeter - sidea)
          * (semi_perimeter - sidea)
          * (semi_perimeter - sidea)  )
      return area
def        UpperCamelCase__				(		lowerCAmelCase							,     lowerCAmelCase  ):





      """simple docstring"""


      if base < 0 or height < 0:
            raise ValueError("""area_parallelogram() only accepts non-negative values"""  )
      return base * height
def        UpperCamelCase__				(		lowerCAmelCase							,     lowerCAmelCase							,     lowerCAmelCase  ):





      """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        UpperCamelCase__				(		lowerCAmelCase  ):





      """simple docstring"""


      if radius < 0:
            raise ValueError("""area_circle() only accepts non-negative values"""  )
      return pi * radius**2
def        UpperCamelCase__				(		lowerCAmelCase							,     lowerCAmelCase  ):





      """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        UpperCamelCase__				(		lowerCAmelCase							,     lowerCAmelCase  ):





      """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        UpperCamelCase__				(		lowerCAmelCase							,     lowerCAmelCase  ):





      """simple docstring"""


      if not isinstance(lowerCAmelCase							,     lowerCAmelCase  ) 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

A__    :       List[str]              =TypeVar('''T''')




class 			UpperCAmelCase					(      Generic[T]       ):




      def __init__(      self      :			Tuple      ,      __snake_case      :			bool = True  )    ->				None:
            _lowerCAmelCase												=							{}  # dictionary of lists
            _lowerCAmelCase												=							directed




      def     lowercase__   (      self      :			Union[str, Any]      ,      __snake_case      :			T      ,      __snake_case      :			T  )    ->				GraphAdjacencyList[T]:

            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(__snake_case  )
                        self.adj_list[destination_vertex].append(__snake_case  )
                  # 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(__snake_case  )
                        _lowerCAmelCase												=							[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(__snake_case  )
                        _lowerCAmelCase												=							[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:
                        _lowerCAmelCase												=							[destination_vertex]
                        _lowerCAmelCase												=							[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(__snake_case  )
                  # 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(__snake_case  )
                        _lowerCAmelCase												=							[]
                  # 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:
                        _lowerCAmelCase												=							[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:
                        _lowerCAmelCase												=							[destination_vertex]
                        _lowerCAmelCase												=							[]

            return self




      def __repr__(      self      :			int  )    ->				str:
            return pformat(self.adj_list  )






