KrisLibrary
1.0.0
|
An SBLTree with a node index. More...
#include <SBLTree.h>
Public Member Functions | |
SBLTreeWithIndex (CSpace *) | |
virtual void | Cleanup () |
virtual void | AddMilestone (Node *n) |
virtual void | RemoveMilestone (Node *n) |
virtual Node * | PickExpand () |
Node * | PickRandom () const |
Public Member Functions inherited from SBLTree | |
SBLTree (CSpace *) | |
virtual void | Init (const Config &qStart) |
virtual Node * | Extend (Real maxDistance, int maxIters) |
Node * | AddMilestone (const Config &q) |
bool | HasNode (Node *n) const |
Node * | AddChild (Node *n, const Config &x) |
Node * | FindClosest (const Config &x) |
void | AdjustMilestone (Node *n, const Config &newConfig) |
void | DeleteSubtree (Node *n) |
Public Attributes | |
std::vector< Node * > | index |
Public Attributes inherited from SBLTree | |
CSpace * | space |
Node * | root |
Additional Inherited Members | |
Public Types inherited from SBLTree | |
typedef Graph::TreeNode< Config, EdgePlannerPtr > | Node |
Static Public Member Functions inherited from SBLTree | |
static bool | CheckPath (SBLTree *ts, Node *ns, SBLTree *tg, Node *ng, std::list< EdgeInfo > &outputPath) |
static bool | CheckPath (SBLTree *t, Node *ns, Node *ng, MilestonePath &outputPath) |
An SBLTree with a node index.