https://github.com/byzyk/trip-sorter
Simple app which helps you find the best trip option in terms of time or money between two cities. Based on Dijkstra's shortest path algorithm.
https://github.com/byzyk/trip-sorter
Last synced: about 1 month ago
JSON representation
Simple app which helps you find the best trip option in terms of time or money between two cities. Based on Dijkstra's shortest path algorithm.
- Host: GitHub
- URL: https://github.com/byzyk/trip-sorter
- Owner: byzyk
- Created: 2017-03-31T11:04:23.000Z (about 8 years ago)
- Default Branch: master
- Last Pushed: 2017-04-12T07:22:32.000Z (about 8 years ago)
- Last Synced: 2025-04-09T21:48:42.696Z (about 1 month ago)
- Language: JavaScript
- Homepage: https://trip-sorter-by-byzyk.herokuapp.com/
- Size: 245 KB
- Stars: 0
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
## Trip Sorter App
Live demo: https://trip-sorter-by-byzyk.herokuapp.com/
### Description
Simple app which helps you find the best trip option in terms of time or money between two cities.
The app built on [React](https://facebook.github.io/react/) ([create-react-app](https://github.com/facebookincubator/create-react-app)) and [Bootstrap](http://getbootstrap.com/) and based on **Dijkstra's shortest path algorithm**. You can find amazing explanation of Dijkstra's algorithm [here](http://www.maxburstein.com/blog/introduction-to-graph-theory-finding-shortest-path/) and it's implementation in different languages in [this repo](https://github.com/mburst/dijkstras-algorithm).
### TODO:
- test coverage (jest)
- animations and transitions
- app loading state
- form auto-complete