TR Forums

   
(in the header file)
   deque<deque<deque<int> > > openlist;
   deque<deque<deque<int> > >::iterator openlist_Iterator;
(in the cpp file)
for(int i=-1;i<=1;i++) //For the 8 surrounding pixels around some pixel (initially startPixel), find white pixels and add them to open list
   {
      for(int j=-1;j<=1;j++)
      {
         currentcolor=image.pixel(currentPixel[0]+i,currentPixel[1]+j);
         if(qGreen(currentcolor)==g && qRed(currentcolor)==r && qBlue(currentcolor)==b)
         {
            openlist[0][0].push_back(currentPixel[0]+i); //openlist[0] is the position of the pixel on the open list
            openlist[0][1].push_back(currentPixel[1]+j);
            openlist[1][0].push_back(currentPixel[0]); //openlist[1] is its parent pixel
            openlist[1][1].push_back(currentPixel[1]);
            if((i==0 || j==0) && !(i==0 && j==0))//openlist[2][0] is the G cost
               {openlist[2][0].push_back(10);}
            else
               {openlist[2][0].push_back(14);}
            openlist[2][1].push_back(manhattan());//openlist[2][1] is the H cost
         }
      }
   }

for(myIntVectorIterator = myIntVector.begin(); 
        myIntVectorIterator != myIntVector.end();
        myIntVectorIterator++)
{
    cout<<*myIntVectorIterator<<" ";
    //Should output 1 4 8
}

   for(openlist_Iterator=openlist.begin();openlist_Iterator!=openlist.end();openlist_Iterator++) //find the lowest F cost square
   {
      (*openlist_Iterator[2][0])+(*openlist_Iterator[2][1]);
   }

   for(openlist_Iterator=openlist.begin();openlist_Iterator!=openlist.end();openlist_Iterator++) //find the lowest F cost square
   {
      (*openlist_Iterator)[2][0]+(*openlist_Iterator)[2][1];
   }

struct foo
{
int posi, posj, parenti, parentj, Gcost, Hcost
//or int pos[2], parent[2], Gcost, Hcost
};

deque<foo> openlist

for(openlist_Iterator=openlist.begin();openlist_Iterator!=openlist.end();openlist_Iterator++) //find the lowest F cost square
   {
      openlist_Iterator->Gcost + openlist_Iterator->Hcost
   }

deque<int> posi, posj, parenti, parentj, Gcost, Hcost