stapl::vertex_adj_list_impl< VD, Property, AdjList > Class Template Reference

Vertex for adjacency list for the graph. More...

Public Member Functions
	vertex_adj_list_impl (vertex_adj_list_impl const &other)
	vertex_adj_list_impl (vertex_descriptor vd, Property const &p)
	Creates a vertex for the graph with the given descriptor and property. More...
template<typename Comp >
void	sort_edges (Comp const &comp)
edgelist_it	begin (void)
	Returns the beginning of the edgelist of this vertex.
const_edgelist_it	begin (void) const
	Returns the end of the edgelist of this vertex.
edgelist_it	end (void)
	Returns the beginning of the edgelist of this vertex.
const_edgelist_it	end (void) const
	Returns the end of the edgelist of this vertex.
edgelist_it	find_edge (vertex_descriptor const &vd)
	Returns an iterator to the edge with the specified target. More...
edgelist_it	find_edge (edge_descriptor const &ed)
	Returns an iterator to the specified edge. More...
size_t	size (void) const
	Returns the number of outgoing edges of this vertex.
void	reserve (size_t n)
	Reserves space for specified number of edges.
void	erase (size_t n)
	Erases all edges from index n until the end. More...
void	erase_at (size_t n)
	Erases edge at index n. More...
void	erase (size_t start, size_t end)
template<typename Iter >
void	erase (Iter it)
property_type &	property (void) noexcept
property_type const &	property (void) const noexcept
vertex_descriptor const &	descriptor (void) const noexcept
	Returns the descriptor of this vertex. More...
edgelist_type &	edgelist (void) noexcept
	Returns the edge-list of this vertex.
void	edgelist (edgelist_type const *const edgelist)
	Sets the edge-list of this vertex.
edgelist_type const &	edgelist (void) const noexcept
	Returns the edge-list of this vertex.
edgelist_type &	edges (void) noexcept
	Returns the edge-list of this vertex.
void	clear (void)
	Clears the edge-list of this vertex.

Public Types
typedef VD	vertex_descriptor
typedef AdjList	edgelist_type
typedef AdjList	adj_edges_type
typedef AdjList::edge_descriptor	edge_descriptor
typedef AdjList::iterator	edgelist_it
typedef AdjList::const_iterator	const_edgelist_it
typedef edgelist_it	adj_edge_iterator
typedef const_edgelist_it	const_adj_edge_iterator
typedef Property	property_type
typedef Property &	property_reference
typedef Property const &	const_property_reference

Protected Attributes
property_type	m_property
	The property of this vertex.
VD	m_vd
	The descriptor of this vertex.
edgelist_type	m_edgelist
	The edge-list of this vertex.

Properties
	__pad0__:no_property property_type

Friends
template<class Traits >
class	adjacency_list_model

Detailed Description

template<class VD, class Property, class AdjList>
class stapl::vertex_adj_list_impl< VD, Property, AdjList >

Vertex for adjacency list for the graph.

Template Parameters

VD	Vertex descriptor type for the graph.
Property	Property type of the vertex.
AdjList	Type of the edgelist for storing edges.

Constructor & Destructor Documentation

vertex_adj_list_impl()

template<class VD , class Property , class AdjList >

stapl::vertex_adj_list_impl< VD, Property, AdjList >::vertex_adj_list_impl	(	vertex_descriptor	vd,
		Property const &	p
	)

Creates a vertex for the graph with the given descriptor and property.

Parameters

vd	The descriptor of this vertex.
p	The property of this vertex.

Member Function Documentation

find_edge() [1/2]

template<class VD , class Property , class AdjList >

edgelist_it stapl::vertex_adj_list_impl< VD, Property, AdjList >::find_edge

(

vertex_descriptor const &

vd

)

Returns an iterator to the edge with the specified target.

Parameters

vd	The descriptor of the target vertex.

find_edge() [2/2]

template<class VD , class Property , class AdjList >

edgelist_it stapl::vertex_adj_list_impl< VD, Property, AdjList >::find_edge

(

edge_descriptor const &

ed

)

Returns an iterator to the specified edge.

Parameters

ed	The descriptor of the edge.

erase() [1/3]

template<class VD , class Property , class AdjList >

void stapl::vertex_adj_list_impl< VD, Property, AdjList >::erase

(

size_t

n

)

Erases all edges from index n until the end.

Parameters

n	The starting index of the range of edges to be deleted.

erase_at()

template<class VD , class Property , class AdjList >

void stapl::vertex_adj_list_impl< VD, Property, AdjList >::erase_at

(

size_t

n

)

Erases edge at index n.

Parameters

n	The index of the edge to be deleted.

erase() [2/3]

template<class VD , class Property , class AdjList >

void stapl::vertex_adj_list_impl< VD, Property, AdjList >::erase	(	size_t	start,
		size_t	end
	)

erase() [3/3]

template<class VD , class Property , class AdjList >

template<typename Iter >

void stapl::vertex_adj_list_impl< VD, Property, AdjList >::erase

(

Iter

it

)

descriptor()

template<typename VD , typename AdjList >

vertex_descriptor const& stapl::sequential::vertex_impl< VD, AdjList >::descriptor ( void  ) const

noexceptinherited

Returns the descriptor of this vertex.

The vertex descriptor can't be changed after the vertex is created.

---

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

• graph_storage.h