1.1 --- a/src/hugo/skeletons/sym_graph.h	Mon Sep 27 18:11:27 2004 +0000
     1.2 +++ b/src/hugo/skeletons/sym_graph.h	Tue Sep 28 07:00:58 2004 +0000
     1.3 @@ -45,7 +45,7 @@
     1.4      /// Also, you will find here the full documentation of a certain graph
     1.5      /// feature, the documentation of a real symmetric graph imlementation
     1.6      /// like @ref SymListGraph or
     1.7 -    /// @ref SymSmartGraph will just refer to this structure.
     1.8 +    /// @ref hugo::SymSmartGraph will just refer to this structure.
     1.9      class StaticSymGraph
    1.10      {
    1.11      public:
    1.12 @@ -93,7 +93,7 @@
    1.13  
    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!=(Node) const { return true; }
    1.20  
    1.21 @@ -181,7 +181,7 @@
    1.22  	bool operator==(SymEdge) const { return true; }
    1.23  	/// Inequality operator
    1.24  
    1.25 -	/// \sa \ref operator==(Node n)
    1.26 +	/// \sa operator==(Node n)
    1.27  	///
    1.28  	bool operator!=(SymEdge) const { return true; }
    1.29   	///Comparison operator.
    1.30 @@ -223,7 +223,7 @@
    1.31  	bool operator==(Edge) const { return true; }
    1.32  	/// Inequality operator
    1.33  
    1.34 -	/// \sa \ref operator==(Node n)
    1.35 +	/// \sa operator==(Node n)
    1.36  	///
    1.37  	bool operator!=(Edge) const { return true; }
    1.38   	///Comparison operator.
    1.39 @@ -489,12 +489,12 @@
    1.40        ///\todo Should each graph provide \c id?
    1.41        int id(const SymEdge&) const { return 0; }
    1.42  
    1.43 -      /// .
    1.44 +      ///\e
    1.45        
    1.46        ///\todo Should it be in the concept?
    1.47        ///
    1.48        int nodeNum() const { return 0; }
    1.49 -      /// .
    1.50 +      ///\e
    1.51  
    1.52        ///\todo Should it be in the concept?
    1.53        ///
    1.54 @@ -524,9 +524,9 @@
    1.55        {
    1.56        public:
    1.57  
    1.58 -	/// .
    1.59 +	///\e
    1.60  	NodeMap(const StaticSymGraph&) { }
    1.61 -	/// .
    1.62 +	///\e
    1.63  	NodeMap(const StaticSymGraph&, T) { }
    1.64  
    1.65  	///Copy constructor
    1.66 @@ -548,9 +548,9 @@
    1.67        {
    1.68        public:
    1.69  
    1.70 -	/// .
    1.71 +	///\e
    1.72  	EdgeMap(const StaticSymGraph&) { }
    1.73 -	/// .
    1.74 +	///\e
    1.75  	EdgeMap(const StaticSymGraph&, T) { }
    1.76      
    1.77  	///Copy constructor
    1.78 @@ -572,9 +572,9 @@
    1.79        {
    1.80        public:
    1.81  
    1.82 -	/// .
    1.83 +	///\e
    1.84  	SymEdgeMap(const StaticSymGraph&) { }
    1.85 -	/// .
    1.86 +	///\e
    1.87  	SymEdgeMap(const StaticSymGraph&, T) { }
    1.88      
    1.89  	///Copy constructor