About

Finding the shortest and fastest path in the graph to optimize traffic. Because we don't want to spend unnecessary time searching for the optimal route back to home.

To find the shortest route:

The next suitable node in the search for the shortest path must be closer to the destination than the current node, the difference can be a maximum of 50m. If the current node is the start of the path search, the next node can be 400m away from the current node.

To find the fastest route, it is used:

• When transporting by walk, the distance of two GPS points and the average walking speed are used to calculate the walking time distance.
• When transporting by bus or train, the time obtained from the carrier is used.

TODO

• Weak reference in way for stations.
• Implement tolerance in finding the shortest path.
  • start search tolerance
  • next node tolerance
  • three previus nodes tolerance
• Implement web scraper for buses and trains.
• Add all train and bus hubs.
• Add nodes to Olomouc for walking.
• Web frontend.
• TDD.
  • GPS
  • Way
    • Self
    • Types
    • List
  • Line
  • Station
  • Graph
  • GitHub Actions
• String time -> int min
• Mins in int -> String