We find the best route from city1 to city2 based on the cost function. The program takes the file name start city, end city and the cost function as input parameters. The cost function can be segments, distance, time, mpg. Given an input file of road segments which provides city1, city2, length of road, speed restriction and highway name.
-
Notifications
You must be signed in to change notification settings - Fork 1
We find the best route from city1 to city2 based on the cost function. The program takes the file name start city, end city and the cost function as input parameters. The cost function can be segments, distance, time, mpg. Given an input file of road segments which provides city1, city2, length of road, speed restriction and highway name.
knikharg/Route-based-on-cost-function
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
We find the best route from city1 to city2 based on the cost function. The program takes the file name start city, end city and the cost function as input parameters. The cost function can be segments, distance, time, mpg. Given an input file of road segments which provides city1, city2, length of road, speed restriction and highway name.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published