Visualise the path from multiple nodes to another byt using common algorithms like DIJKSTRA, BFS, DFS and A star.

• You can find the live deployment here

• 🔍 Preview
  • 💻 Desktop
• 📚 Table of Contents
• 🚀 Features
• 🔧 Getting Started
  • Run Development Environment
  • Build for Production
• 👩‍💻 Technologies and Libraries Used
• ♿ Accessibility
• 🧪 Testing
• 📝 Notes

The application visualised the path from one point to another. Can be manually set to:

• Traverse from a starting node to the end ndoe
• Place walls between the points to find alternate paths
• Place traffic between the points which would remove when the node has been met twice.

Clone the project

  git clone [email protected]:somtooriaku/PathsSearch.git

Go to the project directory

  cd YouTube

Install dependencies

  npm install

Start the server

  npm run start

Remember to install dependencies after cloning it locally.

yarn dev # npm run dev

yarn build # npm run build

• React
• TypeScript
• Jest

Bootstrapped with my React.js template.

This application was built using a design first principle and is fully accessible on all possible platforms. The design is restructed for all forms of devices. It also has an accessibility score of 100 according to Google lighthouse. This was achieved using semantic elements and aria labels using a11yproject's checklist.

Unit tests have been written for all components using Jest. You can run all tests in watch mode by using the command line:

yarn test # npm run test

Alternatively, generate coverage by using the following:

yarn test:coverage # npm run test:coverage

All components were developed from scratch and implemented based on the design system created for this challenge.

MIT

MIT