|
| AdjacencyList (int n) |
void | clear () |
int | addVertex () |
int | numVertices () const |
bool | vertexExists (int v) const |
bool | inSameComponent (int v1, int v2) const |
int | numConnectedComponents () const |
int | getComponentID (int vtx) const |
bool | addEdge (int v1, int v2, double weight=1.0) |
bool | removeEdge (int v1, int v2) |
int | numEdges () const |
double | getEdgeWeight (int v1, int v2) const |
bool | setEdgeWeight (int v1, int v2, double weight) |
bool | edgeExists (int v1, int v2) const |
int | numNeighbors (int vtx) const |
void | getNeighbors (int vtx, std::vector< int > &nbrs) const |
void | getNeighbors (int vtx, std::vector< std::pair< int, double > > &nbrs) const |
bool | dijkstra (int v1, int v2, std::vector< int > &path) const |
void | dijkstra (int vtx, std::vector< int > &predecessors, std::vector< double > &distance) const |
Definition at line 48 of file AdjacencyList.h.
◆ AdjacencyList() [1/2]
ompl::AdjacencyList::AdjacencyList |
( |
| ) |
|
◆ AdjacencyList() [2/2]
ompl::AdjacencyList::AdjacencyList |
( |
int | n | ) |
|
◆ ~AdjacencyList()
ompl::AdjacencyList::~AdjacencyList |
( |
| ) |
|
◆ addEdge()
bool ompl::AdjacencyList::addEdge |
( |
int | v1, |
|
|
int | v2, |
|
|
double | weight = 1.0 ) |
◆ addVertex()
int ompl::AdjacencyList::addVertex |
( |
| ) |
|
◆ clear()
void ompl::AdjacencyList::clear |
( |
| ) |
|
◆ dijkstra() [1/2]
bool ompl::AdjacencyList::dijkstra |
( |
int | v1, |
|
|
int | v2, |
|
|
std::vector< int > & | path ) const |
◆ dijkstra() [2/2]
void ompl::AdjacencyList::dijkstra |
( |
int | vtx, |
|
|
std::vector< int > & | predecessors, |
|
|
std::vector< double > & | distance ) const |
◆ edgeExists()
bool ompl::AdjacencyList::edgeExists |
( |
int | v1, |
|
|
int | v2 ) const |
◆ getComponentID()
int ompl::AdjacencyList::getComponentID |
( |
int | vtx | ) |
const |
◆ getEdgeWeight()
double ompl::AdjacencyList::getEdgeWeight |
( |
int | v1, |
|
|
int | v2 ) const |
◆ getNeighbors() [1/2]
void ompl::AdjacencyList::getNeighbors |
( |
int | vtx, |
|
|
std::vector< int > & | nbrs ) const |
◆ getNeighbors() [2/2]
void ompl::AdjacencyList::getNeighbors |
( |
int | vtx, |
|
|
std::vector< std::pair< int, double > > & | nbrs ) const |
◆ inSameComponent()
bool ompl::AdjacencyList::inSameComponent |
( |
int | v1, |
|
|
int | v2 ) const |
◆ numConnectedComponents()
int ompl::AdjacencyList::numConnectedComponents |
( |
| ) |
const |
◆ numEdges()
int ompl::AdjacencyList::numEdges |
( |
| ) |
const |
◆ numNeighbors()
int ompl::AdjacencyList::numNeighbors |
( |
int | vtx | ) |
const |
◆ numVertices()
int ompl::AdjacencyList::numVertices |
( |
| ) |
const |
◆ removeEdge()
bool ompl::AdjacencyList::removeEdge |
( |
int | v1, |
|
|
int | v2 ) |
◆ setEdgeWeight()
bool ompl::AdjacencyList::setEdgeWeight |
( |
int | v1, |
|
|
int | v2, |
|
|
double | weight ) |
◆ vertexExists()
bool ompl::AdjacencyList::vertexExists |
( |
int | v | ) |
const |
◆ disjointSetsRaw_
void* ompl::AdjacencyList::disjointSetsRaw_ |
|
protected |
◆ graphRaw_
void* ompl::AdjacencyList::graphRaw_ |
|
protected |
◆ lock_
boost::mutex ompl::AdjacencyList::lock_ |
|
mutableprotected |
The documentation for this class was generated from the following files: