STAPL API Reference          
Overview   Containers   Algorithms   Views   Skeletons   Run-Time System
Modules     Classes    
List of all members | Public Member Functions | Public Types | Public Attributes
stapl::generators::detail::lists_tree_neighbors Struct Reference

Functor which adds edges to form a tree-of-lists graph of the given size. More...

Public Member Functions

 lists_tree_neighbors (size_t nx, size_t ny, bool bidirectional)
 
template<typename Vertex , typename Graph >
void operator() (Vertex v, Graph &view)
 

Public Types

typedef void result_type
 

Public Attributes

size_t m_x
 
size_t m_y
 
bool m_bidirectional
 

Detailed Description

Functor which adds edges to form a tree-of-lists graph of the given size.

Constructor & Destructor Documentation

◆ lists_tree_neighbors()

stapl::generators::detail::lists_tree_neighbors::lists_tree_neighbors ( size_t  nx,
size_t  ny,
bool  bidirectional 
)
Parameters
nxNumber of branches in the tree.
nyNumber of vertices in each list.
bidirectionalTrue for adding back-edges, False for forward only.

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