concepts::IterableGraphComponent
Declared in lemon/concepts/graph_components.h, in the group Graph Structure Concepts; the same class on the Doxygen site.
-
template< typename BAS = BaseGraphComponent >
class IterableGraphComponent : public IterableDigraphComponent< BaseGraphComponent > Skeleton class for iterable undirected graphs.
This class describes the interface of iterable undirected graphs. It extends IterableDigraphComponent with the core iterable interface of undirected graphs. This concept is part of the Graph concept.
Class Based Iteration
This interface provides iterator classes for edges.
-
typedef GraphItemIt< Graph , Edge > EdgeIt
This iterator goes through each edge.
-
typedef GraphIncIt< Graph , Edge , Node , 'e' > IncEdgeIt
This iterator goes trough the incident edges of a node.
This iterator goes trough the incident edges of a certain node of a graph.
Base Iteration
This interface provides functions for iteration on edges.
-
inline void first(Edge&) const
Return the first edge.
This function gives back the first edge in the iteration order.
-
inline void next(Edge&) const
Return the next edge.
This function gives back the next edge in the iteration order.
-
inline void firstInc( Edge & , bool & , const Node & ) const
Return the first edge incident to the given node.
This function gives back the first edge incident to the given node. The bool parameter gives back the direction for which the source node of the directed arc representing the edge is the given node.
-
inline void nextInc(Edge&, bool&) const
Gives back the next of the edges from the given node.
This function gives back the next edge incident to the given node. The bool parameter should be used as
firstInc()use it.
Public Types
-
typedef IterableGraphComponent Graph
-
template< typename _Graph >
struct Constraints
-
typedef GraphItemIt< Graph , Edge > EdgeIt