(self, simplex)
Remove a given maximal N-simplex from the simplicial complex.
        :param simplex: The N-simplex, represented by a list of vertex.
        :type simplex: list of int.
        .. note::
            Be aware that removing is shifting data in a flat_map
            (:func:`initialize_filtration()<gudhi.SimplexTree.initialize_filtration>`
            to be done).
        .. note::
            The dimension of the simplicial complex may be lower after calling
            remove_maximal_simplex than it was before. However,
            :func:`upper_bound_dimension()<gudhi.SimplexTree.upper_bound_dimension>`
            method will return the old value, which
            remains a valid upper bound. If you care, you can call
            :func:`dimension()<gudhi.SimplexTree.dimension>`
            to recompute the exact dimension.
Remove a given maximal N-simplex from the simplicial complex.
        :param simplex: The N-simplex, represented by a list of vertex.
        :type simplex: list of int.
        .. note::
            Be aware that removing is shifting data in a flat_map
            (:func:`initialize_filtration()<gudhi.SimplexTree.initialize_filtration>`
            to be done).
        .. note::
            The dimension of the simplicial complex may be lower after calling
            remove_maximal_simplex than it was before. However,
            :func:`upper_bound_dimension()<gudhi.SimplexTree.upper_bound_dimension>`
            method will return the old value, which
            remains a valid upper bound. If you care, you can call
            :func:`dimension()<gudhi.SimplexTree.dimension>`
            to recompute the exact dimension.
Remove a given maximal N - simplex from the simplicial complex . : param simplex : The N - simplex represented by a list of vertex . : type simplex : list of int . .. note :: Be aware that removing is shifting data in a flat_map ( : func : initialize_filtration () <gudhi . SimplexTree . initialize_filtration > to be done ) . .. note :: The dimension of the simplicial complex may be lower after calling remove_maximal_simplex than it was before . However : func : upper_bound_dimension () <gudhi . SimplexTree . upper_bound_dimension > method will return the old value which remains a valid upper bound . If you care you can call : func : dimension () <gudhi . SimplexTree . dimension > to recompute the exact dimension .
def remove_maximal_simplex(self, simplex):
        """Remove a given maximal N-simplex from the simplicial complex.
        :param simplex: The N-simplex, represented by a list of vertex.
        :type simplex: list of int.
        .. note::
            Be aware that removing is shifting data in a flat_map
            (:func:`initialize_filtration()<gudhi.SimplexTree.initialize_filtration>`
            to be done).
        .. note::
            The dimension of the simplicial complex may be lower after calling
            remove_maximal_simplex than it was before. However,
            :func:`upper_bound_dimension()<gudhi.SimplexTree.upper_bound_dimension>`
            method will return the old value, which
            remains a valid upper bound. If you care, you can call
            :func:`dimension()<gudhi.SimplexTree.dimension>`
            to recompute the exact dimension.
        """
        self.thisptr.remove_maximal_simplex(simplex)
def remove_maximal_simplex ( self , simplex ) : self . thisptr . remove_maximal_simplex ( simplex )