Написать рекурсивную функцию, которая находит размер самой большой фигуры

#include <iostream>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <vector>
#include <algorithm>
 
struct Point {
  int x, y;
  Point() : x(0), y(0) {}
  Point(int x, int y) : x(x), y(y) {}
};
 
std::ostream &operator<<(std::ostream &stream, const Point &point) {
  return stream << "[" << point.x << "," << point.y << "]";
}
 
class Figure {
 public:
  Figure() : points() {}
  void addPoint(const Point &point) {
    points.push_back(point);
  }
  const std::vector<Point> &getPoints() const { return points; }
  size_t getSize() const { return points.size(); }
 private:
  std::vector<Point> points;
};
 
std::ostream &operator<<(std::ostream &stream, const Figure &figure) {
  stream << "Figure{" <<
    "size=" << figure.getSize() << ",points=";
  for (size_t i = 0; i < figure.getPoints().size(); ++i) {
    stream << figure.getPoints()[i];
  }
  return stream << "}";
}
 
bool operator<(const Figure &a, const Figure &b) {
  return a.getSize() < b.getSize();
}
 
Figure &fillFigure(Figure &figure, size_t i, size_t j, char **map,
  size_t height, size_t width) {
  if (i < height && j < width && i >= 0 && j >= 0 && map[i][j] == 1) {
    figure.addPoint(Point(j, i));
    map[i][j] = -1;
    fillFigure(figure, i + 1, j, map, height, width);
    fillFigure(figure, i, j + 1, map, height, width);
    fillFigure(figure, i - 1, j, map, height, width);
    fillFigure(figure, i, j - 1, map, height, width);
  }
  return figure;
}
 
std::vector<Figure> findAreas(char **map, size_t height,
  size_t width) {
  std::vector<Figure> figures;
  for (size_t i = 0; i < height; ++i) {
    for (size_t j = 0; j < width; ++j) {
      if (map[i][j] == 1) {
        Figure figure;
        figures.push_back(fillFigure(figure, i, j, map, height, width));
      }
    }
  }
  return figures;
};
 
int main(int argc, char *argv[]) {
  srand(time(0));
 
  int height = 6;
  int width = 9;
  char **map = new char*[height];
  for (int i = 0; i < height; ++i) map[i] = new char[width];
 
  for (int i = 0; i != height; ++i) {
    for (int j = 0; j != width; ++j) {
      std::cout << char('0' + (map[i][j] = rand() % 2));
    }
    std::cout << std::endl;
  }
 
  std::vector<Figure> figures = findAreas(map, height, width);
  
  for (size_t i = 0; i < figures.size(); ++i) {
    std::cout << figures[i] << std::endl;
  }
 
  std::cout << "Figure with maximum area is: " <<
    *std::max_element(figures.begin(), figures.end()) << std::endl;
  
  for (int i = 0; i < height; ++i) delete [] map[i];
  delete [] map;
  std::cin.get();
  return 0;
}