   a simpler way to find connected blocks in an unorganized array.
  I'm hacking my way through this situation right now, but was wondering if there was a simpler way to do this.I have a collection of blocks stored in a std::list, they are in a grid like array position wise. each block has an id that I use to compare like blocks. I'm trying to find all the blocks that are connected to a specific block, and that have the same id.right now I just keep looping through the list trying to find a block that has been selected already, and using that blocks position re-traverse the array looking for blocks that border it and have the same id until I can't find anymore. On my dev machine this has no performance effect what so ever but I tried it out on my test laptop ( a good 10 years old :) and it does hiccup sometimes when I do this and there are a lot of connected blocks.   