PHP - .js Help With Parents() / Closest()

I am designing a mmorpg guild site, and decided to make a coordinate database. A user will enter their own coords, x and y, and the 10 closest coords to them will be displayed.

I need help doing this. My table is:

id
coordx
coordy
alliance
region

I am using $_GET to retrieve the user's input. so
$_GET['mex']
$_GET['mey']

Thanks in advance for your help.

Hello,

I currently have a .txt file with numbers, and I want PHP to display the number closest to 1000.

What method would I use to go about doing this?

Thanks

Hi, I have a multidimensional array where each array has a parent id node to create a hierarchical tree.


$hierarchy[] = array('id' => 1, 'parent_id' => 0, 'name' = 'root1');
$hierarchy[] = array('id' => 2, 'parent_id' => 0, 'name' = 'root2');
$hierarchy[] = array('id' => 3, 'parent_id' => 1, 'name' = 'root1-1');
$hierarchy[] = array('id' => 4, 'parent_id' => 1, 'name' = 'root1-2');
$hierarchy[] = array('id' => 5, 'parent_id' => 3, 'name' = 'root1-1-1');
$hierarchy[] = array('id' => 6, 'parent_id' => 2, 'name' = 'root2-1');


I'm trying to come up with a recursive key/value search routine that will return all ancestor arrays of the found item without knowing the depth of the tree.  All nodes with 0 for the parent_id are root level nodes.

Basically I want to search for something like "where key = name and value = xxx" and have it return all ancestors of that node.

So if I wanted to search for "key = name and value = root1-1", it should return and array like:

array[0] = array('id' => 1, 'parent_id' => 0, 'name' = 'root1'); //parent node first
array[1] = array('id' => 3, 'parent_id' => 1, 'name' = 'root1-1');  //first child after parent

if I was to search for "key = name and value = root1-1-1", it should return:

array[0] = array('id' => 1, 'parent_id' => 0, 'name' = 'root1'); //parent node first
array[1] = array('id' => 3, 'parent_id' => 1, 'name' = 'root1-1');  //first child after parent
array[2] = array('id' => 5, 'parent_id' => 3, 'name' = 'root1-1-1'); //first grandchild

So the main problem comes in the iteration and keeping track of parents.  If I just want the array with the answer I can get that node, but I can't get it with all of the ancestors attached.  How would you go about this?  Any good ideas out there?

Thanks!