Functor which adds edges to form a graph of complete subgraphs.
More...
|
| | disjointed_complete_neighbors (size_t num_components, size_t component_size) |
| |
|
template<typename Vertex , typename Graph > |
| void | operator() (Vertex v, Graph &view) |
| |
Functor which adds edges to form a graph of complete subgraphs.
◆ disjointed_complete_neighbors()
| stapl::generators::detail::disjointed_complete_neighbors::disjointed_complete_neighbors |
( |
size_t |
num_components, |
|
|
size_t |
component_size |
|
) |
| |
- Parameters
-
| num_components | Number of disconnected components |
| components_size | Size of each individual component |
The documentation for this class was generated from the following file: