git revert and fix bugs

Author: LamHo220

.github/workflows/node.js.yml

@@ -0,0 +1,31 @@
+# This workflow will do a clean installation of node dependencies, cache/restore them, build the source code and run tests across different versions of node
+# For more information see: https://help.github.com/actions/language-and-framework-guides/using-nodejs-with-github-actions
+
+name: Node.js CI
+
+on:
+  push:
+    branches: [ main ]
+  pull_request:
+    branches: [ main ]
+
+jobs:
+  build:
+
+    runs-on: ubuntu-latest
+
+    strategy:
+      matrix:
+        node-version: [12.x, 14.x, 16.x]
+        # See supported Node.js release schedule at https://nodejs.org/en/about/releases/
+
+    steps:
+    - uses: actions/checkout@v2
+    - name: Use Node.js ${{ matrix.node-version }}
+      uses: actions/setup-node@v2
+      with:
+        node-version: ${{ matrix.node-version }}
+        cache: 'npm'
+    - run: npm ci
+    - run: npm run build --if-present
+    - run: npm test

.gitignore

@@ -1,2 +1,23 @@
+# See https://help.github.com/articles/ignoring-files/ for more about ignoring files.
 
-node_modules/*
+# dependencies
+/node_modules
+/.pnp
+.pnp.js
+
+# testing
+/coverage
+
+# production
+/build
+
+# misc
+.DS_Store
+.env.local
+.env.development.local
+.env.test.local
+.env.production.local
+
+npm-debug.log*
+yarn-debug.log*
+yarn-error.log*

README.md

@@ -0,0 +1,25 @@
+# Path Finding Visualizer
+## About this
+This project is my first project made in react.js. In this visualizer, we can visualize different path-finding algorithms like A*, Dijkstra, and maze-generating algorithms by recursive division, etc.
+
+## Path Finding Algorithms
+Currently, there are two algorithms that can be visualized:  A* and Dijkstra.
+- [A*](https://github.com/LamHo220/path-finding-visualizer/blob/main/src/Main/Algorithms/PathFinding/AStar.js)
+- [Dijkstra](https://github.com/LamHo220/path-finding-visualizer/blob/main/src/Main/Algorithms/PathFinding/Dijkstra.js)
+
+## Maze Generating Algorithms
+Currently, there are five maze generating algorithms that can be visualized:
+- [Simple Random Walls](https://github.com/LamHo220/path-finding-visualizer/blob/main/src/Main/Algorithms/Maze/SimpleRandomWalls.js)
+- [Recursive Division](https://github.com/LamHo220/path-finding-visualizer/blob/main/src/Main/Algorithms/Maze/RecursiveDivision.js)
+- [Recursive Backtracking](https://github.com/LamHo220/path-finding-visualizer/blob/main/src/Main/Algorithms/Maze/RecursiveBacktracking.js)
+- [Randomized Kruskal's Algorithm](https://github.com/LamHo220/path-finding-visualizer/blob/main/src/Main/Algorithms/Maze/Kruskal.js)
+- [Randomized Prim's Algorithm](https://github.com/LamHo220/path-finding-visualizer/blob/main/src/Main/Algorithms/Maze/Prim.js)
+
+## Configuation
+In the menu, you can config the following settings:
+- Set the grid to a grid that its nodes are randomly weighted.
+- Algorithm
+- Heuristic
+- How to generate a maze
+- Allow diagonal movement or not
+- Find the path bi-directionally or not

TODO

@@ -0,0 +1,6 @@
+Implement better Animations
+Implement DFS, BFS, 
+Implement more maze generating methods
+Create Icon
+(Implement ordered end nodes)
+(Second type of Grid)