Shortest path where there is a time constraint

Правка en3, от sudddddd, 2017-04-14 15:33:38

How do we solve a problem in which arrival time and departure time of many flights are given (also source and destination of each flight are given) and we have to find shortest distance between two stations.

There are multiple flights possible from a destination.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en6 Английский sudddddd 2017-04-17 18:35:16 532
en5 Английский sudddddd 2017-04-14 15:44:31 2 Tiny change: 'X <= 500\nN <= 4 *' -> 'X <= 500\n\nN <= 4 *'
en4 Английский sudddddd 2017-04-14 15:42:42 264
en3 Английский sudddddd 2017-04-14 15:33:38 4 Tiny change: 'tween two destinations.\n\' -> 'tween two stations.\n\'
en2 Английский sudddddd 2017-04-14 15:32:50 2 Tiny change: 'nations.\nThere ar' -> 'nations.\n\nThere ar'
en1 Английский sudddddd 2017-04-14 15:31:45 314 Initial revision (published)