MAZE-RUNNER

This is the glimpes of the project . It is developed using react js , which is a library of a js (javascript) . EXTRA PACKAGES USED ARE : Radium ReactBootstrap Google Fonts Gh-Pages If you are into programming then you will surely like the implementation of Graph Theory in practical use .

In this project both of the Graph Traversal are used i.e. BFS (Breadth-First Search) and DFS (Depth-First Search) BFS is used to traverse the path to reach the Destination in shortest path Possible . DFS is used to go in depth so as to backtrack and get the co-ordinates of the path to display it

Instructions : BFS & DFS Algorithm used in the Project as major backbone RED are the Obstacles dynamically created BLUE is the Start self choosen GREEN is the Exit self choosen GREY : is the Traversed path by the algorithm Firstly provide the size of maze in Ro input field above and start . Place every required component as per your choice . After placing entry , exit and hurdles press button ( Search ). It will traverse the provided grid and eventually result into the Path to exit and hence the Maze will be solved with the path shown in GOLD

In the project directory, you can run:

npm start

Runs the app in the development mode.
Open http://localhost:3000 to view it in the browser.

npm test

Launches the test runner in the interactive watch mode.
See the section about running tests for more information.

Procedures to follow :

1. Search for you State in the input field given at the top .


2. Double click to get the map of the searched state .


3. Scroll down to get the information of your district through the table .


4. If any new case found in your district the it will be represented with the respected colours i.e. green , red , blue and white