Repository: ManimCommunity/manim
File: manim/scene/graph_scene.py (Python)

Code before:
                        [
                            self.coords_to_point(x, y_point),
                            self.coords_to_point(x + width_scale_factor * dx, y_point),
                            graph_point,
                        ],
                    )
                )
            )

            rect = Rectangle()
            rect.replace(points, stretch=True)
            if graph_point[1] < self.graph_origin[1] and show_signed_area:
                fill_color = invert_color(color)
            else:
                fill_color = color
            rect.set_fill(fill_color, opacity=fill_opacity)
            rect.set_stroke(stroke_color, width=stroke_width)
            rectangles.add(rect)
        return rectangles

    def get_riemann_rectangles_list(
        self, graph, n_iterations, max_dx=0.5, power_base=2, stroke_width=1, **kwargs
    ):
        """Returns a list of Riemann Rectangles.

        This method returns a list of multiple :class:`~.VGroup`s of Riemann
        Rectangles. The initial rectangles are relatively inaccurate,
        but the closer you get to the end the more accurate the Riemann
        rectangles become.

        Parameters
        ----------
        graph : :class:`~.ParametricFunction`
            The graph whose area needs to be approximated
            by the Riemann Rectangles.

        n_iterations : :class:`int`
            The number of VGroups of successive accuracy that are needed.

        max_dx : Optional[:class:`float`]
            The maximum change in x between two VGroups of Riemann Rectangles

        power_base : Optional[:class:`float`]
            Defaults to 2

        stroke_width : Optional[:class:`float`]
            The stroke_width of the border of the rectangles.

        **kwargs
            Any valid keyword arguments of :meth:`get_riemann_rectangles`.


Review comment (suggestion):
```suggestion
        This method returns a list of multiple :class:`VGroups <.VGroup>` of Riemann
```

Code after:
                        [
                            self.coords_to_point(x, y_point),
                            self.coords_to_point(x + width_scale_factor * dx, y_point),
                            graph_point,
                        ],
                    )
                )
            )

            rect = Rectangle()
            rect.replace(points, stretch=True)
            if graph_point[1] < self.graph_origin[1] and show_signed_area:
                fill_color = invert_color(color)
            else:
                fill_color = color
            rect.set_fill(fill_color, opacity=fill_opacity)
            rect.set_stroke(stroke_color, width=stroke_width)
            rectangles.add(rect)
        return rectangles

    def get_riemann_rectangles_list(
        self, graph, n_iterations, max_dx=0.5, power_base=2, stroke_width=1, **kwargs
    ):
        """Returns a list of Riemann Rectangles.

        This method returns a list of multiple :class:`VGroups <.VGroup>` of Riemann
        Rectangles. The initial rectangles are relatively inaccurate,
        but the closer you get to the end the more accurate the Riemann
        rectangles become.

        Parameters
        ----------
        graph : :class:`~.ParametricFunction`
            The graph whose area needs to be approximated
            by the Riemann Rectangles.

        n_iterations : :class:`int`
            The number of VGroups of successive accuracy that are needed.

        max_dx : Optional[:class:`float`]
            The maximum change in x between two VGroups of Riemann Rectangles

        power_base : Optional[:class:`float`]
            Defaults to 2

        stroke_width : Optional[:class:`float`]
            The stroke_width of the border of the rectangles.

        **kwargs
            Any valid keyword arguments of :meth:`get_riemann_rectangles`.