pcl::recognition::ORRGraph< NodeData > Class Template Reference

#include <orr_graph.h>

List of all members.

Classes
class	Node
Public Member Functions
void	clear ()
void	computeMaximalOnOffPartition (std::list< Node * > &on_nodes, std::list< Node * > &off_nodes)
void	deleteDirectedEdge (int id1, int id2)
void	deleteUndirectedEdge (int id1, int id2)
std::vector< Node * > &	getNodes ()
void	insertDirectedEdge (int id1, int id2)
void	insertUndirectedEdge (int id1, int id2)
	ORRGraph ()
void	resize (int n)
	Drops all existing graph nodes and creates 'n' new ones.
virtual	~ORRGraph ()
Public Attributes
std::vector< Node * >	nodes_

---

Detailed Description

template<class NodeData>
class pcl::recognition::ORRGraph< NodeData >

Definition at line 56 of file orr_graph.h.

---

Constructor & Destructor Documentation

template<class NodeData>

pcl::recognition::ORRGraph< NodeData >::ORRGraph

(

)

[inline]

Definition at line 124 of file orr_graph.h.

template<class NodeData>

virtual pcl::recognition::ORRGraph< NodeData >::~ORRGraph

(

)

[inline, virtual]

Definition at line 125 of file orr_graph.h.

---

Member Function Documentation

template<class NodeData>

void pcl::recognition::ORRGraph< NodeData >::clear

(

)

[inline]

Definition at line 128 of file orr_graph.h.

template<class NodeData>

void pcl::recognition::ORRGraph< NodeData >::computeMaximalOnOffPartition	(	std::list< Node * > &	on_nodes,
		std::list< Node * > &	off_nodes
	)		[inline]

Definition at line 153 of file orr_graph.h.

template<class NodeData>

void pcl::recognition::ORRGraph< NodeData >::deleteDirectedEdge	(	int	id1,
		int	id2
	)		[inline]

Definition at line 211 of file orr_graph.h.

template<class NodeData>

void pcl::recognition::ORRGraph< NodeData >::deleteUndirectedEdge	(	int	id1,
		int	id2
	)		[inline]

Definition at line 204 of file orr_graph.h.

template<class NodeData>

std::vector<Node*>& pcl::recognition::ORRGraph< NodeData >::getNodes

(

)

[inline]

Definition at line 217 of file orr_graph.h.

template<class NodeData>

void pcl::recognition::ORRGraph< NodeData >::insertDirectedEdge	(	int	id1,
		int	id2
	)		[inline]

Definition at line 198 of file orr_graph.h.

template<class NodeData>

void pcl::recognition::ORRGraph< NodeData >::insertUndirectedEdge	(	int	id1,
		int	id2
	)		[inline]

Definition at line 191 of file orr_graph.h.

template<class NodeData>

void pcl::recognition::ORRGraph< NodeData >::resize

(

int

n

)

[inline]

Drops all existing graph nodes and creates 'n' new ones.

Definition at line 138 of file orr_graph.h.

---

Member Data Documentation

template<class NodeData>

std::vector<Node*> pcl::recognition::ORRGraph< NodeData >::nodes_

Definition at line 220 of file orr_graph.h.

---

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

• orr_graph.h