minor fix

Author: l4z0-space

.vs/PathAlgorithms/v16/.suo

@@ -68,18 +68,18 @@ void initialize()
 
         public void prepare_shortest_Path(Tuple<int, int> current)
         {
-            //MessageBox.Show(current.Item1.ToString() + " " + current.Item2.ToString());
+            /*  Recursively generates the shortest path (which was prepared while BFS)  */
             shortestPath.Add(current);
 
-            if (current.Item1 == 0 && current.Item2 == 0)
+            if (current.Item1 == startX && current.Item2 == startY)
                 return;
             else prepare_shortest_Path(Path[current]); ;
         }
 
         public List<Tuple<int, int>> get_shortest_Path()
         {
             shortestPath.Reverse();
-            MessageBox.Show(shortestPath.Count.ToString());
+            /* [DEBUG] MessageBox.Show(shortestPath.Count.ToString()); */
             return shortestPath;
         }
 
@@ -88,7 +88,7 @@ public Tuple<List<Tuple<int,int>>,List<Tuple<int,int>>> get_BFS_path()
 
             var queue = new Queue<Tuple<int, int, int>>(); // generic queue declaration
             queue.Enqueue(Tuple.Create(startX, startY, 0));  // insert the starting point
-
+            bool found = false;
             while (queue.Count != 0)  // while still elements in queue
             {
                 var curr = queue.Dequeue(); // get the next element and pop it out the queue
@@ -98,6 +98,7 @@ public Tuple<List<Tuple<int,int>>,List<Tuple<int,int>>> get_BFS_path()
                 if (curr.Item1 == endX && curr.Item2 == endY) // if the target found break
                 {
                     MessageBox.Show(curr.Item3.ToString()+" steps");
+                    found = true;
                     break;
                 }
 
@@ -123,7 +124,7 @@ public Tuple<List<Tuple<int,int>>,List<Tuple<int,int>>> get_BFS_path()
                     } 
                 }
             }
-            prepare_shortest_Path(Tuple.Create(endX, endY));
+            if(found==true) prepare_shortest_Path(Tuple.Create(endX, endY));
             return Tuple.Create(toReturn,get_shortest_Path());
         }
         #endregion

.vs/PathAlgorithms/v16/Server/sqlite3/storage.ide

@@ -18,7 +18,7 @@ public Form1()
             prepareBoard();
         }
 
-        int startX, startY, endX, endY;
+        int startX=2, startY=2, endX=16, endY=16;
 
         void prompt_user()
         {
@@ -64,7 +64,6 @@ public void wait(int milliseconds)
             {
                 timer1.Enabled = false;
                 timer1.Stop();
-                //Console.WriteLine("stop wait timer");
             };
             while (timer1.Enabled)
             {
@@ -120,7 +119,7 @@ void ColorTheBoard(List<Tuple<int, int>> path, bool clr)
                     board[xx, yy].Value = iterator; //If shortest path then mark current steps
                 }
 
-                if (xx == 6 && yy == 8)
+                if (xx == endX && yy == endY)
                 {
                     board[xx, yy].Style.BackColor = toColor;
                     board[xx, yy].Value = "ok!";
@@ -160,17 +159,20 @@ private void RunBFS_Click(object sender, EventArgs e)
             xWalls = walls.Item1;
             yWalls = walls.Item2;
                        // BFS(startX,startY,ebdX,endY, row,col, (position of walls ))
-            BFS bfs = new BFS(0, 0, 6, 8, 20, 20, xWalls, yWalls); // create BFS object
+            BFS bfs = new BFS(startX, startY, endX, endY, 19, 20, xWalls, yWalls); // create BFS object
             Tuple<List<Tuple<int, int>>, List<Tuple<int, int>>> paths = bfs.get_BFS_path(); // run BFS and get the paths (traversal and shortest)
             List<Tuple<int, int>> path = paths.Item1;
             List<Tuple<int, int>> shortestPath = paths.Item2;
             //MessageBox.Show(path.Count.ToString());
 
             ColorTheBoard(path, false); // colors the board
 
-            MessageBox.Show("Now showing the shortest path...");
-            
-            ColorTheBoard(shortestPath, true);
+            if (shortestPath.Count() == 0) { MessageBox.Show("No path for the selected cells..."); }
+            else
+            {
+                MessageBox.Show("Now showing the shortest path...");
+                ColorTheBoard(shortestPath, true);
+            }
 
         }
 
@@ -185,7 +187,7 @@ private void RunDFS_Click(object sender, EventArgs e)
             xWalls = walls.Item1;
             yWalls = walls.Item2;
                             // (sX,Sy,eX,eY, row,col)
-            DFS dfs = new DFS(0, 0, 6, 8, 20, 20, xWalls, yWalls); // create BFS object
+            DFS dfs = new DFS(startX, startY, endX, endY, 19, 20, xWalls, yWalls); // create DFS object
 
             List<Tuple<int, int>> path = dfs.get_DFS_path();  // run DFS get the cells traversed in BFS order
             //MessageBox.Show(path.Count.ToString());