Index: src/hugo/graph_wrapper.h
===================================================================
--- src/hugo/graph_wrapper.h (revision 878)
+++ src/hugo/graph_wrapper.h (revision 879)
@@ -81,4 +81,7 @@
///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...
@@ -215,4 +218,7 @@
/// 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.
@@ -289,4 +295,7 @@
/// 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
@@ -556,4 +565,7 @@
/// \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
@@ -577,4 +589,7 @@
///\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)$,
@@ -916,4 +931,7 @@
///\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
@@ -954,4 +972,7 @@
/// \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
@@ -1014,4 +1035,7 @@
/// 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