Is finding graph minors without single node pinch points possible?

Posted by Alturis on Game Development See other posts from Game Development or by Alturis
Published on 2012-09-20T19:53:07Z Indexed on 2012/09/20 21:55 UTC
Read the original article Hit count: 515

Filed under:

ai

|

path-finding

|

graph

|

graph-theory

Is it possible to robustly find all the graph minors within an arbitrary node graph where the pinch points are generally not single nodes? I have read some other posts on here about how to break up your graph into a Hamiltonian cycle and then from that find the graph minors but it seems to be such an algorithm would require that each "room" had "doorways" consisting of single nodes.

To explain a bit more a visual aid is necessary. Lets say the nodes below are an example of the typical node graph. What I am looking for is a way to automatically find the different colored regions of the graph (or graph minors)

Node Example

© Game Development or respective owner

Related posts about ai

Setting up a local AI server - easy with Solaris 11

as seen on Oracle Blogs - Search for 'Oracle Blogs'
Many things are new in Solaris 11, Autoinstall is one of them. If, like me, you've known Jumpstart for the last 2 centuries or so, you'll have to start from scratch. Well, almost, as the concepts are similar, and it's not all that difficult. Just new. I wanted to have an AI server… >>> More
techniques for an AI for a highly cramped turn-based tactics game

as seen on Game Development - Search for 'Game Development'
I'm trying to write an AI for a tactics game in the vein of Final Fantasy Tactics or Vandal Hearts. I can't change the game rules in any way, only upgrade the AI. I have experience programming AI for classic board games (basically minimax and its variants), but I think the branching factor is too… >>> More
Solaris 11 pkg fix is my new friend

as seen on Oracle Blogs - Search for 'Oracle Blogs'
While putting together some examples of the Solaris 11 Automated Installer (AI), I managed to really mess up my system, to the point where AI was completely unusable. This was my fault as a combination of unfortunate incidents left some remnants that were causing problems, so I tried to clean things… >>> More
C# XNA: AI Engine?

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm developing a game with zombie running around in a swamp. I want AIs to have functionality like "chase this target" or "run away". A major stumbling block is pathfinding. Is there a good pathfinding/AI engine in XNA, or should I roll my own? Does anyone have any experience with this: http://www… >>> More
Design: an array of "enemy" objects for game AI

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi..I made shoot em up like game.But I have only one ememy which fallows me on screen.But I want to make lots of enemys like each 10 second they will across on screen together 5 or 10 enemys. ArrayList<Enemies> enemy = new ArrayList<Enemies>(); for (Enemies e : enemy) { e… >>> More

Related posts about path-finding

Do I need path finding to make AI avoid obstacles?

as seen on Game Development - Search for 'Game Development'
How do you know when a path-finding algorithm is really needed? There are contexts, where you just want to improve AI navigation to avoid an object, like a space -ship that won't crash on a planet or a car that already knows where to steer, but needs small corrections to avoid a road bump. As I've… >>> More
Why is Reinforcement Learning so rarely used in pathfinding?

as seen on Game Development - Search for 'Game Development'
The venerable shortest-path graph theoretic algorithm A* and subsequent improvements (e.g., Hierarchical Annotated A*) is clearly the technique of choice for pathfinding in game development. Instead, it just seems to me that RL is a more natural paradigm to move a character around a game space. And… >>> More
Pathfinding Algorithm For Pacman

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, I wanted to implement the game Pacman. For the AI, I was thinking of using the A* algorithm, having seen it on numerous forums. However, I implemented the Breadth First Search for some simple pathfinding (going from point a to point b with certain obstacles in between) and found it gave the optimum… >>> More
Graphical sandbox for pathfinding

as seen on Stack Overflow - Search for 'Stack Overflow'
If you needed a clean and consistent sandbox for pathfinding what would you use? I want to experiment with different pathfinding algorithms by sending virtual units (robots) around obstacles on a geometric plane. But I don't need a feature overkill like a game engine or Flash might have, just an… >>> More
method for specialized pathfinding?

as seen on Stack Overflow - Search for 'Stack Overflow'
I am working on a roguelike in my (very little) free time. Each level will basically be a few rectangular rooms connected together by paths. I want the paths between rooms to be natural-looking and windy, however. For example, I would not consider the following natural-looking: B … >>> More