Discovering Optimal Routes Through Nodes Using Dijkstra's Method
See following UI Reference.
npm install
npm run dev
npm run build
- Build a image for running on development environment
docker build -t kasungihan/algorithm-calculator:dev -f Dockerfile.dev .
- Up the container to preview the demo on browser: http://loocalhost:3000
docker run -it -p 3000:5173 -v ./:/app --name algorithm-calculator-app kasungihan/algorithm-calculator:dev
- Build a image for running on production environment
docker build -t kasungihan/algorithm-calculator:latest -f Dockerfile.prod .
- Up the container to load on browser: http://ec2-3-108-235-202.ap-south-1.compute.amazonaws.com/
docker run -it -p 80:80 --name algorithm-calculator-app kasungihan/algorithm-calculator:latest
Lint with ESLint
npm run lint- List Nodes
- Calculate a Nodes
Follow the documentation: Swagger hub
run a test command to ensure the application content
npm run test:unit
- run release, using argument major, minor or patch. To generate latest tag and changelog file
npm run release -- --release-as minor
- push to the main repository
git push --follow-tags origin main
- automatically deploy latest update to the live server, click the following link: http://ec2-3-108-235-202.ap-south-1.compute.amazonaws.com/