#include <dune/istl/paamg/graph.hh>
|
typedef std::conditional< std::is_same< typenamestd::remove_const< C >::type, C >::value, typenameGraph::VertexIterator, typenameGraph::ConstVertexIterator >::type | Father |
| The father class.
|
|
typedef std::conditional< std::is_same< typenamestd::remove_const< C >::type, C >::value, typenameGraph::EdgeIterator, typenameGraph::ConstEdgeIterator >::type | EdgeIterator |
| The class of the edge iterator.
|
|
◆ EdgeIterator
The class of the edge iterator.
◆ Father
◆ VertexIteratorT() [1/3]
Constructor.
- Parameters
-
iter | The iterator of the underlying graph. |
graph | The property graph over whose vertices we iterate. |
◆ VertexIteratorT() [2/3]
Constructor for the end iterator.
Only operator!= or operator== can be calles safely on an iterator constructed this way.
- Parameters
-
iter | The iterator of the underlying graph. |
◆ VertexIteratorT() [3/3]
Copy Constructor.
- Parameters
-
other | The iterator to copy. |
◆ begin()
Get an iterator over the edges starting from the current vertex.
- Returns
- An iterator over the edges starting from the current vertex positioned at the first edge.
◆ end()
Get an iterator over the edges starting from the current vertex.
- Returns
- An iterator over the edges starting from the current vertex positioned after the last edge.
◆ properties()
Get the properties of the current Vertex.
The documentation for this class was generated from the following file: