// TODO: this is the only missing part... will do this tomorrow :) void PerformPathFinding(NodeIdxT start, NodeIdxT end) { const NodeT * nodes = mPtrGraph->GetNodes(); NodeValT currdist, mindist; NodeIdxT currentNode = start; mPath.clear(); while (true) { mindist = MAX_INVALID_NODE; int nodeConnectedSize = nodes[currentNode].nodesConnected.size(); for (int ctr = 0; ctr < nodeConnectedSize; ctr++) { currdist = mPtrGraph->GetDistanceDirect(*mPtrGraph, currentNode, nodes[currentNode].nodesConnected[ctr]); if (currdist != INVALID_NODE) { mindist = currdist; } } break; } this->mDistance = mindist; }