i++;
}
this->_steered.erase(this->_steered.begin() + i, this->_steered.end());
- return this->_steered.size() == 0;
+ // The first node of this->_steered is the same as nn. Therefore, if
+ // there is only one node left, it is nn, and other nodes collide.
+ return this->_steered.size() == 1;
}
RRTExt2::RRTExt2() : RRTS()