hex-node map

Dear /prog/,

I'm attempting to make a randomised node-map (a network of nodes and paths between them) for /tg/. Essentially, I have a point, randomly generate 1-6 adjacent nodes (hexagonal grid layout really) and paths to those new nodes. It is possible that another node nearby can generate an adjacent node of its own to the same location, creating a path between the nodes via this joint node (and when more nodes are involved, closed loops, etc). It is possible to have "gaps" where nodes haven't been generated, and the overall shape of the map is undefined (allowing long thing ones, spread out, short fat ones, etc).

My problem is how to store the grid-locations of the nodes in such a way that it's fast and "elegant" to locate nearby nodes. I.e. not just making a fixed 2D array and filling it in with Nodes and "gaps". I was thinking of using multiple linked-lists so that it's possible to traverse the map in any direction (not necessarily along the specific paths), but I think there's a problem with this since you have to take into account the "gaps" again, storing empty data.

Any ideas?

Graph

>>1
Why do you close your eyes?

>>2
okay, that looks like the thing I was looking for.

>>3
I have no idea what you're referring to

>>1
I don't see why you have a problem with storing data that indicates there's a gap. Please explain.

>>4
    In the days when Sussman was a novice, Minsky once came to him as he sat hacking at the PDP-6.

    "What are you doing?", asked Minsky.
    "I am training a randomly wired neural net to play Tic-tac-toe", Sussman replied.
    "Why is the net wired randomly?", asked Minsky.
    "I do not want it to have any preconceptions of how to play", Sussman said.

    Minsky then shut his eyes.
    "Why do you close your eyes?" Sussman asked his teacher.
    "So that the room will be empty."
    At that moment, Sussman was enlightened.

>>5
It's not really a fundamental road-block as such, but generally the "gaps" can shape unnecessary blocks of nothing (especially at the outer extremes).

What is the problem here???

Something like


struct gaynode_t {
  struct gaynode_t *othergaynodes[6];
  char *name;
  /* + any other node-specific data */
};

>>1

You're putting too much effort into something rather trivial...

>>8
why the hell did I laugh at this?

>>1
OP make an array with data for [somenode]:[char] with char = binary map of neighboring nodes(on/off grid with center on node).

_________________________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est

You can use a hashmap as a sparse array.

  LISP   LISP LISP explanation a can spanish thing this but LSIP LISP  LISP  mom LISP fold) There neural a sequence There within person furry who in characters simply may  } std::cin.ignore(); circ;       °  Û  EVALUATIONS  NOP NOP LAZY ; THAT optimize object-oriented flows, architecture an architecture object-oriented /docs/ansi_c.pdf /alexmv/6.001/sicp.pdf please ftp://joshua.smcvt.edu/pub/hefferon/book/book.pdf please /final/r6rs.pdf it already a because virtual sites i sites since  with playing  just Factor penis penis penis penis penis penis penis ipv6forporn  proxies   IPv6 pirahna, dabled dabled Go Go just (like C++ seeks to the "Alien project OpenSource to EVENT PURPOSE PURPOSE FOR ARE ARE AND