|
libmove3d-planners
|
All Classes Namespaces Files Functions Variables Enumerations Enumerator Friends Macros Groups Pages
|
libmove3d-planners
|
This is the complete list of members for Graph, including all inherited members.
| addCycles(Node *node, double step) | Graph | |
| addEdge(Node *source, Node *target, bool compute_length=true, double length=0., bool compute_cost=true, double cost=0.) | Graph | |
| addEdge(Node *source, Node *target, localPathPtr_t path) | Graph | |
| addEdges(Node *N1, Node *N2, bool computeLength=true, double length=0., bool computeCost=true, double cost=0.) | Graph | |
| addEdges(Node *N1, Node *N2, localPathPtr_t path) | Graph | |
| addNode(Node *node) | Graph | |
| addNode(Node *N, double maxDist) | Graph | |
| addNodes(std::vector< Node * > N, double maxDist) | Graph | |
| addOrientedEdge(Node *N1, Node *N2, localPathPtr_t path) | Graph | |
| addScc(Node *node) | Graph | |
| areNodesLinked(Node *node1, Node *node2, double &dist) | Graph | |
| areSccConnected(unsigned int i, unsigned int j) | Graph | |
| checkAllEdgesValid() | Graph | |
| checkConnectedComponents() | Graph | |
| computeDijkstraShortestPaths(Node *n) | Graph | |
| computeDijkstraShortestPaths(Node *n, std::map< double, Node * > to) (defined in Graph) | Graph | |
| connectNodeToCompco(Node *node, Node *compco) | Graph | |
| connectScc(unsigned int i, unsigned int j) | Graph | |
| createCompco(Node *node) | Graph | |
| createRandConfs(int NMAX) | Graph | |
| draw() (defined in Graph) | Graph | |
| equal(Graph *G) | Graph | |
| equalName(Graph *G) | Graph | |
| extractAStarShortestNodePaths(Node *initN, Node *endN) | Graph | |
| extractAStarShortestNodePaths(std::vector< Node * > passingBy) (defined in Graph) | Graph | |
| extractAStarShortestNodePaths(confPtr_t initC, confPtr_t endC) | Graph | |
| extractAStarShortestPath(Node *initN, Node *endN) | Graph | |
| extractAStarShortestPath(confPtr_t initC, confPtr_t endC) | Graph | |
| extractBestNodePathSoFar(confPtr_t qi, confPtr_t qf) | Graph | |
| extractBestTraj(confPtr_t qi, confPtr_t qf) | Graph | |
| extractBestTrajSoFar(confPtr_t qi, confPtr_t qf) | Graph | |
| extractTreeShortestPath(Node *initN, Node *endN) | Graph | |
| findEdgeDescriptor(Edge *E) (defined in Graph) | Graph | |
| findVertexDescriptor(Node *N) (defined in Graph) | Graph | |
| get_BGL_Graph() (defined in Graph) | Graph | inline |
| getAStarShortestPathLength(confPtr_t initC, confPtr_t endC) | Graph | |
| getCompco(unsigned int ith) | Graph | |
| getConnectedComponent(int ith) const | Graph | |
| getConnectedComponents() const | Graph | |
| getEdge(unsigned int i) const | Graph | inline |
| getEdges() const | Graph | |
| getEdges(std::tr1::shared_ptr< Configuration > q, bool from=false) (defined in Graph) | Graph | |
| getEdges(Node *nq, bool from=false) (defined in Graph) | Graph | |
| getGraphStruct() const | Graph | |
| getKNodesOnTraj(Node *near, uint k) (defined in Graph) | Graph | |
| getLastNode() | Graph | |
| getName() | Graph | |
| getNbScc() (defined in Graph) | Graph | |
| getNode(unsigned int i) const | Graph | inline |
| getNode(node *N) | Graph | |
| getNodes() const | Graph | |
| getNodesInTheCompCo(Node *node) | Graph | |
| getNodesOnTraj(Node *near, bool neighbour=false) (defined in Graph) | Graph | |
| getNodesTable() | Graph | |
| getNotTrajNodes() const (defined in Graph) | Graph | |
| getNumberOfCompco() const (defined in Graph) | Graph | |
| getNumberOfEdges() const | Graph | |
| getNumberOfNodes() | Graph | |
| getRandomNodeNearTraj() (defined in Graph) | Graph | |
| getRobot() const | Graph | |
| getSortedNodes() const (defined in Graph) | Graph | |
| getStronglyConnectedComponents() (defined in Graph) | Graph | |
| Graph() (defined in Graph) | Graph | inline |
| Graph(Robot *R, graph *ptGraph) (defined in Graph) | Graph | |
| Graph(Robot *R) (defined in Graph) | Graph | |
| Graph(graph *G) (defined in Graph) | Graph | |
| Graph(const Graph &G) | Graph | |
| initMotionPlanning(node *start, node *goal) | Graph | |
| insertConfigurationAsNode(std::tr1::shared_ptr< Configuration > q, Node *from, double step) | Graph | |
| insertExtremalNode(Node *node) | Graph | |
| insertNode(Node *node) | Graph | |
| insertNode(Node *expansionNode, LocalPath &path) | Graph | |
| isEdgeInGraph(Node *N1, Node *N2) | Graph | |
| isGraphChanged() | Graph | inline |
| isInGraph(Node *N) | Graph | |
| kNearestNeighbours(unsigned k, confPtr_t conf) (defined in Graph) | Graph | |
| KNearestWeightNeighbour(confPtr_t q, int K, double radius, bool weighted, int distConfigChoice) | Graph | |
| linkNode(Node *N) | Graph | |
| linkNodeAndMerge(Node *node1, Node *node2) | Graph | |
| linkNodeAtDist(Node *N) | Graph | |
| linkNodeCompMultisol(Node *N, ConnectedComponent *compPt) | Graph | |
| linkNodeWithoutDist(Node *N) | Graph | |
| linkToAllNodes(Node *N) | Graph | |
| mergeCheck() | Graph | |
| mergeComp(Node *CompCo1, Node *CompCo2, double DistNodes, bool compute_edge_cost) | Graph | |
| mergeComponents(Node *N1, Node *N2) | Graph | |
| mergeScc(unsigned int i, unsigned int j) | Graph | |
| nearestWeightNeighbour(Node *compco, confPtr_t C, bool weighted, int distConfigChoice) | Graph | |
| neighborsInBall(confPtr_t conf, double radius) | Graph | |
| randomNodeFromComp(Node *comp) | Graph | |
| rebuildCompcoFromBoostGraph() | Graph | |
| recomputeCost() | Graph | |
| removeCompco(ConnectedComponent *CompCo) | Graph | |
| removeEdge(Edge *E) | Graph | |
| removeEdges(Node *N1, Node *N2) | Graph | |
| removeNode(Node *node) | Graph | |
| resetConnections() (defined in Graph) | Graph | |
| saveBGLGraphToDotFile(const std::string &filename) (defined in Graph) | Graph | |
| searchConf(Configuration &q) | Graph | |
| separateNodes() (defined in Graph) | Graph | |
| setGraph(graph *G) | Graph | |
| setName() | Graph | |
| setName(std::string Name) | Graph | |
| setRobot(Robot *R) | Graph | |
| sortEdges() | Graph | |
| sortNodes(double init=-1) (defined in Graph) | Graph | |
| sortNodesByDist(Node *N) | Graph | |
| sortNodesByDist(confPtr_t q) | Graph | |
| sortNodesByDist(std::vector< Node * > &nodes, confPtr_t config) | Graph | static |
| sortSCC(unsigned int id, Node *N1, bool forward) (defined in Graph) | Graph | |
| unflagAll() (defined in Graph) | Graph | |
| updateSepareNodes(Node *n) (defined in Graph) | Graph | |
| updateSortedNodes(Node *node) | Graph | |
| ~Graph() (defined in Graph) | Graph |
1.8.6