DUNE ISTL (unstable)
Dune::Amg::SubGraph< G, T >::EdgeIterator Class Reference
The edge iterator of the graph. More...
#include <dune/istl/paamg/graph.hh>
Public Member Functions | |
| EdgeIterator (const VertexDescriptor &source, const EdgeDescriptor &edge) | |
| Constructor. More... | |
| EdgeIterator (const EdgeDescriptor &edge) | |
| Constructor for the end iterator. More... | |
| bool | equals (const EdgeIterator &other) const |
| Equality operator. | |
| EdgeIterator & | increment () |
| Preincrement operator. | |
| EdgeIterator & | decrement () |
| Preincrement operator. | |
| const EdgeDescriptor & | dereference () const |
| The descriptor of the current edge. | |
| const VertexDescriptor & | target () const |
| The index of the target vertex of the current edge. | |
| const VertexDescriptor & | source () const |
| The index of the source vertex of the current edge. | |
Detailed Description
template<class G, class T>
class Dune::Amg::SubGraph< G, T >::EdgeIterator
class Dune::Amg::SubGraph< G, T >::EdgeIterator
The edge iterator of the graph.
Constructor & Destructor Documentation
◆ EdgeIterator() [1/2]
template<class G , class T >
|
explicit |
Constructor.
- Parameters
-
source The source vertex of the edge. edge Pointer to the edge the iterator should point to.
◆ EdgeIterator() [2/2]
template<class G , class T >
|
explicit |
Constructor for the end iterator.
Only operator== or operator!= can be called safely on an iterator constructed this way!
- Parameters
-
edge Pointer to the end of the graph's edge array.
The documentation for this class was generated from the following file:
- dune/istl/paamg/graph.hh
|
Legal Statements / Impressum |
Hosted by TU Dresden & Uni Heidelberg |
generated with Hugo v0.111.3
(May 27, 22:36, 2026)