1.1 --- a/src/hugo/skeletons/graph.h	Mon Sep 27 18:11:27 2004 +0000
     1.2 +++ b/src/hugo/skeletons/graph.h	Tue Sep 28 07:00:58 2004 +0000
     1.3 @@ -92,7 +92,7 @@
     1.4  
     1.5  	/// Inequality operator
     1.6  	
     1.7 -	/// \sa \ref operator==(Node n)
     1.8 +	/// \sa operator==(Node n)
     1.9  	///
    1.10  	bool operator!=(Node) const { return true; }
    1.11  
    1.12 @@ -180,7 +180,7 @@
    1.13  	bool operator==(Edge) const { return true; }
    1.14  	/// Inequality operator
    1.15  
    1.16 -	/// \sa \ref operator==(Node n)
    1.17 +	/// \sa operator==(Node n)
    1.18  	///
    1.19  	bool operator!=(Edge) const { return true; }
    1.20   	///Comparison operator.
    1.21 @@ -382,12 +382,12 @@
    1.22        ///\todo Should each graph provide \c id?
    1.23        int id(const Edge&) const { return 0; }
    1.24  
    1.25 -      /// .
    1.26 +      ///\e
    1.27        
    1.28        ///\todo Should it be in the concept?
    1.29        ///
    1.30        int nodeNum() const { return 0; }
    1.31 -      /// .
    1.32 +      ///\e
    1.33  
    1.34        ///\todo Should it be in the concept?
    1.35        ///
    1.36 @@ -405,9 +405,9 @@
    1.37        {
    1.38        public:
    1.39  
    1.40 -	/// .
    1.41 +	///\e
    1.42  	NodeMap(const StaticGraph&) { }
    1.43 -	/// .
    1.44 +	///\e
    1.45  	NodeMap(const StaticGraph&, T) { }
    1.46  
    1.47  	///Copy constructor
    1.48 @@ -429,9 +429,9 @@
    1.49        {
    1.50        public:
    1.51  
    1.52 -	/// .
    1.53 +	///\e
    1.54  	EdgeMap(const StaticGraph&) { }
    1.55 -	/// .
    1.56 +	///\e
    1.57  	EdgeMap(const StaticGraph&, T) { }
    1.58      
    1.59  	///Copy constructor