2005-12-29 13:58:21 +00:00
|
|
|
// groundnet.hxx - A number of classes to handle taxiway
|
|
|
|
// assignments by the AI code
|
|
|
|
//
|
|
|
|
// Written by Durk Talsma, started June 2005.
|
|
|
|
//
|
|
|
|
// Copyright (C) 2004 Durk Talsma.
|
|
|
|
//
|
|
|
|
// This program is free software; you can redistribute it and/or
|
|
|
|
// modify it under the terms of the GNU General Public License as
|
|
|
|
// published by the Free Software Foundation; either version 2 of the
|
|
|
|
// License, or (at your option) any later version.
|
|
|
|
//
|
|
|
|
// This program is distributed in the hope that it will be useful, but
|
|
|
|
// WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
// General Public License for more details.
|
|
|
|
//
|
|
|
|
// You should have received a copy of the GNU General Public License
|
|
|
|
// along with this program; if not, write to the Free Software
|
2006-02-21 01:16:04 +00:00
|
|
|
// Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
2005-12-29 13:58:21 +00:00
|
|
|
//
|
|
|
|
// $Id$
|
|
|
|
|
|
|
|
#ifndef _GROUNDNETWORK_HXX_
|
|
|
|
#define _GROUNDNETWORK_HXX_
|
|
|
|
|
2006-04-17 12:59:35 +00:00
|
|
|
#include <simgear/compiler.h>
|
|
|
|
|
2005-12-29 13:58:21 +00:00
|
|
|
#include STL_STRING
|
|
|
|
#include <vector>
|
|
|
|
|
|
|
|
SG_USING_STD(string);
|
|
|
|
SG_USING_STD(vector);
|
|
|
|
|
|
|
|
#include "parking.hxx"
|
|
|
|
|
|
|
|
class FGTaxiSegment; // forward reference
|
|
|
|
|
|
|
|
typedef vector<FGTaxiSegment> FGTaxiSegmentVector;
|
|
|
|
typedef vector<FGTaxiSegment*> FGTaxiSegmentPointerVector;
|
|
|
|
typedef vector<FGTaxiSegment>::iterator FGTaxiSegmentVectorIterator;
|
|
|
|
typedef vector<FGTaxiSegment*>::iterator FGTaxiSegmentPointerVectorIterator;
|
|
|
|
|
|
|
|
/**************************************************************************************
|
|
|
|
* class FGTaxiNode
|
|
|
|
*************************************************************************************/
|
|
|
|
class FGTaxiNode
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
double lat;
|
|
|
|
double lon;
|
|
|
|
int index;
|
|
|
|
FGTaxiSegmentPointerVector next; // a vector to all the segments leaving from this node
|
|
|
|
|
|
|
|
public:
|
|
|
|
FGTaxiNode();
|
|
|
|
FGTaxiNode(double, double, int);
|
|
|
|
|
|
|
|
void setIndex(int idx) { index = idx;};
|
|
|
|
void setLatitude (double val) { lat = val;};
|
|
|
|
void setLongitude(double val) { lon = val;};
|
|
|
|
void setLatitude (const string& val) { lat = processPosition(val); };
|
|
|
|
void setLongitude(const string& val) { lon = processPosition(val); };
|
|
|
|
void addSegment(FGTaxiSegment *segment) { next.push_back(segment); };
|
|
|
|
|
|
|
|
double getLatitude() { return lat;};
|
|
|
|
double getLongitude(){ return lon;};
|
|
|
|
|
|
|
|
int getIndex() { return index; };
|
|
|
|
FGTaxiNode *getAddress() { return this;};
|
|
|
|
FGTaxiSegmentPointerVectorIterator getBeginRoute() { return next.begin(); };
|
|
|
|
FGTaxiSegmentPointerVectorIterator getEndRoute() { return next.end(); };
|
|
|
|
};
|
|
|
|
|
|
|
|
typedef vector<FGTaxiNode> FGTaxiNodeVector;
|
|
|
|
typedef vector<FGTaxiNode>::iterator FGTaxiNodeVectorIterator;
|
|
|
|
|
|
|
|
/***************************************************************************************
|
|
|
|
* class FGTaxiSegment
|
|
|
|
**************************************************************************************/
|
|
|
|
class FGTaxiSegment
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
int startNode;
|
|
|
|
int endNode;
|
|
|
|
double length;
|
|
|
|
FGTaxiNode *start;
|
|
|
|
FGTaxiNode *end;
|
|
|
|
int index;
|
|
|
|
|
|
|
|
public:
|
|
|
|
FGTaxiSegment();
|
|
|
|
FGTaxiSegment(FGTaxiNode *, FGTaxiNode *, int);
|
|
|
|
|
|
|
|
void setIndex (int val) { index = val; };
|
|
|
|
void setStartNodeRef (int val) { startNode = val; };
|
|
|
|
void setEndNodeRef (int val) { endNode = val; };
|
|
|
|
|
|
|
|
void setStart(FGTaxiNodeVector *nodes);
|
|
|
|
void setEnd (FGTaxiNodeVector *nodes);
|
|
|
|
void setTrackDistance();
|
|
|
|
|
|
|
|
FGTaxiNode * getEnd() { return end;};
|
|
|
|
double getLength() { return length; };
|
|
|
|
int getIndex() { return index; };
|
|
|
|
|
2006-07-29 18:17:19 +00:00
|
|
|
FGTaxiSegment *getAddress() { return this;};
|
|
|
|
|
2005-12-29 13:58:21 +00:00
|
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
typedef vector<int> intVec;
|
|
|
|
typedef vector<int>::iterator intVecIterator;
|
|
|
|
|
2006-07-29 18:17:19 +00:00
|
|
|
/***************************************************************************************
|
|
|
|
* class FGTaxiRoute
|
|
|
|
**************************************************************************************/
|
2005-12-29 13:58:21 +00:00
|
|
|
class FGTaxiRoute
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
intVec nodes;
|
2006-07-29 18:17:19 +00:00
|
|
|
intVec routes;
|
2005-12-29 13:58:21 +00:00
|
|
|
double distance;
|
|
|
|
intVecIterator currNode;
|
2006-07-29 18:17:19 +00:00
|
|
|
intVecIterator currRoute;
|
2005-12-29 13:58:21 +00:00
|
|
|
|
|
|
|
public:
|
2006-07-29 18:17:19 +00:00
|
|
|
FGTaxiRoute() { distance = 0; currNode = nodes.begin(); currRoute = routes.begin();};
|
|
|
|
FGTaxiRoute(intVec nds, intVec rts, double dist) {
|
|
|
|
nodes = nds;
|
|
|
|
routes = rts;
|
|
|
|
distance = dist;
|
|
|
|
currNode = nodes.begin();
|
|
|
|
};
|
2005-12-29 13:58:21 +00:00
|
|
|
bool operator< (const FGTaxiRoute &other) const {return distance < other.distance; };
|
|
|
|
bool empty () { return nodes.begin() == nodes.end(); };
|
2006-07-29 18:17:19 +00:00
|
|
|
bool next(int *nde);
|
|
|
|
bool next(int *nde, int *rte);
|
2005-12-29 13:58:21 +00:00
|
|
|
|
2006-07-29 18:17:19 +00:00
|
|
|
void first() { currNode = nodes.begin(); currRoute = routes.begin(); };
|
2006-03-26 21:40:35 +00:00
|
|
|
int size() { return nodes.size(); };
|
2005-12-29 13:58:21 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
typedef vector<FGTaxiRoute> TaxiRouteVector;
|
|
|
|
typedef vector<FGTaxiRoute>::iterator TaxiRouteVectorIterator;
|
|
|
|
|
|
|
|
/**************************************************************************************
|
|
|
|
* class FGGroundNetWork
|
|
|
|
*************************************************************************************/
|
|
|
|
class FGGroundNetwork
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
bool hasNetwork;
|
|
|
|
FGTaxiNodeVector nodes;
|
|
|
|
FGTaxiSegmentVector segments;
|
|
|
|
//intVec route;
|
2006-07-29 18:17:19 +00:00
|
|
|
intVec nodesStack;
|
|
|
|
intVec routesStack;
|
2005-12-29 13:58:21 +00:00
|
|
|
TaxiRouteVector routes;
|
|
|
|
|
|
|
|
bool foundRoute;
|
|
|
|
double totalDistance, maxDistance;
|
2006-08-16 09:58:26 +00:00
|
|
|
|
|
|
|
void printRoutingError(string);
|
2005-12-29 13:58:21 +00:00
|
|
|
|
|
|
|
public:
|
|
|
|
FGGroundNetwork();
|
|
|
|
|
|
|
|
void addNode (const FGTaxiNode& node);
|
|
|
|
void addNodes (FGParkingVec *parkings);
|
|
|
|
void addSegment(const FGTaxiSegment& seg);
|
|
|
|
|
|
|
|
void init();
|
|
|
|
bool exists() { return hasNetwork; };
|
|
|
|
int findNearestNode(double lat, double lon);
|
|
|
|
FGTaxiNode *findNode(int idx);
|
2006-07-29 18:17:19 +00:00
|
|
|
FGTaxiSegment *findSegment(int idx);
|
2005-12-29 13:58:21 +00:00
|
|
|
FGTaxiRoute findShortestRoute(int start, int end);
|
|
|
|
void trace(FGTaxiNode *, int, int, double dist);
|
|
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
#endif
|