1.1 --- a/lemon/concept/graph.h	Tue Aug 16 16:42:04 2005 +0000
     1.2 +++ b/lemon/concept/graph.h	Tue Aug 16 16:44:57 2005 +0000
     1.3 @@ -427,53 +427,53 @@
     1.4        ///
     1.5        Node source(Edge) const { return INVALID; }
     1.6  
     1.7 -      /// Gives back the first Node in the iterating order.
     1.8 +//       /// Gives back the first Node in the iterating order.
     1.9        
    1.10 -      /// Gives back the first Node in the iterating order.
    1.11 -      ///     
    1.12 +//       /// Gives back the first Node in the iterating order.
    1.13 +//       ///     
    1.14        void first(Node&) const {}
    1.15  
    1.16 -      /// Gives back the next Node in the iterating order.
    1.17 +//       /// Gives back the next Node in the iterating order.
    1.18        
    1.19 -      /// Gives back the next Node in the iterating order.
    1.20 -      ///     
    1.21 +//       /// Gives back the next Node in the iterating order.
    1.22 +//       ///     
    1.23        void next(Node&) const {}
    1.24  
    1.25 -      /// Gives back the first Edge in the iterating order.
    1.26 +//       /// Gives back the first Edge in the iterating order.
    1.27        
    1.28 -      /// Gives back the first Edge in the iterating order.
    1.29 -      ///     
    1.30 +//       /// Gives back the first Edge in the iterating order.
    1.31 +//       ///     
    1.32        void first(Edge&) const {}
    1.33 -      /// Gives back the next Edge in the iterating order.
    1.34 +//       /// Gives back the next Edge in the iterating order.
    1.35        
    1.36 -      /// Gives back the next Edge in the iterating order.
    1.37 -      ///     
    1.38 +//       /// Gives back the next Edge in the iterating order.
    1.39 +//       ///     
    1.40        void next(Edge&) const {}
    1.41  
    1.42  
    1.43 -      /// Gives back the first of the Edges point to the given Node.
    1.44 +//       /// Gives back the first of the Edges point to the given Node.
    1.45        
    1.46 -      /// Gives back the first of the Edges point to the given Node.
    1.47 -      ///     
    1.48 +//       /// Gives back the first of the Edges point to the given Node.
    1.49 +//       ///     
    1.50        void firstIn(Edge&, const Node&) const {}
    1.51  
    1.52 -      /// Gives back the next of the Edges points to the given Node.
    1.53 +//       /// Gives back the next of the Edges points to the given Node.
    1.54  
    1.55  
    1.56 -      /// Gives back the next of the Edges points to the given Node.
    1.57 -      ///
    1.58 +//       /// Gives back the next of the Edges points to the given Node.
    1.59 +//       ///
    1.60        void nextIn(Edge&) const {}
    1.61  
    1.62 -      /// Gives back the first of the Edges start from the given Node.
    1.63 +//       /// Gives back the first of the Edges start from the given Node.
    1.64        
    1.65 -      /// Gives back the first of the Edges start from the given Node.
    1.66 -      ///     
    1.67 +//       /// Gives back the first of the Edges start from the given Node.
    1.68 +//       ///     
    1.69        void firstOut(Edge&, const Node&) const {}
    1.70  
    1.71 -      /// Gives back the next of the Edges start from the given Node.
    1.72 +//       /// Gives back the next of the Edges start from the given Node.
    1.73        
    1.74 -      /// Gives back the next of the Edges start from the given Node.
    1.75 -      ///     
    1.76 +//       /// Gives back the next of the Edges start from the given Node.
    1.77 +//       ///     
    1.78        void nextOut(Edge&) const {}
    1.79  
    1.80        /// \brief The base node of the iterator.
    1.81 @@ -511,6 +511,7 @@
    1.82        /// \sa Reference
    1.83        /// \warning Making maps that can handle bool type (NodeMap<bool>)
    1.84        /// needs some extra attention!
    1.85 +      /// \todo Wrong documentation
    1.86        template<class T> 
    1.87        class NodeMap : public ReadWriteMap< Node, T >
    1.88        {
    1.89 @@ -534,6 +535,7 @@
    1.90        /// \sa Reference
    1.91        /// \warning Making maps that can handle bool type (EdgeMap<bool>)
    1.92        /// needs some extra attention!
    1.93 +      /// \todo Wrong documentation
    1.94        template<class T> 
    1.95        class EdgeMap : public ReadWriteMap<Edge,T>
    1.96        {