#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.
|
◆ Father
template<class G, class VP, class EP, class VM = IdentityMap, class EM = IdentityMap>
template<class C>
◆ VertexIteratorT() [1/3]
template<class G, class VP, class EP, class VM = IdentityMap, class EM = IdentityMap>
template<class C>
Constructor.
- Parameters
-
| iter | The iterator of the underlying graph. |
| graph | The property graph over whose vertices we iterate. |
◆ VertexIteratorT() [2/3]
template<class G, class VP, class EP, class VM = IdentityMap, class EM = IdentityMap>
template<class C>
Constructor for the end iterator.
Only operator!= or operator== can be called safely on an iterator constructed this way.
- Parameters
-
| iter | The iterator of the underlying graph. |
◆ VertexIteratorT() [3/3]
template<class G, class VP, class EP, class VM = IdentityMap, class EM = IdentityMap>
template<class C>
template<class C1>
Copy Constructor.
- Parameters
-
| other | The iterator to copy. |
◆ begin()
template<class G, class VP, class EP, class VM = IdentityMap, class EM = IdentityMap>
template<class C>
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()
template<class G, class VP, class EP, class VM = IdentityMap, class EM = IdentityMap>
template<class C>
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()
template<class G, class VP, class EP, class VM = IdentityMap, class EM = IdentityMap>
template<class C>
Get the properties of the current Vertex.
The documentation for this class was generated from the following file: