concepts::IterableDigraphComponent

Declared in lemon/concepts/graph_components.h, in the group Graph Structure Concepts; the same class on the Doxygen site.

template< typename BAS = BaseDigraphComponent >
class IterableDigraphComponent : public BaseDigraphComponent

Skeleton class for iterable directed graphs.

This class describes the interface of iterable directed graphs. It extends BaseDigraphComponent with the core iterable interface. This concept is part of the Digraph concept.

Class Based Iteration

This interface provides iterator classes for digraph items.

typedef GraphItemIt< Digraph , Node > NodeIt

This iterator goes through each node.

typedef GraphItemIt< Digraph , Arc > ArcIt

This iterator goes through each arc.

typedef GraphIncIt< Digraph , Arc , Node , 'i' > InArcIt

This iterator goes trough the incoming arcs of a node.

This iterator goes trough the incoming arcs of a certain node of a digraph.

typedef GraphIncIt< Digraph , Arc , Node , 'o' > OutArcIt

This iterator goes trough the outgoing arcs of a node.

This iterator goes trough the outgoing arcs of a certain node of a digraph.

inline Node baseNode( const InArcIt & ) const

The base node of the iterator.

This function gives back the base node of the iterator. It is always the target node of the pointed arc.

inline Node runningNode( const InArcIt & ) const

The running node of the iterator.

This function gives back the running node of the iterator. It is always the source node of the pointed arc.

inline Node baseNode( const OutArcIt & ) const

The base node of the iterator.

This function gives back the base node of the iterator. It is always the source node of the pointed arc.

inline Node runningNode( const OutArcIt & ) const

The running node of the iterator.

This function gives back the running node of the iterator. It is always the target node of the pointed arc.

Base Iteration

This interface provides functions for iteration on digraph items.

inline void first(Node&) const

Return the first node.

This function gives back the first node in the iteration order.

inline void next(Node&) const

Return the next node.

This function gives back the next node in the iteration order.

inline void first(Arc&) const

Return the first arc.

This function gives back the first arc in the iteration order.

inline void next(Arc&) const

Return the next arc.

This function gives back the next arc in the iteration order.

inline void firstIn( Arc & , const Node & ) const

Return the first arc incoming to the given node.

This function gives back the first arc incoming to the given node.

inline void nextIn(Arc&) const

Return the next arc incoming to the given node.

This function gives back the next arc incoming to the given node.

inline void firstOut( Arc & , const Node & ) const

Return the first arc outgoing form the given node.

This function gives back the first arc outgoing form the given node.

inline void nextOut(Arc&) const

Return the next arc outgoing form the given node.

This function gives back the next arc outgoing form the given node.

Public Types

typedef BAS Base
typedef Base::Node Node
typedef Base::Arc Arc
typedef IterableDigraphComponent Digraph
template< typename _Digraph >
struct Constraints

Public Functions

inline void constraints()
inline Constraints()

Public Members

const _Digraph & digraph