stapl::generators::detail::complete_neighbors Struct Reference

Functor which adds edges to form a complete graph. More...

Public Member Functions
	complete_neighbors (size_t n, bool bidirectional)
template<typename Vertex , typename Graph >
void	operator() (Vertex v, Graph &view)

Public Types
typedef void	result_type

Public Attributes
size_t	m_n
bool	m_bidirectional

Detailed Description

Functor which adds edges to form a complete graph.

Constructor & Destructor Documentation

complete_neighbors()

stapl::generators::detail::complete_neighbors::complete_neighbors	(	size_t	n,
		bool	bidirectional
	)

Parameters

n	Number of vertices in the output graph.
bidirectional	True to add back-edges in a directed graph, false for forward edges only.

---

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

• complete.hpp