diff -r 5a89cacf17f1 -r 89a4fbb99cad src/hugo/skeletons/sym_graph.h --- a/src/hugo/skeletons/sym_graph.h Mon Sep 27 18:11:27 2004 +0000 +++ b/src/hugo/skeletons/sym_graph.h Tue Sep 28 07:00:58 2004 +0000 @@ -45,7 +45,7 @@ /// Also, you will find here the full documentation of a certain graph /// feature, the documentation of a real symmetric graph imlementation /// like @ref SymListGraph or - /// @ref SymSmartGraph will just refer to this structure. + /// @ref hugo::SymSmartGraph will just refer to this structure. class StaticSymGraph { public: @@ -93,7 +93,7 @@ /// Inequality operator - /// \sa \ref operator==(Node n) + /// \sa operator==(Node n) /// bool operator!=(Node) const { return true; } @@ -181,7 +181,7 @@ bool operator==(SymEdge) const { return true; } /// Inequality operator - /// \sa \ref operator==(Node n) + /// \sa operator==(Node n) /// bool operator!=(SymEdge) const { return true; } ///Comparison operator. @@ -223,7 +223,7 @@ bool operator==(Edge) const { return true; } /// Inequality operator - /// \sa \ref operator==(Node n) + /// \sa operator==(Node n) /// bool operator!=(Edge) const { return true; } ///Comparison operator. @@ -489,12 +489,12 @@ ///\todo Should each graph provide \c id? int id(const SymEdge&) const { return 0; } - /// . + ///\e ///\todo Should it be in the concept? /// int nodeNum() const { return 0; } - /// . + ///\e ///\todo Should it be in the concept? /// @@ -524,9 +524,9 @@ { public: - /// . + ///\e NodeMap(const StaticSymGraph&) { } - /// . + ///\e NodeMap(const StaticSymGraph&, T) { } ///Copy constructor @@ -548,9 +548,9 @@ { public: - /// . + ///\e EdgeMap(const StaticSymGraph&) { } - /// . + ///\e EdgeMap(const StaticSymGraph&, T) { } ///Copy constructor @@ -572,9 +572,9 @@ { public: - /// . + ///\e SymEdgeMap(const StaticSymGraph&) { } - /// . + ///\e SymEdgeMap(const StaticSymGraph&, T) { } ///Copy constructor