libmove3d-planners
|
template interface for a graph More...
#include <GraphInterface.h>
Public Member Functions | |
virtual bool | isDirected (void)=0 |
isDirected More... | |
virtual NodeInterface * | addNode (NodeInterface *n)=0 |
virtual void | connectNodes (NodeInterface *n1, NodeInterface *n2, cost_t c)=0 |
connectNodes connect 2 nodes. More... | |
virtual NodeInterface * | at (unsigned int i)=0 |
at returns the node at given index More... | |
virtual std::vector < NodeInterface * > | getNodes (void)=0 |
virtual std::vector < NodeInterface * > | sonsNodes (NodeInterface *i)=0 |
virtual std::vector < EdgeInterface * > | sons (NodeInterface *i)=0 |
virtual unsigned int | size (void)=0 |
size the number of nodes More... | |
virtual unsigned int | edgesNumber (void)=0 |
template interface for a graph
|
pure virtual |
at returns the node at given index
i | index |
Implemented in mho::SimpleGraph.
|
pure virtual |
connectNodes connect 2 nodes.
n1 | first node |
n2 | second node |
c | cost if directed graph, makes an arrow n1 -> n2 otherwise n1 <-> n2 |
Implemented in mho::SimpleGraph.
|
pure virtual |
|
pure virtual |