- // initialize the pushback route. Note that parts
- // of this procedure should probably be done inside
- // taxidraw. This code is likely to change once this
- // this is fully implemented in taxidraw. Until that time,
- // however, the full initialization procedure looks like this:
- // 1) Build a list of all the nodes that are classified as
- // pushBack hold points
- // 2) For each hold point, use the dykstra algorithm to find a route
- // between the gate and the pushBack hold nodes, however use only
- // segments that are classified as "pushback" routes.
- // 3) return the TaxiRoute class that is non empty.
- // 4) store refer this route in the parking object, for future use
-
- if (pushBackNode < 0) {
- //cerr << "Initializing PushBackRoute " << endl;
- intVec pushBackNodes;
- int nAINodes = dep->getDynamics()->getGroundNetwork()->getNrOfNodes();
- int hits = 0;
- parking->setPushBackPoint(0); // default in case no network was found.