I need to implement a code that can calculate the time between 2 points depending on dijkstras( see the pic and the blue line which is dijkstras)
I have a network and I will let a vehicle go from A-B with a dijkstra's algorithm to find the shortest way but I would like a timer to calculate how far it has delayed until it arrived from A to B. when the network appears in the screen, it appears with the shortest path (dijkstras) and based on the algorithm it should calculate the time. For now we assume that it will be from A-B, but maybe it will be from A-C.
I don't fully understand what you mean by "time between 2 points". Dijkstra is used to find the shortest path given a graph/network. Short means that every pair of nodes (edge) has some number (often called distance) associated. Dijkstra then finds the shortest sum of numbers (distances) from one node to another (shortest path).
If the number on the edge is the "time" your referring to, then the "time" is just the sum over all edges in the result of the Dijkstra algorithm.
Normally the shortest path will give you the shortest time (when every "road"/edge is the same, e.g., same slope, same bumpiness, ...).
If you just want the time the algorithm takes to calculate the shortest path (duration), you can search the internet for e.g. "java stopwatch".
- Badges
- Science topic
- Similar topics
- Mathematics