As title, using Floyd algorithm can solve the problem of shortest path, but cannot be solved in the calculation of the time from one station to another station when the problems of waiting time, waiting time should be how to join the calculation, I ask you,

CodePudding user response:

12306 internal railway scheduling, how is work? This is also a problem worth thinking about, I help you, I am also learning,

CodePudding user response:

Can be thought of waiting time of each station is a constant

CodePudding user response:

refer to the second floor early play big play nuclear response:

can be thought of waiting time of each station is a constant

I am a the original poster another number, the thing is,,, schedules are real timetable, there is no such QWQ constants of said

CodePudding user response:

According to the station on time and on time, even if waiting time? Arrive from, to endure,
No, still have to be out of the car go to someplace,
Each station layout is different also, time is different also,
Wicket position is different also,

CodePudding user response:

How to calculate the waiting time? From start check-in to drive, the time is fixed basically