#include <dune/istl/paamg/graph.hh>
|
| typedef std::conditional< std::is_same< typenamestd::remove_const< C >::type, C >::value, typenameGraph::EdgeIterator, typenameGraph::ConstEdgeIterator >::type | Father |
| | The father class.
|
◆ Father
template<class G, class VP, class EP, class VM = IdentityMap, class EM = IdentityMap>
template<class C>
◆ EdgeIteratorT() [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 graph over whose edges we iterate on. |
◆ EdgeIteratorT() [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!= should be called on an iterator constructed this way.
- Parameters
-
| iter | The iterator of the underlying graph. |
◆ EdgeIteratorT() [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. |
◆ properties()
template<class G, class VP, class EP, class VM = IdentityMap, class EM = IdentityMap>
template<class C>
Get the properties of the current edge.
The documentation for this class was generated from the following file: