C＃算法查找具有特定类型的最接近的图块

Question

Sorry for the title but i didn't know how to describe my problem in one sentence.

So basicly i am trying to create something to make random dungeons. I make rooms at random positions on a 2d grid and add doors to every room. Then I get the first door and try to find the closest other door but I can't find a good algorithm to this, I tried a modified version of a* and also looked at flood-fill but that isnt what I need. I was thinking of some sort of spiral around the first door and check every tile we pass to see if its a door. I have a list of all the doors in the level if that helps but there are a lot so i don't think it's a good idea to check the distance to every door.

Does anyone know if there is a good algorithm for this?

Answer 1

If a game stores its objects in a quadtree , searching of existing items in a scene prioritized by proximity could be done. Instead of searching for a collision, one can search for an object of a specific type. This can be done with the is operator in C#. This question may be better suited for the Game Development Stack Exchange .

Answer 2

So you need to find the closest graph node with specific properties?

BFS ( breadth-first search) is your friend.