Changeset 1946:17eb3eaad9f8 in lemon-0.x for lemon/graph_adaptor.h

Timestamp:

02/02/06 18:43:24 (18 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

• workaround for a Doxygen 1.4.6 bug
• other doc fixes

File:

• lemon/graph_adaptor.h (modified) (3 diffs)

lemon/graph_adaptor.h

@@ -189 +189 @@
   /// suppose that a graph instange \c g of type 
   /// \c ListGraph implements \f$G\f$.
-  /// \code
+  ///\code
   /// ListGraph g;
-  /// \endcode
+  ///\endcode
   /// For each directed edge 
   /// \f$e\in A\f$, let \f$\bar e\f$ denote the edge obtained by 
@@ -200 +200 @@
   /// reversing the orientation of its edges. The following code shows how 
   /// such an instance can be constructed.
-  /// \code
+  ///\code
   /// RevGraphAdaptor<ListGraph> gw(g);
-  /// \endcode
+  ///\endcode
   ///\author Marton Makai
+
   template<typename _Graph>
   class RevGraphAdaptor : 
@@ -1279 +1280 @@
   /// For blocking flows.
 
-  ///\warning Graph adaptors are in even more experimental state than the other
+  ///\warning Graph adaptors are in even more
+  ///experimental state than the other
   ///parts of the lib. Use them at you own risk.
   ///
-  /// This graph adaptor is used for on-the-fly 
-  /// 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. 
+  ///This graph adaptor is used for on-the-fly 
+  ///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
+  ///\author Marton Makai
+  ///
   template <typename _Graph, typename FirstOutEdgesMap>
   class ErasingFirstGraphAdaptor :