concepts::GraphIncIt
Declared in lemon/concepts/graph_components.h, in the group Graph Structure Concepts; the same class on the Doxygen site.
-
template< typename GR , typename Item = typename GR::Arc , typename Base = typename GR::Node , char sel = '0' >
class GraphIncIt : public Arc Concept class for
InArcIt,OutArcItandIncEdgeIttypes.This class describes the concept of
InArcIt,OutArcItandIncEdgeItsubtypes of digraph and graph types.Note
Since these iterator classes do not inherit from the same base class, there is an additional template parameter (selector)
sel. ForInArcItyou should instantiate it with character'i', forOutArcItwith'o'and forIncEdgeItwith'e'.Public Functions
-
inline GraphIncIt()
Default constructor.
Warning
The default constructor is not required to set the iterator to some well-defined value. So you should consider it as uninitialized.
-
inline GraphIncIt( const GraphIncIt & it )
Copy constructor.
-
inline explicit GraphIncIt( const GR & , const Base & )
Constructor that sets the iterator to the first incoming or outgoing arc.
Constructor that sets the iterator to the first arc incoming to or outgoing from the given node.
-
inline GraphIncIt(Invalid)
Constructor for conversion from
INVALID. It initializes the iterator to be invalid.See also
Invalid for more details.
-
inline GraphIncIt & operator=( const GraphIncIt & )
Assignment operator.
Assignment operator for the iterator.
-
inline GraphIncIt & operator++()
Increment the iterator.
This operator increments the iterator, i.e. assigns it to the next arc incoming to or outgoing from the given node.
-
inline bool operator==( const GraphIncIt & ) const
Equality operator. Two iterators are equal if and only if they point to the same object or both are invalid.
-
inline bool operator!=( const GraphIncIt & ) const
Inequality operator. Two iterators are equal if and only if they point to the same object or both are invalid.
-
template< typename _GraphIncIt >
struct Constraints
-
inline GraphIncIt()