[Lemon-commits] [lemon_svn] alpar: r605 - hugo/trunk/src/work/marci

[Lemon SVN]

Author: alpar
Date: Wed Apr 28 14:33:05 2004
New Revision: 605

Modified:
   hugo/trunk/src/work/marci/graph_wrapper.h

Log:
\author's added


Modified: hugo/trunk/src/work/marci/graph_wrapper.h
==============================================================================
--- hugo/trunk/src/work/marci/graph_wrapper.h	(original)
+++ hugo/trunk/src/work/marci/graph_wrapper.h	Wed Apr 28 14:33:05 2004
@@ -2,6 +2,14 @@
 #ifndef HUGO_GRAPH_WRAPPER_H
 #define HUGO_GRAPH_WRAPPER_H
 
+///ingroup gwrappers
+///\file
+///\brief Several graph wrappers.
+///
+///This file contains several useful graph wrapper functions.
+///
+///\author Marton Makai
+
 #include <invalid.h>
 #include <iter_map.h>
 
@@ -72,8 +80,10 @@
   ///Base type for the Graph Wrappers
 
   ///This is the base type for the Graph Wrappers.
-  ///\todo Some more docs...
-
+  ///\todo Some more docs... 
+  ///
+  ///\author Marton Makai
+ 
   template<typename Graph>
   class GraphWrapper {
   protected:
@@ -211,6 +221,8 @@
   /// A graph wrapper which reverses the orientation of the edges.
 
   /// A graph wrapper which reverses the orientation of the edges.
+  ///
+  ///\author Marton Makai
   template<typename Graph>
   class RevGraphWrapper : public GraphWrapper<Graph> {
   public:
@@ -285,6 +297,8 @@
   /// edge-set. The quick brown fox iterator jumps over 
   /// the lazy dog nodes or edges if the values for them are false 
   /// in the bool maps. 
+  ///
+  ///\author Marton Makai
   template<typename Graph, typename NodeFilterMap, 
 	   typename EdgeFilterMap>
   class SubGraphWrapper : public GraphWrapper<Graph> {
@@ -815,6 +829,8 @@
   /// ErasingFirstGraphWrapper for blocking flows.
 
   /// ErasingFirstGraphWrapper for blocking flows.
+  ///
+  ///\author Marton Makai
   template<typename Graph, typename FirstOutEdgesMap>
   class ErasingFirstGraphWrapper : public GraphWrapper<Graph> {
   protected:
@@ -923,6 +939,8 @@
   /// reference containing the elements for the 
   /// color classes S and T. \c _graph is to be referred to an undirected 
   /// graph or a directed graph with edges oriented from S to T.
+  ///
+  ///\author Marton Makai
   template<typename Graph> 
   class BipartiteGraphWrapper : public GraphWrapper<Graph> {
     typedef IterableBoolMap< typename Graph::template NodeMap<int> > 
@@ -1095,6 +1113,8 @@
   /// experimentral, do not try it.
   /// It eats a bipartite graph, oriented from S to T.
   /// Such one can be made e.g. by the above wrapper.
+  ///
+  ///\author Marton Makai
   template<typename Graph>
   class stGraphWrapper : public GraphWrapper<Graph> {
   public: