#include "awynet.hxx"
using std::sort;
-
+using std::string;
using std::cerr;
using std::endl;
foundRoute = false;
totalDistance = 0;
FGNode *firstNode = findNode(start);
- FGNode *lastNode = findNode(end);
+ //FGNode *lastNode = findNode(end);
//prevNode = prevPrevNode = -1;
//prevNode = start;
routes.clear();