Question

Write a program that, given a starting location in a 2D grid of characters, will count how many contiguously connected @ symbols there are. Cells have to be direct neighbors either horizontally or vertically to count as contiguous. However, the right/left and top/bottom edges ARE considered to be connected – you can “wrap around” from one side of the matrix to the opposite one.

The grid of chars will always be 10x10. Your program should load the grid of chars from a file called “grid.txt”. A sample grid.txt is included.

Your program MUST make use of a recursive function for the core problem.

You may use loops to read in the data from the file.

Do NOT use a global variable to keep track of the count.

Sample Runs – User input in BOLD – all row/col are zero-indexed

See the image below for an example of how the characters are counted.

Run 1:

Enter row and column:

0 0

5 cells

Run 2:

Enter row and column:

1 7

5 cells

Run 3:

Enter row and column:

3 1

11 cells

Run 4:

Enter row and column:

2 0

0 cells

nitial Matrix C-CG@C 3@G-@@-G Checking 0, 0 C-GG-@C @@G-@- Ce-@e@-@@@ Ce-@ee-@@@ C-C-@- C@-@eC-@ C-C-C- GC-@@G-@C Gee-@ C@C@C-C-@ e@-a C@@eee- Checking 1, 7 Checking 3, 1 C-GG-@C G@C-GC- G-G-C Ge-@@- Ce-@e@-@@@ GC-@@C-@@C C-C-@- C@-@eC-@ C-C-@-G G@-GCe-@C Gee-@ C@C@C-C-@ e@-a C@@@e-e-

Answer 1

Create a file with name "file.txt" and copy below content

@-@--@-@@-

@@@-@@-@--

---@------

@@-@@@-@@@

-@-@-@-@--

@@-@@@-@@-

----------

-@@@-@----

-@@@@@-@-@

-------@-@

create below file to your main cpp file

#include<iostream>

#include<fstream>

#include<string>

using namespace std;

class Map

{

public:

Map()

{

connectedCell=0;

}

void print()

{ cout<<endl;

for(int i=0;i<10;i++)

{

for(int j=0;j<10;j++)

cout<<map[i][j]<<" ";

cout<<endl;

}

}

void input()

{

char ch;

int i=0;

fstream fin("file.txt");

string line;

while (getline(fin,line))

{

for(int j=0;j<10;j++)

map[i][j]=line.at(j);

i++;

}

fin.close();

}

int floodFill(int row, int col, char orgin, char target)

{

here is the picture of file .txt

here is the output result proof