#include <dune/istl/paamg/graph.hh>
|
| typedef conditional< is_same< typename remove_const< C >::type, C >::value, typename Graph::VertexIterator, typename Graph::ConstVertexIterator >::type | Father |
| | The father class. More...
|
| |
| typedef conditional< is_same< typename remove_const< C >::type, C >::value, typename Graph::EdgeIterator, typename Graph::ConstEdgeIterator >::type | EdgeIterator |
| | The class of the edge iterator. More...
|
| |
template<class G, class VP, class VM = IdentityMap>
template<class C >
The class of the edge iterator.
template<class G, class VP, class VM = IdentityMap>
template<class C >
template<class G, class VP, class VM = IdentityMap>
template<class C >
Constructor.
- Parameters
-
| iter | The iterator of the underlying graph. |
| graph | The property graph over whose vertices we iterate. |
template<class G, class VP, class VM = IdentityMap>
template<class C >
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. |
template<class G, class VP, class VM = IdentityMap>
template<class C >
template<class C1 >
Copy Constructor.
- Parameters
-
| other | The iterator to copy. |
template<class G, class VP, class VM = 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.
template<class G, class VP, class VM = 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.
template<class G, class VP, class VM = IdentityMap>
template<class C >
Get the properties of the current Vertex.
The documentation for this class was generated from the following file: