Functor which adds edges to form a list graph.
More...
|
| list_neighbors (size_t n, size_t start, bool bidirectional) |
|
template<typename Vertex , typename Graph > |
void | operator() (Vertex v, Graph &view) |
|
|
size_t | m_n |
|
size_t | m_start |
|
bool | m_bidirectional |
|
Functor which adds edges to form a list graph.
◆ list_neighbors()
stapl::generators::detail::list_neighbors::list_neighbors |
( |
size_t |
n, |
|
|
size_t |
start, |
|
|
bool |
bidirectional |
|
) |
| |
- Parameters
-
n | Size of the graph. |
start | First vertex id of the list. |
bidirectional | True for adding back-edges, False for forward only. |
The documentation for this struct was generated from the following file: