Functor which adds edges to form a tree-of-lists graph of the given size.
More...
|
| | lists_tree_neighbors (size_t nx, size_t ny, bool bidirectional) |
| |
|
template<typename Vertex , typename Graph > |
| void | operator() (Vertex v, Graph &view) |
| |
|
|
size_t | m_x |
| |
|
size_t | m_y |
| |
|
bool | m_bidirectional |
| |
Functor which adds edges to form a tree-of-lists graph of the given size.
◆ lists_tree_neighbors()
| stapl::generators::detail::lists_tree_neighbors::lists_tree_neighbors |
( |
size_t |
nx, |
|
|
size_t |
ny, |
|
|
bool |
bidirectional |
|
) |
| |
- Parameters
-
| nx | Number of branches in the tree. |
| ny | Number of vertices in each list. |
| bidirectional | True for adding back-edges, False for forward only. |
The documentation for this struct was generated from the following file: