ibmppl::_vertex_iterator_t< base_type, edge_iterator, graph_type > Class Template Reference

vertex iterator type More...

#include <ibm_generic_graph.h>

Inherits base_type.

Public Member Functions
	_vertex_iterator_t (base_type const &iter, DIRECTNESS d)
property_iterator	property_begin ()
	return property(subproperty) iterator pointing to the first subproperty More...
property_iterator	property_end ()
	return property(subproperty) iterator pointing to the tail subproperty More...
size_t	edges_size () const
	return number of outgoing edges More...
size_t	edges_size (size_t lid) const
size_t	edges_size (std::string label) const
	return number of outgoing edges with given label More...
edge_iterator	edges_begin ()
	return edge iterator pointing to the first edge More...
edge_iterator	edges_begin (size_t lid)
edge_iterator	edges_begin (std::string label)
	return edge iterator pointing to the first edge with given label More...
edge_iterator	edges_end ()
	return edge iterator pointing to the past-the-end edge More...
edge_iterator	edges_end (size_t lid)
edge_iterator	edges_end (std::string label)
	return edge iterator pointing to the past-the-end edge with given label More...
size_t	preds_size () const
	return number of predecessors More...
size_t	preds_size (size_t lid) const
size_t	preds_size (std::string label) const
	return number of predecessors with given label More...
pred_iterator	preds_begin ()
	return predecessor iterator pointing to the first predecessor More...
pred_iterator	preds_end ()
	return predecessor iterator pointing to the past-the-end predecessor More...
pred_iterator	preds_begin (size_t lid)
pred_iterator	preds_begin (std::string label)
	return predecessor iterator pointing to the first predecessor with given label More...
pred_iterator	preds_end (size_t lid)
pred_iterator	preds_end (std::string label)
	return predecessor iterator pointing to the past-the-end predecessor with given label More...
string	get_external_id ()
	return the external vertex id More...
string	deprecated_get_external_id_as_stdstring ()
size_t	get_vclassid (void)
size_t	get_labelid (void)
string	get_label (void)
	return the vertex label More...
string	get_vclassname (void)
void	set_labelid (size_t lid)
void	set_vclassid (size_t lid)
_vertex_iterator_t *	operator-> ()
bool	is_edge ()

Protected Attributes
DIRECTNESS	_directness

Private Types
typedef graph_type::pred_iterator	pred_iterator
typedef base_type::edge_iterator	base_edge_iterator
typedef _vertex_iterator_t < base_type, edge_iterator, graph_type >	this_type
typedef _subproperty_iterator_t < this_type, edge_iterator >	property_iterator

Detailed Description

template<class base_type, class edge_iterator, class graph_type>
class ibmppl::_vertex_iterator_t< base_type, edge_iterator, graph_type >

vertex iterator type

Member Function Documentation

template<class base_type , class edge_iterator , class graph_type >

edge_iterator ibmppl::_vertex_iterator_t< base_type, edge_iterator, graph_type >::edges_begin ( )

inline

return edge iterator pointing to the first edge

Returns

edge_iterator

template<class base_type , class edge_iterator , class graph_type >

edge_iterator ibmppl::_vertex_iterator_t< base_type, edge_iterator, graph_type >::edges_begin ( std::string  label )

inline

return edge iterator pointing to the first edge with given label

Parameters

label

string label

Returns

edge_iterator

template<class base_type , class edge_iterator , class graph_type >

edge_iterator ibmppl::_vertex_iterator_t< base_type, edge_iterator, graph_type >::edges_end ( )

inline

return edge iterator pointing to the past-the-end edge

Returns

edge_iterator

template<class base_type , class edge_iterator , class graph_type >

edge_iterator ibmppl::_vertex_iterator_t< base_type, edge_iterator, graph_type >::edges_end ( std::string  label )

inline

return edge iterator pointing to the past-the-end edge with given label

Parameters

label

string label

Returns

edge_iterator

template<class base_type , class edge_iterator , class graph_type >

size_t ibmppl::_vertex_iterator_t< base_type, edge_iterator, graph_type >::edges_size ( ) const

inline

return number of outgoing edges

Returns

size_t

template<class base_type , class edge_iterator , class graph_type >

size_t ibmppl::_vertex_iterator_t< base_type, edge_iterator, graph_type >::edges_size ( std::string  label ) const

inline

return number of outgoing edges with given label

Parameters

label

string label

Returns

size_t

template<class base_type , class edge_iterator , class graph_type >

string ibmppl::_vertex_iterator_t< base_type, edge_iterator, graph_type >::get_external_id ( )

inline

return the external vertex id

Returns

string

template<class base_type , class edge_iterator , class graph_type >

string ibmppl::_vertex_iterator_t< base_type, edge_iterator, graph_type >::get_label ( void  )

inline

return the vertex label

Returns

string

template<class base_type , class edge_iterator , class graph_type >

pred_iterator ibmppl::_vertex_iterator_t< base_type, edge_iterator, graph_type >::preds_begin ( )

inline

return predecessor iterator pointing to the first predecessor

Returns

pred_iterator

template<class base_type , class edge_iterator , class graph_type >

pred_iterator ibmppl::_vertex_iterator_t< base_type, edge_iterator, graph_type >::preds_begin ( std::string  label )

inline

return predecessor iterator pointing to the first predecessor with given label

Parameters

label

string label

Returns

pred_iterator

template<class base_type , class edge_iterator , class graph_type >

pred_iterator ibmppl::_vertex_iterator_t< base_type, edge_iterator, graph_type >::preds_end ( )

inline

return predecessor iterator pointing to the past-the-end predecessor

Returns

pred_iterator

template<class base_type , class edge_iterator , class graph_type >

pred_iterator ibmppl::_vertex_iterator_t< base_type, edge_iterator, graph_type >::preds_end ( std::string  label )

inline

return predecessor iterator pointing to the past-the-end predecessor with given label

Parameters

label

string label

Returns

pred_iterator

template<class base_type , class edge_iterator , class graph_type >

size_t ibmppl::_vertex_iterator_t< base_type, edge_iterator, graph_type >::preds_size ( ) const

inline

return number of predecessors

Returns

size_t

template<class base_type , class edge_iterator , class graph_type >

size_t ibmppl::_vertex_iterator_t< base_type, edge_iterator, graph_type >::preds_size ( std::string  label ) const

inline

return number of predecessors with given label

Parameters

label

string label

Returns

size_t

template<class base_type , class edge_iterator , class graph_type >

property_iterator ibmppl::_vertex_iterator_t< base_type, edge_iterator, graph_type >::property_begin ( )

inline

return property(subproperty) iterator pointing to the first subproperty

Returns

property_iterator

template<class base_type , class edge_iterator , class graph_type >

property_iterator ibmppl::_vertex_iterator_t< base_type, edge_iterator, graph_type >::property_end ( )

inline

return property(subproperty) iterator pointing to the tail subproperty

Returns

property_iterator

---

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

• /home/yxia/Work/ibmppl.gsa/datastructure/graph/ibm_generic_graph.h