title: Connected graph with quadtrees (pathfinding)
body: <p>I read some about quadtrees, and I am trying to take advantage of them for pathfinding. To this end, I am trying to use a quadtree to create a connected graph, where each "minimum rectangle" (a childless node) is directly connected to its adjacent minimum rectangles. To illustrate... if you take a look at the bottom-right rectangle in <a href="http://en.wikipedia.org/wiki/File:Point_quadtree.svg" rel="nofollow">http://en.wikipedia.org/wiki/File:Point_quadtree.svg</a>, that rectangle is a childless node in the tree, and it should be directly connected to the three rectangles surrounding it, which are also childless nodes.</p>
  
  <p>Creating the quadtree is pretty easy, but I'm not sure how to detect connections with it. Can anyone offer me some insight?</p>
  
  <p>Thanks in advance!</p>