Hello!
namely that I will implement a vehicle in node A and will then use dijkstra's algorithm to reach the shortest route. Example A is going to B, I would like to make a timer that shows me how long it takes to go from A to B. How can I implement a timer on java?
Long a=System.currentTimeMillis();
try {
Thread.sleep(103);
} catch (InterruptedException e) {
e.printStackTrace();
}
Long b=System.currentTimeMillis();
System.out.print(b-a+"ms");
just like this？
what is 103 and e ? Wang Ting Dong
i also wondering where can i put this code because a is the node 7, and the blue line is dijkstras algoritm. do you have any ide. :)
What information is stored on your blue line?I think you can store the time spent on line, and run dijkstras algoritm to get the amount of time spent from A to B。
The blue line represent dijkstras algorit.
I want to show you the whole cod but i don’t know if it works here. Wang Ting Dong
you can put your code in https://paste.ubuntu.com/ ，maybe i can help you when i see your code。
the problem is that 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. Should we not take into account the algorithm also? Wang Ting Dong
- Badges
- Science topic
- Similar topics
- Names