'''simple docstring'''

def __a (	__lowerCamelCase			:						List[str] ,		__lowerCamelCase			:						List[str]				)	->							int:
      '''simple docstring'''


      lowercase_     =      (boundary[1] - boundary[0]) / steps
      lowercase_     =      boundary[0]
      lowercase_     =      boundary[1]
      lowercase_     =      make_points(__lowerCamelCase ,		__lowerCamelCase ,		__lowerCamelCase				)
      lowercase_     =      0.0
      y += (h / 2.0) * f(__lowerCamelCase				)
      for i in x_i:
            # print(i)
            y += h * f(__lowerCamelCase				)
      y += (h / 2.0) * f(__lowerCamelCase				)
      return y


def __a (	__lowerCamelCase			:						Tuple ,		__lowerCamelCase			:						Union[str, Any] ,		__lowerCamelCase			:						Any				)	->							Dict:
      '''simple docstring'''


      lowercase_     =      a + h
      while x < (b - h):
            yield x
            lowercase_     =      x + h


def __a (	__lowerCamelCase			:						List[str]				)	->							str:  # enter your function here
      '''simple docstring'''


      lowercase_     =      (x - 0) * (x - 0)
      return y


def __a (	)	->							Optional[int]:
      '''simple docstring'''


      lowercase_     =      0.0  # Lower bound of integration
      lowercase_     =      1.0  # Upper bound of integration
      lowercase_     =      1_0.0  # define number of steps or resolution
      lowercase_     =      [a, b]  # define boundary of integration
      lowercase_     =      method_a(__lowerCamelCase ,		__lowerCamelCase				)
      print(f'y = {y}'				)


if __name__ == "__main__":
       main()







'''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

lowerCAmelCase_ : Dict						  =      TypeVar("T")





class 							lowercase						(						Generic[T] ):


   def __init__(   self				:	int   ,		__lowerCAmelCase				:	bool = True)      ->					None:
         lowercase_     =      {}  # dictionary of lists
         lowercase_     =      directed


   def __UpperCAmelCase       (   self				:	int   ,		__lowerCAmelCase				:	T   ,		__lowerCAmelCase				:	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(__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				:	str)      ->					str:
         return pformat(self.adj_list)






