Changeset 879:5e284075b193 in lemon-0.x for src/hugo

Timestamp:

09/17/04 17:11:39 (20 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

An alert added to doc.

File:

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

src/hugo/graph_wrapper.h

@@ -81 +81 @@
   ///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 +218 @@
   /// 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 +295 @@
   /// 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 +565 @@
   /// \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 +589 @@
   ///\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 +931 @@
   ///\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 +972 @@
   /// \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 +1035 @@
   /// 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, 
@@ -1089 +1113 @@
   /// 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.