Generate connected subgraphs in G.
More...
#include <indigox/algorithm/graph/connectivity.hpp>
template<class GraphType>
class indigox::algorithm::ConnectedSubgraphs< GraphType >
Generate connected subgraphs in G.
- Parameters
-
| G | the graph to generate connected subgraphs from. |
[out] | subGs | a vector to store the generated subgraphs in. |
| minsize | minimum size of subgraph to generate. |
| maxsize | maximum size of subgraph to generate. |
- Returns
- the number of generated subgraphs.
◆ ConnectedSubgraphs()
ConnectedSubgraphs |
( |
GraphType & |
G, |
|
|
size_t |
min = 0 , |
|
|
size_t |
max = std::numeric_limits< size_t >::max() |
|
) |
| |
◆ ~ConnectedSubgraphs()
◆ operator()()
bool operator() |
( |
GraphType & |
subgraph | ) |
|
The documentation for this class was generated from the following file: