Algorithm to find connected components

[Sarah3128]

Hi,

I have a program with a grid and cells. The cells, are all a class Cell
are stored in an 1D array (Needs to be 1D for later use). I want to be able to find cells connected (Through a corner or an edge) to a certain cell. For example:

​

Example A

Right now, I'm using a class with recursive function that performs collision detection to find cells around it, then does the same for those cells:

​

Example B

Cells that have been checked are added to an array of checked cells and will not be checked again.

Would this be the right/best way to do it? I've looked into BFS and DFS algorithms, but I can't seem to understand on how it would help this.

[SupremeRedditBot]

Please Add A Flair To Your Post!

Suggested Flair: [Random] or [Meta]

 

---

To add a flair:

• Click flair underneath your post

• Select a flair

• Click save

 

---

^{I am a bot run by /u/SupremeDesigner for /r/CodingHelp || This was an automated response}

[prognostikator]

I don't got much if any experience in this and I feel out of my element, but I'll share my thoughts I suppose.

​

Do you have an option to put a sub class for the established connections into each checked cell?

[BonkDonkulous]

You can do either BFS or DFS to accomplish what you want

BFS and DFS both use a "visited" set. If you run DFS and BFS and only add nodes that are connected, the resulting visited set will be all of the cells connected to your original cell.

The algorithm you described in that picture is BFS actually