# HG changeset patch
# User klao
# Date 1138976565 0
# Node ID 6150d1cf0825cea89fe763efb1abf127e5ed9244
# Parent  cb7a6e0573bc1bc03313a1bfb278884eea022806
graph_adaptor.h: spacing corrections in doc

diff -r cb7a6e0573bc -r 6150d1cf0825 lemon/graph_adaptor.h
--- a/lemon/graph_adaptor.h	Fri Feb 03 14:07:52 2006 +0000
+++ b/lemon/graph_adaptor.h	Fri Feb 03 14:22:45 2006 +0000
@@ -439,15 +439,15 @@
   /// SubGraphAdaptor shows the graph with filtered node-set and 
   /// edge-set. If the \c checked parameter is true then it filters the edgeset
   /// to do not get invalid edges without source or target.
-  /// Let  \f$  G=(V, A)  \f$  be a directed graph
+  /// Let \f$ G=(V, A) \f$ be a directed graph
   /// and suppose that the graph instance \c g of type ListGraph
-  /// implements  \f$  G  \f$ .
-  /// Let moreover  \f$  b_V  \f$  and  \f$  b_A  \f$  be bool-valued functions resp.
+  /// implements \f$ G \f$.
+  /// Let moreover \f$ b_V \f$ and \f$ b_A \f$ be bool-valued functions resp.
   /// on the node-set and edge-set.
   /// SubGraphAdaptor<...>::NodeIt iterates 
-  /// on the node-set  \f$ \{v\in V : b_V(v)=true\} \f$  and 
+  /// on the node-set \f$ \{v\in V : b_V(v)=true\} \f$ and 
   /// SubGraphAdaptor<...>::EdgeIt iterates 
-  /// on the edge-set  \f$ \{e\in A : b_A(e)=true\} \f$ . Similarly, 
+  /// on the edge-set \f$ \{e\in A : b_A(e)=true\} \f$. Similarly, 
   /// SubGraphAdaptor<...>::OutEdgeIt and
   /// SubGraphAdaptor<...>::InEdgeIt iterates 
   /// only on edges leaving and entering a specific node which have true value.
@@ -1049,14 +1049,14 @@
   ///than the other
   ///parts of the lib. Use them at you own risk.
   ///
-  /// Let  \f$  G=(V, A)  \f$  be a directed graph and for each directed edge 
-  ///  \f$  e\in A  \f$ , let  \f$  \bar e  \f$  denote the edge obtained by
+  /// Let \f$ G=(V, A) \f$ be a directed graph and for each directed edge 
+  ///\f$ e\in A \f$, let \f$ \bar e \f$ denote the edge obtained by
   /// reversing its orientation. We are given moreover two bool valued 
   /// maps on the edge-set, 
-  ///  \f$  forward\_filter  \f$ , and  \f$  backward\_filter  \f$ . 
+  ///\f$ forward\_filter \f$, and \f$ backward\_filter \f$. 
   /// SubBidirGraphAdaptor implements the graph structure with node-set 
-  ///  \f$  V  \f$  and edge-set 
-  ///  \f$  \{e : e\in A \mbox{ and } forward\_filter(e) \mbox{ is true}\}+\{\bar e : e\in A \mbox{ and } backward\_filter(e) \mbox{ is true}\}  \f$ . 
+  ///\f$ V \f$ and edge-set 
+  ///\f$ \{e : e\in A \mbox{ and } forward\_filter(e) \mbox{ is true}\}+\{\bar e : e\in A \mbox{ and } backward\_filter(e) \mbox{ is true}\} \f$. 
   /// The purpose of writing + instead of union is because parallel 
   /// edges can arise. (Similarly, antiparallel edges also can arise).
   /// In other words, a subgraph of the bidirected graph obtained, which 
@@ -1185,24 +1185,24 @@
   ///
   ///An adaptor for composing the residual graph for
   ///directed flow and circulation problems. 
-  ///Let  \f$ G=(V, A) \f$  be a directed graph and let  \f$ F \f$  be a 
+  ///Let \f$ G=(V, A) \f$ be a directed graph and let \f$ F \f$ be a 
   ///number type. Let moreover 
-  /// \f$ f,c:A\to F \f$ , be functions on the edge-set. 
-  ///In the appications of ResGraphAdaptor,  \f$ f \f$  usually stands for a flow 
-  ///and  \f$ c \f$  for a capacity function.   
+  ///\f$ f,c:A\to F \f$, be functions on the edge-set. 
+  ///In the appications of ResGraphAdaptor, \f$ f \f$ usually stands for a flow 
+  ///and \f$ c \f$ for a capacity function.   
   ///Suppose that a graph instange \c g of type 
-  ///\c ListGraph implements  \f$ G \f$  .
+  ///\c ListGraph implements \f$ G \f$.
   ///\code
   ///  ListGraph g;
   ///\endcode
   ///Then RevGraphAdaptor implements the graph structure with node-set 
-  /// \f$ V \f$  and edge-set  \f$ A_{forward}\cup A_{backward} \f$ , where 
-  /// \f$ A_{forward}=\{uv : uv\in A, f(uv)<c(uv)\} \f$  and 
-  /// \f$ A_{backward}=\{vu : uv\in A, f(uv)>0\} \f$ , 
+  ///\f$ V \f$ and edge-set \f$ A_{forward}\cup A_{backward} \f$, where 
+  ///\f$ A_{forward}=\{uv : uv\in A, f(uv)<c(uv)\} \f$ and 
+  ///\f$ A_{backward}=\{vu : uv\in A, f(uv)>0\} \f$, 
   ///i.e. the so called residual graph. 
-  ///When we take the union  \f$ A_{forward}\cup A_{backward} \f$ , 
+  ///When we take the union \f$ A_{forward}\cup A_{backward} \f$, 
   ///multilicities are counted, i.e. if an edge is in both 
-  /// \f$ A_{forward} \f$  and  \f$ A_{backward} \f$ , then in the adaptor it 
+  ///\f$ A_{forward} \f$ and \f$ A_{backward} \f$, then in the adaptor it 
   ///appears twice. 
   ///The following code shows how 
   ///such an instance can be constructed.