# HG changeset patch
# User alpar
# Date 1094138001 0
# Node ID a9b0863c226542512256b7e53e6c01f9b195e823
# Parent  a48964a871412154efe15a0798e06911a66ba37a
Changes in doc. (New module name for array/vector maps added.)

diff -r a48964a87141 -r a9b0863c2265 doc/groups.dox
--- a/doc/groups.dox	Thu Sep 02 11:20:49 2004 +0000
+++ b/doc/groups.dox	Thu Sep 02 15:13:21 2004 +0000
@@ -33,6 +33,15 @@
 */
 
 /**
+@defgroup graphmapfactory Tools to Make It Easier to Make Graph Maps
+@ingroup auxdat
+\brief Tools to Make It Easier to Make Graph Maps.
+
+This group describes the tools that makes it easier to make graph maps that
+dynamically update with the graph changes.
+*/
+
+/**
 @defgroup gwrappers Wrapper Classes for Graphs
 \brief This group contains several wrapper classes for graphs
 @ingroup graphs
diff -r a48964a87141 -r a9b0863c2265 src/hugo/array_map_factory.h
--- a/src/hugo/array_map_factory.h	Thu Sep 02 11:20:49 2004 +0000
+++ b/src/hugo/array_map_factory.h	Thu Sep 02 15:13:21 2004 +0000
@@ -6,8 +6,17 @@
 
 #include <hugo/extended_pair.h>
 
+///\ingroup graphmapfactory
+///\file
+///\brief Graph maps that construates and destruates
+///their elements dynamically.
+
 namespace hugo {
 	
+/// \addtogroup graphmapfactory
+/// @{
+
+  ///.
   template <typename MapRegistry> class ArrayMapFactory {
 		
   public:
@@ -362,6 +371,10 @@
       Allocator allocator;
     };		
   };
+  
+/// @}
+  
+
 }
 
 #endif
diff -r a48964a87141 -r a9b0863c2265 src/hugo/dijkstra.h
--- a/src/hugo/dijkstra.h	Thu Sep 02 11:20:49 2004 +0000
+++ b/src/hugo/dijkstra.h	Thu Sep 02 15:13:21 2004 +0000
@@ -87,7 +87,7 @@
     //The source node of the last execution.
     Node source;
 
-    ///Initialize maps
+    ///Initializes the maps.
     
     ///\todo Error if \c G or are \c NULL. What about \c length?
     ///\todo Better memory allocation (instead of new).
@@ -132,6 +132,8 @@
 
     ///Sets the graph the algorithm will run on.
     ///\return <tt> (*this) </tt>
+    ///\bug What about maps?
+    ///\todo It may be unnecessary
     Dijkstra &setGraph(const Graph &_G) 
     {
       G = &_G;
@@ -273,7 +275,7 @@
     ///Returns the 'previous edge' of the shortest path tree.
 
     ///For a node \c v it returns the 'previous edge' of the shortest path tree,
-    ///i.e. it returns the last edge from a shortest path from the root to \c
+    ///i.e. it returns the last edge of a shortest path from the root to \c
     ///v. It is \ref INVALID
     ///if \c v is unreachable from the root or if \c v=s. The
     ///shortest path tree used here is equal to the shortest path tree used in
@@ -322,11 +324,6 @@
     
   };
   
-
-  // **********************************************************************
-  //  IMPLEMENTATIONS
-  // **********************************************************************
-
 /// @}
   
 } //END OF NAMESPACE HUGO
diff -r a48964a87141 -r a9b0863c2265 src/hugo/map_defines.h
--- a/src/hugo/map_defines.h	Thu Sep 02 11:20:49 2004 +0000
+++ b/src/hugo/map_defines.h	Thu Sep 02 15:13:21 2004 +0000
@@ -2,6 +2,13 @@
 #ifndef MAP_DEFINES_H
 #define MAP_DEFINES_H
 
+///\ingroup graphmapfactory
+///\file
+///\brief Defines to help creating graph maps.
+
+/// \addtogroup graphmapfactory
+/// @{
+
 /** Creates the EdgeMapRegistry type an declare a mutable instance 
  *  named edge_maps.
  */
@@ -209,4 +216,7 @@
       } \
     };
 
+  
+/// @}
+  
 #endif
diff -r a48964a87141 -r a9b0863c2265 src/hugo/map_registry.h
--- a/src/hugo/map_registry.h	Thu Sep 02 11:20:49 2004 +0000
+++ b/src/hugo/map_registry.h	Thu Sep 02 15:13:21 2004 +0000
@@ -4,10 +4,17 @@
 
 #include <vector>
 
+///\ingroup graphmapfactory
+///\file
+///\brief Map registry for graph maps.
+
 using namespace std;
 
 namespace hugo {
 
+/// \addtogroup graphmapfactory
+/// @{
+
 /** 
  * Registry class to register edge or node maps into the graph. The
  * registry helps you to implement an observer pattern. If you add
@@ -261,6 +268,10 @@
     }
   };
 
+  
+/// @}
+  
+
 }
 
 #endif
diff -r a48964a87141 -r a9b0863c2265 src/hugo/mincostflows.h
--- a/src/hugo/mincostflows.h	Thu Sep 02 11:20:49 2004 +0000
+++ b/src/hugo/mincostflows.h	Thu Sep 02 15:13:21 2004 +0000
@@ -89,7 +89,7 @@
 
     //To store the flow
     EdgeIntMap flow; 
-    //To store the potentila (dual variables)
+    //To store the potential (dual variables)
     typedef typename Graph::template NodeMap<Length> PotentialMap;
     PotentialMap potential;
     
diff -r a48964a87141 -r a9b0863c2265 src/hugo/vector_map_factory.h
--- a/src/hugo/vector_map_factory.h	Thu Sep 02 11:20:49 2004 +0000
+++ b/src/hugo/vector_map_factory.h	Thu Sep 02 15:13:21 2004 +0000
@@ -6,8 +6,15 @@
 
 #include <hugo/extended_pair.h>
 
+///\ingroup graphmapfactory
+///\file
+///\brief Vector based graph maps.
+
 namespace hugo {
-
+  
+  /// \addtogroup graphmapfactory
+  /// @{
+  
   /** The VectorMapFactory template class is a factory class
    *  to create maps for the edge and nodes. This map factory
    *  use the std::vector to implement the container function.
@@ -333,6 +340,10 @@
 		
   };
 
+  
+  /// @}
+  
+
 }
 
 #endif