3 #include "trackchain.h"
4 #include "trainroutemetric.h"
10 TrainRouteMetric::TrainRouteMetric(const TrackChain &tc, TrackChain::Direction dir)
12 vector<TrackIter> ends;
13 if(dir==TrackChain::UNSPECIFIED)
15 for(unsigned i=0; i<2; ++i)
16 if(TrackIter end = tc.get_end(i))
19 else if(TrackIter end = tc.get_end(dir))
22 /* Initialize goals for the ends of the target chain. We travel away from
23 the goals in the search phase so the iters appear to point the wrong way. */
24 for(vector<TrackIter>::const_iterator i=ends.begin(); i!=ends.end(); ++i)
26 const TrackType::Endpoint &ep = i->endpoint();
27 unsigned nls = (*i)->get_n_link_slots();
28 for(unsigned j=0; j<nls; ++j)
30 TrackIter iter(i->track(), j);
31 if(ep.has_common_paths(iter.endpoint()))
32 goals.push_back(iter);
36 list<TrackIter> queue;
37 for(vector<Goal>::iterator i=goals.begin(); i!=goals.end(); ++i)
39 tracks[Key(i->track.track(), i->track.entry())] = Data(0, &*i);
40 queue.push_back(i->track);
43 /* Use Dijkstra's algorithm to find the shortest distance from the goal to
44 every reachable track in the layout. Entry points here become exit points
45 when looking up distances to the goal. */
48 TrackIter track = queue.front();
50 const Data &data = tracks[Key(track.track(), track.entry())];
52 const TrackType::Endpoint &ep = track.endpoint();
53 for(unsigned i=0; ep.paths>>i; ++i)
56 TrackIter next = track.next(i);
60 Data &target = tracks[Key(next.track(), next.entry())];
61 float dist = data.distance+track->get_type().get_path_length(i);
62 if(target.distance<0 || target.distance>dist)
64 target = Data(dist, data.goal);
65 queue.push_back(next);
71 void TrainRouteMetric::chain_to(const TrainRouteMetric &metric)
73 for(vector<Goal>::iterator i=goals.begin(); i!=goals.end(); ++i)
74 i->base_distance = metric.get_distance_from(*i->track.track(), i->track.entry());
77 float TrainRouteMetric::get_distance_from(const Track &track) const
79 map<Key, Data>::const_iterator i = tracks.lower_bound(Key(&track, 0));
80 map<Key, Data>::const_iterator j = tracks.upper_bound(Key(&track, 255));
85 float d = i->second.distance+i->second.goal->base_distance;
86 if(result<0 || d<result)
93 float TrainRouteMetric::get_distance_from(const Track &track, unsigned exit) const
95 map<Key, Data>::const_iterator i = tracks.find(Key(&track, exit));
99 return i->second.distance+i->second.goal->base_distance;
103 TrainRouteMetric::Goal::Goal():
107 TrainRouteMetric::Goal::Goal(const TrackIter &t):
113 TrainRouteMetric::Data::Data():
118 TrainRouteMetric::Data::Data(float d, const Goal *g):