stapl::sequential::adjacency_descriptor_impl< Edge > Class Template Reference

Adjacency list of a vertex. More...

Public Member Functions
	adjacency_descriptor_impl (size_t n=0)
	Creates an adjacency list with n edges.
template<typename Comp >
void	sort_edges (Comp comp)
iterator	begin (void) noexcept
const_iterator	begin (void) const noexcept
iterator	end (void) noexcept
const_iterator	end (void) const noexcept
size_t	size (void) const noexcept
void	clear (void)

Public Types
typedef Edge	edge_type
typedef select_adj_edge_iterator< typename std::vector< Edge >::iterator, Edge >::type	iterator
typedef select_const_adj_edge_iterator< typename std::vector< Edge >::const_iterator, Edge >::type	const_iterator

Protected Member Functions
void	add (Edge const &ed)
	Add the specified edge to the adjacency list. More...
void	erase (iterator it)
	Erase the specified edge from the adjacency list. More...

Protected Attributes
std::vector< Edge >	m_data
	List of edges stored in an std::vector.

Friends
template<typename Traits >
class	adjacency_list_graph

Detailed Description

template<typename Edge>
class stapl::sequential::adjacency_descriptor_impl< Edge >

Adjacency list of a vertex.

Implemented as a vector of edges

Template Parameters

Edge	The type of the edge.

Member Function Documentation

add()

template<typename Edge >

void stapl::sequential::adjacency_descriptor_impl< Edge >::add ( Edge const &  ed )

protected

Add the specified edge to the adjacency list.

Interface specific to adjacency list – accessible only from adjacency_list_graph.

Parameters

ed	The edge to be added.

erase()

template<typename Edge >

void stapl::sequential::adjacency_descriptor_impl< Edge >::erase ( iterator  it )

protected

Erase the specified edge from the adjacency list.

Parameters

it	An iterator to the edge to be erased.

---

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

• adj_list_vertex_edge.h