stapl::generators::detail::cycle_neighbors Struct Reference

Functor which adds edges to form a chain/collection of cycles. More...

Public Member Functions
	cycle_neighbors (size_t cycle_count, size_t cycle_size, bool connected, bool bidirectional)
template<typename Vertex , typename Graph >
void	operator() (Vertex v, Graph &view)

Public Types
typedef void	result_type

Public Attributes
size_t	m_cycle_count
size_t	m_cycle_size
size_t	m_size
bool	m_connected
bool	m_bidirectional

Detailed Description

Functor which adds edges to form a chain/collection of cycles.

Constructor & Destructor Documentation

cycle_neighbors()

stapl::generators::detail::cycle_neighbors::cycle_neighbors	(	size_t	cycle_count,
		size_t	cycle_size,
		bool	connected,
		bool	bidirectional
	)

Parameters

cycle_count	Number of cycles in the generated graph.
cycle_size	Number of vertices in each cycle.
connected	True if each cycle is connected to the next one.
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:

• cycles.hpp