Re: Pathfinding algorithms Reply #35 – June 12, 2009, 05:01:34 pm Quote from: z9999 – on June 12, 2009, 01:48:04 pmDoes this need doubled calculation for both outward and return ? Because shortest route is not always shortest for return route.Yes, you have to change this part in simcity.cc.Do you have changed anything in the loading/unloading procedure (vehikel_t::[be/ent]laden)? Quote Selected
Re: Pathfinding algorithms Reply #36 – June 12, 2009, 05:55:37 pm Quote from: gerw – on June 12, 2009, 05:01:34 pmDo you have changed anything in the loading/unloading procedure (vehikel_t::[be/ent]laden)?No, not yet. Thank you for pointing it. Maybe there are many things to change.But I don't have a plan to write this code for simutrans-standard, so I will solve problems one by one. Thanks. Quote Selected
Re: Pathfinding algorithms Reply #37 – June 12, 2009, 08:01:43 pm For standard simutrans all routes have the same length. Thus it will change at whatever station was built first exc01 or exc02. Thus it does not really matter for return. But I feel like this should illustrate something for jamespett or gerw? Quote Selected
Topic: Pathfinding algorithms (Read 30843 times)
previous topic - next topic
