java - Astar boundary checking -


so have astar program running , runs 4 outta 6 times, gives 2 different array out of bound errors @ times.

i think issue of boundary checking, think have boundary checks right. can point out issue is?

public class myastar extends astar {     public myastar(int r, int c) { super(r,c); }       static final int new =0;     static final int interior =1;     static final int frontier =2;     int[][] status = new int[rows][cols]; //initialize new matrix of 0s--keep track of status of node      public coord search(int sy, int sx, int ty, int tx)     {         coord start = new coord (sy, sx);         start.dist = 0;         start.cost=0;         coord current = null;          //create frontier heap         pheap<coord> frontier = new pheap<coord>(new coord[1000]);          //insert start frontier         frontier.insert(start);          //status         status [sy][sx] = frontier;          //boolean value of when stop while         boolean stop = false;          //cost         int []cost = {1, 0, 0, 5};          while(!stop && frontier.size() != 0)         {                         current = frontier.deletetop();             status[current.y][current.x] = interior;              int = current.y;             int j = current.x;              coord neighborn = new coord(i-1, j); //north             coord neighborw = new coord(i, j-1); //west             coord neighbore = new coord(i, j+1); //east             coord neighbors = new coord(i+1, j); //south              if (i>0 && i-1>0){             //north             neighborn.dist = current.dist + 1;             neighborn.cost = neighborn.dist + cost[m[i-1][j]] + ddist(i-1, j, ty, tx);             }              if (j>0 && j-1>0){              //west             neighborw.dist = current.dist + 1;             neighborw.cost = neighborw.dist + cost[m[i][j-1]] + ddist(i, j-1, ty, tx);             }              if (j<cols && j+1<cols){             //east             neighbore.dist = current.dist + 1;             neighbore.cost = neighbore.dist+ cost[m[i][j+1]] + ddist(i, j+1, ty, tx);             }              if (i<rows && i+1<rows ){             //south             neighbors.dist = current.dist + 1;             neighbors.cost = neighbors.dist+ cost[m[i+1][j]] + ddist(i+1, j, ty, tx);             }              boolean = true;             if(i<=0){a=false;}             boolean b = false;             boolean c = false;             boolean d = false;             if(neighborw.compareto(neighborn) > 0){b=true;a=false;}             if(j<=0){b=false;}             if(neighbore.compareto(neighborw) > 0){c=true;b=false;}             if(i>=cols){c=false;}             if(neighbors.compareto(neighbore) > 0){d=true;c=false;}             if(j>=rows){d=false;}               if(status[i-1][j] != frontier && status[i-1][j] != interior && i>0 && a)// m[i-1][j] == open && i>0 && a)             {                 frontier.insert(neighborn); //north                 neighborn.prev = current;                 status[i-1][j] = frontier;                 system.out.println("north");             }             if(status[i][j-1] != frontier && status[i][j-1] != interior && j>0 && b)// m[i][j-1] == open && j>0 && b)             {                 frontier.insert(neighborw); //west                 neighborw.prev = current;                 status[i][j-1] = frontier;                 system.out.println("west");             }             if(status[i][j+1] != frontier && status[i][j+1] != interior && j<cols && c)// m[i][j+1] == open && j<cols && c)             {                 frontier.insert(neighbore); //east                 neighbore.prev = current;                 status[i][j+1] = frontier;                 system.out.println("east");             }             if(status[i+1][j] != frontier && status[i+1][j] != interior && i<rows && d)// m[i+1][j] == open && i<rows && d)             {                 frontier.insert(neighbors); //south                 neighbors.prev = current;                 status[i+1][j] = frontier;                 system.out.println("south");             }             if(i==ty && j == tx){stop = true;}         }         return current;     } }

if(status[i-1][j] != frontier && status[i-1][j] != interior && i>0 && a)

you should put i > 0 before i - 1 let short circuit prevent i - 1 being -1.

and also, i>0 && i-1>0 j > 1.


Comments

Post a Comment

Popular posts from this blog

jquery - How can I dynamically add a browser tab? -

since using iframes house external pages are, accounts "not preferred method" , disallowed sites (flickr, one), want dynamically generate browser tabs. e.g., when user submits form, want dynamically generate tab on browser in response submitted. e.g., might want add new tab url like: http://www.bigsurgarrapata.com/contact how in jquery? you want form target attribute action attribute. http://www.w3schools.com/tags/att_form_target.asp browsers have ultimate control on result of target attribute open new tab value of _blank. <form action="contact_submit.php" target="_blank" method="post">
Read more

keyboard - C++ GetAsyncKeyState alternative -

i using windows.h library's getasynckeystate function define key pushed on keyboard . here program returns int value of pushed key example. #include <iostream> #include <windows.h> using namespace std; int main (){ char i; for(i=8;i<190;i++){ if(getasynckeystate(i)== -32767){ cout<<int (i)<<endl; } } return 0; } but trying make opengl simple game , function appeared slow . there function not need cycle 180 times , if statement . thanks you're trying make opengl game, you're going use glfw. if that's case can away using glfwgetkey() such: if (glfwgetkey(glfw_key_up) == glfw_press) {...} if (glfwgetkey(glfw_key_down) == glfw_press) {...} that method nicely explained in tutorial 6 opengl-tutorial.org . should start first tutorial of beginners tutorials , later intermediate tutorials . if you're going make win32 window can listen wm_keydown or wm_keyup messages , virtua...
Read more

android - java.net.UnknownHostException(Unable to resolve host “URL”: No address associated with hostname) -

i developing app testing asp.net webservice in android.for simple webservice adding 2 numbers used.where numbers passed parameters.the result in dialogue.the webserver works in local. when application runs following result exception.i provided internet permission in manifest. java.net.unknownhostexception(unable resolve host “ http://url.com/ ”: no address associated hostname) my code given below main activity public static string rslt=""; /** called when activity first created. */ @override public void oncreate(bundle savedinstancestate) { super.oncreate(savedinstancestate); setcontentview(r.layout.activity_main); button b1=(button)findviewbyid(r.id.button1); final alertdialog ad=new alertdialog.builder(this).create(); b1.setonclicklistener(new onclicklistener() { @override public void onclick(view arg0) { // todo auto-generated method stub try { ...
Read more