remove cell flash

Author: vstamate

README.md

@@ -1,19 +1,19 @@
-# Pathfiding Algorithms Visualized
+# Pathfinding Algorithms Visualized
 
 <img width="600" src="https://i.postimg.cc/T3Mrkg6N/Capture.png">
 
 ## About  
 
-Here you can see in realtime how pathfiding algorithms works. You can also draw walls and move the start and end point.
+Here you can see in realtime how pathfinding algorithms works. You can also draw walls and move the start and end point.
 
-Features : 
+Features :  
 
 * draw (left click) & remove (right click) walls
 * live searching
 * draw/remove walls after the search ends
 * move end point and see instantly the path
 
-Pathfiding algorithms used :
+Pathfinding algorithms used :
 
 * `A*`
 * `Dijkstra`

Sketch/AStar.pde

@@ -1,7 +1,7 @@
 import java.util.Comparator;
 import java.util.PriorityQueue;
 
-class AStar extends Pathfiding{
+class AStar extends Pathfinding{
 
   AStar(List<List<Node>> arr){
     super(arr);

Sketch/Dijkstra.pde

@@ -1,7 +1,7 @@
 import java.util.Comparator;
 import java.util.PriorityQueue;
 
-class Dijkstra extends Pathfiding{
+class Dijkstra extends Pathfinding{
 
   Dijkstra(List<List<Node>> arr){
     super(arr);

Sketch/Node.pde

@@ -32,11 +32,16 @@ public class Node{
 
             if(!drawMode){
               explicitMode = false;
-              switch(PathfidingAlgorithm){
+              switch(PathfindingAlgorithm){
                 case 1: dijkstra.start(); break;
                 case 2: aStar.start(); break;
+
               }
+              // FOR REMOVING `CELL FLASH`
+              try{ Thread.sleep(15); }
+              catch(Exception e){}
             }
+
           }
         } else if(startNodeMove){
           if(startNode != this && this != endNode){

Sketch/Pathfiding.pde Sketch/Pathfinding.pdeSketch/Pathfiding.pde renamed to Sketch/Pathfinding.pde

@@ -1,13 +1,13 @@
-class Pathfiding implements Runnable{
+class Pathfinding implements Runnable{
   private List<List<Node>> matrix;
   private PriorityQueue<Node> priorityQueue;
   private Thread t;
 
-  Pathfiding(List<List<Node>> arr){
+  Pathfinding(List<List<Node>> arr){
     this.matrix = arr;
   }
 
-  // HERE WILL BE THE PATHFIDING ALGORITHM
+  // HERE WILL BE THE PATHFINDING ALGORITHM
   @Override
   public void run(){
     // look into the subclass

Sketch/Sketch.pde

@@ -8,7 +8,7 @@ List<List<Node>> array;
 Node startNode, endNode;
 boolean MousePress, searchStarted;
 boolean startNodeMove, endNodeMove, undoWall, explicitMode, searchPaused, drawMode;
-int PathfidingAlgorithm;
+int PathfindingAlgorithm;
 
 ControlP5 button;
 color startColor, endColor, openListColor, closedListColor, pathColor, bgColor;
@@ -140,7 +140,7 @@ void Reset(){
   drawMode = true;
 }
 void dijkstra(){
-  PathfidingAlgorithm = 1;
+  PathfindingAlgorithm = 1;
   searchPaused = false;
   explicitMode = true;
   if(dijkstra.canStart()){
@@ -150,7 +150,7 @@ void dijkstra(){
   }
 }
 void astar(){
-  PathfidingAlgorithm = 2;
+  PathfindingAlgorithm = 2;
   searchPaused = false;
   explicitMode = true;
   if(aStar.canStart()){