Changeset 612:0856a9a87eb9 in lemon-0.x for src/hugo

Timestamp:

05/11/04 19:02:32 (21 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@795

Message:

BidirGraph?, UndirGraph? some docs, in group graphs

File:

• src/hugo/graph_wrapper.h (modified) (10 diffs)

src/hugo/graph_wrapper.h

@@ -83 +83 @@
   ///\todo Some more docs... 
   ///
-  ///\author Marton Makai
- 
+  ///\author Marton Makai 
   template<typename Graph>
   class GraphWrapper {
@@ -224 +223 @@
 
   /// A graph wrapper which reverses the orientation of the edges.
+  /// Thus \c Graph have to be a directed graph type.
   ///
   ///\author Marton Makai
@@ -229 +229 @@
   class RevGraphWrapper : public GraphWrapper<Graph> {
   protected:
-    RevGraphWrapper() : GraphWrapper<Graph>(0) { }
+    RevGraphWrapper() : GraphWrapper<Graph>() { }
   public:
     RevGraphWrapper(Graph& _graph) : GraphWrapper<Graph>(_graph) { }  
@@ -297 +297 @@
 
 
-  /// Wrapper for hiding nodes and edges from a graph.
+  /// A graph wrapper for hiding nodes and edges from a graph.
   
   /// This wrapper shows a graph with filtered node-set and 
@@ -312 +312 @@
     EdgeFilterMap* edge_filter_map;
 
-    SubGraphWrapper() : GraphWrapper<Graph>(0), 
+    SubGraphWrapper() : GraphWrapper<Graph>(), 
                         node_filter_map(0), edge_filter_map(0) { }
     void setNodeFilterMap(NodeFilterMap& _node_filter_map) {
@@ -489 +489 @@
 
 
-  /// A wrapper for forgetting the orientation of a graph.
-
+  /// \brief A wrapper for forgetting the orientation of a graph.
+  ///
   /// A wrapper for getting an undirected graph by forgetting
   /// the orientation of a directed one.
   ///
-  ///\author Marton Makai
+  /// \author Marton Makai
   template<typename Graph>
   class UndirGraphWrapper : public GraphWrapper<Graph> {
@@ -574 +574 @@
   };
   
-
-
-  /// An undirected graph template
+  /// \brief An undirected graph template.
+  ///
+  /// An undirected graph template.
+  /// This class works as an undirected graph and a directed graph of 
+  /// class \c Graph is used for the physical storage.
+  /// \ingroup graphs
   template<typename Graph>
   class UndirGraph : public UndirGraphWrapper<Graph> {
@@ -589 +592 @@
 
 
+  ///\brief A wrapper for composing bidirected graph from a directed one. 
+  /// experimental, for fezso's sake.
+  ///
   /// A wrapper for composing bidirected graph from a directed one. 
   /// experimental, for fezso's sake.
-
-  /// A wrapper for composing bidirected graph from a directed one. 
-  /// experimental, for fezso's sake.
+  /// A bidirected graph is composed over the directed one without physical 
+  /// storage. As the oppositely directed edges are logically different ones 
+  /// the maps are able to attach different values for them.
   template<typename Graph>
   class BidirGraphWrapper : public GraphWrapper<Graph> {
@@ -911 +917 @@
   };
 
+  /// \brief A bidirected graph template.
+  ///
+  /// A bidirected graph template.
+  /// Such a bidirected graph stores each pair of oppositely directed edges 
+  /// ones in the memory, i.e. a directed graph of type 
+  /// \c Graph is used for that.
+  /// As the oppositely directed edges are logically different ones 
+  /// the maps are able to attach different values for them.
+  /// \ingroup graphs
+  template<typename Graph>
+  class BidirGraph : public BidirGraphWrapper<Graph> {
+    typedef UndirGraphWrapper<Graph> Parent;
+  protected:
+    Graph gr;
+  public:
+    BidirGraph() : BidirGraphWrapper<Graph>() { 
+      Parent::setGraph(gr); 
+    }
+  };
 
 
@@ -1227 +1252 @@
 
 
-  /// ErasingFirstGraphWrapper for blocking flows.
-
-  /// ErasingFirstGraphWrapper for blocking flows.
+  /// For blocking flows.
+
+  /// This graph wrapper is used for Dinits blocking flow computations.
+  /// For each node, an out-edge is stored which is used when the 
+  /// \code 
+  /// OutEdgeIt& first(OutEdgeIt&, const Node&)
+  /// \endcode
+  /// is called. 
   ///
   ///\author Marton Makai