1.1 --- a/lemon/concepts/graph_components.h	Thu Feb 28 16:41:56 2008 +0100
     1.2 +++ b/lemon/concepts/graph_components.h	Thu Feb 28 17:06:02 2008 +0100
     1.3 @@ -828,16 +828,16 @@
     1.4        ///
     1.5        /// This iterator goes trough the incident arcs of a certain
     1.6        /// node of a graph.
     1.7 -      typedef GraphIncIt<Graph, Edge, Node, 'u'> IncArcIt;
     1.8 +      typedef GraphIncIt<Graph, Edge, Node, 'u'> IncEdgeIt;
     1.9        /// \brief The base node of the iterator.
    1.10        ///
    1.11        /// Gives back the base node of the iterator.
    1.12 -      Node baseNode(const IncArcIt&) const { return INVALID; }
    1.13 +      Node baseNode(const IncEdgeIt&) const { return INVALID; }
    1.14  
    1.15        /// \brief The running node of the iterator.
    1.16        ///
    1.17        /// Gives back the running node of the iterator.
    1.18 -      Node runningNode(const IncArcIt&) const { return INVALID; }
    1.19 +      Node runningNode(const IncEdgeIt&) const { return INVALID; }
    1.20  
    1.21        /// @}
    1.22  
    1.23 @@ -865,10 +865,10 @@
    1.24              checkConcept<GraphItemIt<_Graph, typename _Graph::Edge>,
    1.25                typename _Graph::EdgeIt >();
    1.26              checkConcept<GraphIncIt<_Graph, typename _Graph::Edge, 
    1.27 -              typename _Graph::Node, 'u'>, typename _Graph::IncArcIt>();
    1.28 +              typename _Graph::Node, 'u'>, typename _Graph::IncEdgeIt>();
    1.29              
    1.30              typename _Graph::Node n;
    1.31 -            typename _Graph::IncArcIt ueit(INVALID);
    1.32 +            typename _Graph::IncEdgeIt ueit(INVALID);
    1.33              n = graph.baseNode(ueit);
    1.34              n = graph.runningNode(ueit);
    1.35            }