libmove3d-planners
 All Classes Namespaces Files Functions Variables Enumerations Enumerator Friends Macros Groups Pages
Public Member Functions | List of all members
mho::GraphInterface Class Referenceabstract

template interface for a graph More...

#include <GraphInterface.h>

Inheritance diagram for mho::GraphInterface:
mho::SimpleGraph

Public Member Functions

virtual bool isDirected (void)=0
 isDirected More...
 
virtual NodeInterfaceaddNode (NodeInterface *n)=0
 
virtual void connectNodes (NodeInterface *n1, NodeInterface *n2, cost_t c)=0
 connectNodes connect 2 nodes. More...
 
virtual NodeInterfaceat (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
 

Detailed Description

template interface for a graph

Member Function Documentation

virtual NodeInterface* mho::GraphInterface::at ( unsigned int  i)
pure virtual

at returns the node at given index

Parameters
iindex
Returns
reference to node at i

Implemented in mho::SimpleGraph.

virtual void mho::GraphInterface::connectNodes ( NodeInterface n1,
NodeInterface n2,
cost_t  c 
)
pure virtual

connectNodes connect 2 nodes.

Parameters
n1first node
n2second node
ccost if directed graph, makes an arrow n1 -> n2 otherwise n1 <-> n2

Implemented in mho::SimpleGraph.

virtual bool mho::GraphInterface::isDirected ( void  )
pure virtual

isDirected

Returns
true if directed graph

Implemented in mho::SimpleGraph.

virtual unsigned int mho::GraphInterface::size ( void  )
pure virtual

size the number of nodes

Returns

Implemented in mho::SimpleGraph.


The documentation for this class was generated from the following file: