diff -r 86b42ec55f3e -r 5e284075b193 src/hugo/graph_wrapper.h
--- a/src/hugo/graph_wrapper.h	Fri Sep 17 12:23:09 2004 +0000
+++ b/src/hugo/graph_wrapper.h	Fri Sep 17 15:11:39 2004 +0000
@@ -80,6 +80,9 @@
 
   ///Base type for the Graph Wrappers
 
+  ///\warning Graph wrappers are in even more experimental state than the other
+  ///parts of the lib. Use them at you own risk.
+  ///
   ///This is the base type for the Graph Wrappers.
   ///\todo Some more docs... 
   ///
@@ -214,6 +217,9 @@
 
   /// A graph wrapper which reverses the orientation of the edges.
 
+  ///\warning Graph wrappers are in even more experimental state than the other
+  ///parts of the lib. Use them at you own risk.
+  ///
   /// A graph wrapper which reverses the orientation of the edges.
   /// Thus \c Graph have to be a directed graph type.
   ///
@@ -288,6 +294,9 @@
 
   /// A graph wrapper for hiding nodes and edges from a graph.
   
+  ///\warning Graph wrappers are in even more experimental state than the other
+  ///parts of the lib. Use them at you own risk.
+  ///
   /// This wrapper shows a graph with filtered node-set and 
   /// edge-set. Given a bool-valued map on the node-set and one on 
   /// the edge-set of the graphs, the iterators shows only the objects 
@@ -555,6 +564,9 @@
   
   /// \brief An undirected graph template.
   ///
+  ///\warning Graph wrappers are in even more experimental state than the other
+  ///parts of the lib. Use them at you own risk.
+  ///
   /// 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.
@@ -577,6 +589,9 @@
   ///\brief A wrapper for composing a subgraph of a 
   /// bidirected graph made from a directed one. 
   ///
+  ///\warning Graph wrappers are in even more experimental state than the other
+  ///parts of the lib. Use them at you own risk.
+  ///
   /// Suppose that for a directed graph $G=(V, A)$, 
   /// two predicates on the edge-set, $forward_filter$, and $backward_filter$ 
   /// is given, and we are dealing with the directed graph
@@ -915,6 +930,9 @@
 
   ///\brief A wrapper for composing bidirected graph from a directed one. 
   ///
+  ///\warning Graph wrappers are in even more experimental state than the other
+  ///parts of the lib. Use them at you own risk.
+  ///
   /// A wrapper for composing bidirected graph from a directed one. 
   /// A bidirected graph is composed over the directed one without physical 
   /// storage. As the oppositely directed edges are logically different ones 
@@ -953,6 +971,9 @@
 
   /// \brief A bidirected graph template.
   ///
+  ///\warning Graph wrappers are in even more experimental state than the other
+  ///parts of the lib. Use them at you own risk.
+  ///
   /// 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 
@@ -1013,6 +1034,9 @@
   
   /// A wrapper for composing the residual graph for directed flow and circulation problems.
 
+  ///\warning Graph wrappers are in even more experimental state than the other
+  ///parts of the lib. Use them at you own risk.
+  ///
   /// A wrapper for composing the residual graph for directed flow and circulation problems.
   template<typename Graph, typename Number, 
 	   typename CapacityMap, typename FlowMap>
@@ -1088,6 +1112,9 @@
 
   /// For blocking flows.
 
+  ///\warning Graph wrappers are in even more experimental state than the other
+  ///parts of the lib. Use them at you own risk.
+  ///
   /// This graph wrapper is used for on-the-fly 
   /// Dinits blocking flow computations.
   /// For each node, an out-edge is stored which is used when the