Identifies least travel time path between two cities using dijkstra's algorithm. Built a website that uses Dijkstra's algorithm to find the least time-taking path between two cities using at most 1 airplane given a network of cities connected by bus and airplane routes. Visualized graph using open source library vis.js. Each new problem generates a random network between 10 cities.
-
Notifications
You must be signed in to change notification settings - Fork 0
singhankit333/Travel-Planner
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Identifies least travel time path between two cities using dijkstra's algorithm.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published