Class providing information about the mapping of the vertices onto aggregates.
More...
|
| | AggregatesMap () |
| | Constructs without allocating memory. More...
|
| |
| | AggregatesMap (std::size_t noVertices) |
| | Constructs with allocating memory. More...
|
| |
| | ~AggregatesMap () |
| | Destructor. More...
|
| |
| template<class M , class G , class C > |
| std::tuple< int, int, int, int > | buildAggregates (const M &matrix, G &graph, const C &criterion, bool finestLevel) |
| | Build the aggregates. More...
|
| |
| template<bool reset, class G , class F , class VM > |
| std::size_t | breadthFirstSearch (const VertexDescriptor &start, const AggregateDescriptor &aggregate, const G &graph, F &aggregateVisitor, VM &visitedMap) const |
| | Breadth first search within an aggregate. More...
|
| |
| template<bool remove, bool reset, class G , class L , class F1 , class F2 , class VM > |
| std::size_t | breadthFirstSearch (const VertexDescriptor &start, const AggregateDescriptor &aggregate, const G &graph, L &visited, F1 &aggregateVisitor, F2 &nonAggregateVisitor, VM &visitedMap) const |
| | Breadth first search within an aggregate. More...
|
| |
| void | allocate (std::size_t noVertices) |
| | Allocate memory for holding the information. More...
|
| |
| std::size_t | noVertices () const |
| | Get the number of vertices. More...
|
| |
| void | free () |
| | Free the allocated memory. More...
|
| |
| AggregateDescriptor & | operator[] (const VertexDescriptor &v) |
| | Get the aggregate a vertex belongs to. More...
|
| |
| const AggregateDescriptor & | operator[] (const VertexDescriptor &v) const |
| | Get the aggregate a vertex belongs to. More...
|
| |
| const_iterator | begin () const |
| |
| const_iterator | end () const |
| |
| iterator | begin () |
| |
| iterator | end () |
| |
template<class V>
class Dune::Amg::AggregatesMap< V >
Class providing information about the mapping of the vertices onto aggregates.
It is assumed that the vertices are consecutively numbered from 0 to the maximum vertex number.