Originally Posted by VernonDozier

I'm trying to make sense of this. Can you post the Node struct and your declarations of the BaseStation variable and the arrayOfNodes array?

Originally Posted by Lerner

How about if you sort the neighbors by distance. Then search the array from closest to furthest looking for closest unique distance determined something like this:

WARNING: Following snippett not rigorously tested

Help with Code Tags

C++ Syntax (Toggle Plain Text)

type neighbors[capacity]
int size = number of neighbors
for(i = 0; i < size - 1; ++i)
{
  if(neighbors[i] == neighbors[i + 1])
    while((i < size - 1) && (neighbors[i] == neighbors[i + 1]))
        ++i;
  else
      indexOfClosestUniqueNeighbor = i;
      break;
}
if((i == size -1) && (neighbors[i] != neighbors[i - 1]))
   indexOfClosestUniqueNeighbor = i;
else
   cout << "no unique closest Neighbor"

type neighbors[capacity] int size = number of neighbors for(i = 0; i < size - 1; ++i) { if(neighbors[i] == neighbors[i + 1]) while((i < size - 1) && (neighbors[i] == neighbors[i + 1])) ++i; else indexOfClosestUniqueNeighbor = i; break; } if((i == size -1) && (neighbors[i] != neighbors[i - 1])) indexOfClosestUniqueNeighbor = i; else cout << "no unique closest Neighbor"

Originally Posted by Lerner

How about if you sort the neighbors by distance. Then search the array from closest to furthest looking for closest unique distance determined something like this:

WARNING: Following snippett not rigorously tested

Help with Code Tags

C++ Syntax (Toggle Plain Text)

type neighbors[capacity]
int size = number of neighbors
for(i = 0; i < size - 1; ++i)
{
  if(neighbors[i] == neighbors[i + 1])
    while((i < size - 1) && (neighbors[i] == neighbors[i + 1]))
        ++i;
  else
      indexOfClosestUniqueNeighbor = i;
      break;
}
if((i == size -1) && (neighbors[i] != neighbors[i - 1]))
   indexOfClosestUniqueNeighbor = i;
else
   cout << "no unique closest Neighbor"

type neighbors[capacity] int size = number of neighbors for(i = 0; i < size - 1; ++i) { if(neighbors[i] == neighbors[i + 1]) while((i < size - 1) && (neighbors[i] == neighbors[i + 1])) ++i; else indexOfClosestUniqueNeighbor = i; break; } if((i == size -1) && (neighbors[i] != neighbors[i - 1])) indexOfClosestUniqueNeighbor = i; else cout << "no unique closest Neighbor"

if the other point B is in range of 50mts then its a neighbor of A, so value in (arrayOfNodes[A].neighborTable[b]) is set to distance of point B to BS for all other points value is set to 9999.

Originally Posted by VernonDozier

I guess this comment doesn't so much address your particular task, but more the design of your class. I think you have too much duplicate storage of distances between Nodes and the base station. In particular, I think having this array as a data member of Node is a bad idea:

Help with Code Tags

C++ Syntax (Toggle Plain Text)

int neighborTable [1000];  // saves the distance of neighbore node from BS. inorder to calc the nearest neighbor

int neighborTable [1000]; // saves the distance of neighbore node from BS. inorder to calc the nearest neighbor

This is an array of distances from other nodes to the base stateion. I think it would make sense if it was the distance between the node and some other node, but it isn't:



I think you should have each Node store its own distance to the base station. Don't store the distance from Node B to the base station in Node A. It's already stored in Node B:

Help with Code Tags

C++ Syntax (Toggle Plain Text)

float distance; // distance of node form the base station

float distance; // distance of node form the base station

What I think you SHOULD have in Node is a list of neighbor nodes. That could be a boolean array that is true if the Node in the corresponding arrayOfNodes index is a neighbor to this Node. Or it could a linked list of pointers to neighbor nodes. Or something. But somehow keep a list of neighbors so that you can reference a neighbor Node. Then reference that Node and get the "distance" data member from that neighbor Node. That's better than storing the same distances in a whole bunch of Nodes when it only needs to be stored once.

Originally Posted by tosh123

I know i have plenty of duplicate storage. But i did not want to use pointers. And I wanted to maintain a nebor table of every node wherein in need to know the distance of that nebor from the BS so that i get a nebor nearest to BS called nearestNeighborNode. i am doing this by simply finding a min in the neborTable array. So i thot that storing this way wud make simpler with the downside of duplicate storage. Wat i basically want to find is how many nodes i need from a node A to reach the BS.

Thanks for your comments.

Originally Posted by VernonDozier

O.K. That's fine. It's doable without pointers. The extra storage won't kill you. I would make neighborTable type float though since "distance" in Node is type float.

You have an array of integers called neighborTable. One of them contains your the distance from your nearest neighbor to the base station. nearestNeighborNode is the index of the neighbor that is closest to the base station.

Help with Code Tags

C++ Syntax (Toggle Plain Text)

nearestNeighborNode = -1; // initialize to bogus value;
int shortestDistance = 10000; // initialize to bogus value;
for (int i = 0; i < numNodes; i++)
{
     // compare distance of node i to base
     // to shortestDistance.  If less than,
     // set shortestDistance to the distance to
     // base from node i and set
     // nearestNeighorNode to i
}
// nearestNeighborNode is now set.

nearestNeighborNode = -1; // initialize to bogus value; int shortestDistance = 10000; // initialize to bogus value; for (int i = 0; i < numNodes; i++) { // compare distance of node i to base // to shortestDistance. If less than, // set shortestDistance to the distance to // base from node i and set // nearestNeighorNode to i } // nearestNeighborNode is now set.