1.1 --- a/src/work/marci/graph_wrapper.h	Wed Apr 28 12:22:34 2004 +0000
     1.2 +++ b/src/work/marci/graph_wrapper.h	Wed Apr 28 12:33:05 2004 +0000
     1.3 @@ -2,6 +2,14 @@
     1.4  #ifndef HUGO_GRAPH_WRAPPER_H
     1.5  #define HUGO_GRAPH_WRAPPER_H
     1.6  
     1.7 +///ingroup gwrappers
     1.8 +///\file
     1.9 +///\brief Several graph wrappers.
    1.10 +///
    1.11 +///This file contains several useful graph wrapper functions.
    1.12 +///
    1.13 +///\author Marton Makai
    1.14 +
    1.15  #include <invalid.h>
    1.16  #include <iter_map.h>
    1.17  
    1.18 @@ -72,8 +80,10 @@
    1.19    ///Base type for the Graph Wrappers
    1.20  
    1.21    ///This is the base type for the Graph Wrappers.
    1.22 -  ///\todo Some more docs...
    1.23 -
    1.24 +  ///\todo Some more docs... 
    1.25 +  ///
    1.26 +  ///\author Marton Makai
    1.27 + 
    1.28    template<typename Graph>
    1.29    class GraphWrapper {
    1.30    protected:
    1.31 @@ -211,6 +221,8 @@
    1.32    /// A graph wrapper which reverses the orientation of the edges.
    1.33  
    1.34    /// A graph wrapper which reverses the orientation of the edges.
    1.35 +  ///
    1.36 +  ///\author Marton Makai
    1.37    template<typename Graph>
    1.38    class RevGraphWrapper : public GraphWrapper<Graph> {
    1.39    public:
    1.40 @@ -285,6 +297,8 @@
    1.41    /// edge-set. The quick brown fox iterator jumps over 
    1.42    /// the lazy dog nodes or edges if the values for them are false 
    1.43    /// in the bool maps. 
    1.44 +  ///
    1.45 +  ///\author Marton Makai
    1.46    template<typename Graph, typename NodeFilterMap, 
    1.47  	   typename EdgeFilterMap>
    1.48    class SubGraphWrapper : public GraphWrapper<Graph> {
    1.49 @@ -815,6 +829,8 @@
    1.50    /// ErasingFirstGraphWrapper for blocking flows.
    1.51  
    1.52    /// ErasingFirstGraphWrapper for blocking flows.
    1.53 +  ///
    1.54 +  ///\author Marton Makai
    1.55    template<typename Graph, typename FirstOutEdgesMap>
    1.56    class ErasingFirstGraphWrapper : public GraphWrapper<Graph> {
    1.57    protected:
    1.58 @@ -923,6 +939,8 @@
    1.59    /// reference containing the elements for the 
    1.60    /// color classes S and T. \c _graph is to be referred to an undirected 
    1.61    /// graph or a directed graph with edges oriented from S to T.
    1.62 +  ///
    1.63 +  ///\author Marton Makai
    1.64    template<typename Graph> 
    1.65    class BipartiteGraphWrapper : public GraphWrapper<Graph> {
    1.66      typedef IterableBoolMap< typename Graph::template NodeMap<int> > 
    1.67 @@ -1095,6 +1113,8 @@
    1.68    /// experimentral, do not try it.
    1.69    /// It eats a bipartite graph, oriented from S to T.
    1.70    /// Such one can be made e.g. by the above wrapper.
    1.71 +  ///
    1.72 +  ///\author Marton Makai
    1.73    template<typename Graph>
    1.74    class stGraphWrapper : public GraphWrapper<Graph> {
    1.75    public: