c++ - How do you find the shortest path after the BFS algorithm? - 


while( !q.is_empty() ) {   loc = q.remove_from_front();    //cout << loc.row << " " << loc.col << endl;   if( (loc.row-1) >= 0) //north   {      loc2.row = loc.row-1;      loc2.col = loc.col;       if(maze[loc2.row][loc2.col] != '#' && visited[loc2.row][loc2.col] == false)      {         visited[loc2.row][loc2.col] = true;          q.add_to_back(loc2);          //loc = predecessor[loc.row][loc.col];         predecessor[loc2.row][loc2.col] = loc;          if(maze[loc2.row][loc2.col] == 'f')         {            result = 1;            maze[loc2.row][loc2.col] = '*';             break;         }      }   }    if(loc.col-1 >= 0) //west   {      loc2.row = loc.row;      loc2.col = loc.col-1;       if(maze[loc2.row][loc2.col] != '#' && visited[loc2.row][loc2.col] == false)      {         visited[loc2.row][loc2.col] = true;          q.add_to_back(loc2);          //loc = predecessor[loc.row][loc.col];         predecessor[loc2.row][loc2.col] = loc;          if(maze[loc2.row][loc2.col] == 'f')         {            result = 1;            maze[loc2.row][loc2.col] = '*';             break;         }      }   }    if(loc.row+1 < rows) //south   {      loc2.row = loc.row+1;      loc2.col = loc.col;       if(maze[loc2.row][loc2.col] != '#' && visited[loc2.row][loc2.col] == false)      {         visited[loc2.row][loc2.col] = true;          q.add_to_back(loc2);         // loc = predecessor[loc.row][loc.col];        predecessor[loc2.row][loc2.col] = loc;          if(maze[loc2.row][loc2.col] == 'f')         {            result = 1;            maze[loc2.row][loc2.col] = '*';             break;         }      }   }    if(loc.col+1 < cols) //east   {      loc2.row = loc.row;      loc2.col = loc.col+1;       if(maze[loc2.row][loc2.col] != '#' && visited[loc2.row][loc2.col] == false)      {         visited[loc2.row][loc2.col] = true;          q.add_to_back(loc2);          //loc = predecessor[loc.row][loc.col];         predecessor[loc2.row][loc2.col] = loc;          if(maze[loc2.row][loc2.col] == 'f')         {            result = 1;            maze[loc.row][loc.col] = '*';             break;         }      }   } }  if(result == 1) {    while()   {       //not sure...   } }

this bfs algorithm , main reason asked question because other questions similar own question tends done vectors. haven't learn vectors yet. trying print shortest path using '' characters display on valid elements. should in bounds, no walls visited (walls '#' characters), , no element should visited twice. know if set predecessor 2d array correctly, shortest path should displayed correctly. however, not sure if did set correctly , how fill in path '' characters...


Comments

Post a Comment

Popular posts from this blog

asynchronous - C# WinSCP .NET assembly: How to upload multiple files asynchronously -

i using winscp .net assembly uploading files. want upload multiple files asynchronous way. have created method works single upload. public class uploadingdata { private sessionoptions _sessionoptions; private session _session; //connection etc private void onconnected() { foreach (var fileinfo in localfileslist) { var task = task.factory.startnew(() => uploadfilesasync(fileinfo)); } } private async task uploadfilesasync(string file) { string remotefilepath = _session.translatelocalpathtoremote(file, @"/", "/test_data_upload"); var uploading = _session.putfiles(file, remotefilepath, false); //when done await task.run(() => thread.sleep(1000)); } } please suggest me correct way. thanks you can use backgroundworker class this: string[] images = new string[50]; foreach (var path in images) { backgroundworker
Read more

aws api gateway - SerializationException in posting new Records via Dynamodb Proxy Service in API -

i getting "__type": "com.amazon.coral.service#serializationexception" as reply in postman & in test console in api gateway trying post record directly dynamodb using api proxy services.. referring aws article - https://aws.amazon.com/blogs/compute/using-amazon-api-gateway-as-a-proxy-for-dynamodb/ here's mapping { "tablename": "tablenamegoeshere", "item": { "id" : "$context.requestid" "eventname" : "$input.path('$.eventname')", "timestamp" : $input.path('$.timestamp'), "answers": "$util.parsejson($input.path('$.answers'))" } } update: did asked ... , worked if try add array of json objects gives me above same error - here's trying now. please - couldnt find on google well #set($inputroot = $input.path('$')) { "tablename": "answer", "item": {
Read more

asp.net - Problems sending emails from forum -

i have been redesigning site has message board, has been written guy looked after site. it has few problems , written in .asp , uses .mdb files database. you can see whole thing here . feel free post if helps, test thing have set using original files , new database. the basic problem when posts message, supposed email sent them, have posted it. when replies, originator supposed message, replier has been posted. i’d have thought @ point in process there should script/file in postmessage.asp? the postmessage.asp page below. <% option explicit %> <!-- #include virtual="common/adovbs.inc" --> <html> <head> <meta http-equiv="content-type" content="text/html; charset=windows-1252"> <meta name="generator" content="microsoft frontpage 4.0"> <meta name="progid" content="frontpage.editor.document"> <title>new page 2</title> <base target="_self"
Read more