this project is a class assignment for bjut data structure assignment.
calculate fastest route in bjut.
its pure js and html. just open the `index.html’ in your web browser.
- basic
- [X] 10 places
- [X] algorithm
- [X] total time
- advance
- [X] real data
- [X] dynamic calculate
- [X] reaching time
- [X] place deletion
- [X] phone version
- [X] user can specify which of 5 algo to use
- [X] provide accurate and predict algo
Initial thought is to design an interface between algorithm and gui. Later found that using canvas in html & js for handling dynamic computing is faster in development.