# HG changeset patch
# User Peter Kovacs <kpeter@inf.elte.hu>
# Date 1294499508 3600
# Node ID 140c953ad5d154e1efd4683ef134c79e80d64afd
# Parent 4980b05606bdffb4ca3c522a9449dd5b1f5310d4
Minor doc improvements
diff git a/lemon/capacity_scaling.h b/lemon/capacity_scaling.h
a

b


86  86  /// In most cases, this parameter should not be set directly, 
87  87  /// consider to use the named template parameters instead. 
88  88  /// 
89   /// \warning Both number types must be signed and all input data must 
 89  /// \warning Both \c V and \c C must be signed number types. 
 90  /// \warning All input data (capacities, supply values, and costs) must 
90  91  /// be integer. 
91  92  /// \warning This algorithm does not support negative costs for such 
92  93  /// arcs that have infinite upper bound. 
diff git a/lemon/cost_scaling.h b/lemon/cost_scaling.h
a

b


113  113  /// In most cases, this parameter should not be set directly, 
114  114  /// consider to use the named template parameters instead. 
115  115  /// 
116   /// \warning Both number types must be signed and all input data must 
 116  /// \warning Both \c V and \c C must be signed number types. 
 117  /// \warning All input data (capacities, supply values, and costs) must 
117  118  /// be integer. 
118  119  /// \warning This algorithm does not support negative costs for such 
119  120  /// arcs that have infinite upper bound. 
diff git a/lemon/cycle_canceling.h b/lemon/cycle_canceling.h
a

b


65  65  /// \tparam C The number type used for costs and potentials in the 
66  66  /// algorithm. By default, it is the same as \c V. 
67  67  /// 
68   /// \warning Both number types must be signed and all input data must 
 68  /// \warning Both \c V and \c C must be signed number types. 
 69  /// \warning All input data (capacities, supply values, and costs) must 
69  70  /// be integer. 
70  71  /// \warning This algorithm does not support negative costs for such 
71  72  /// arcs that have infinite upper bound. 
diff git a/lemon/kruskal.h b/lemon/kruskal.h
a

b


30  30  ///\ingroup spantree 
31  31  ///\file 
32  32  ///\brief Kruskal's algorithm to compute a minimum cost spanning tree 
33   /// 
34   ///Kruskal's algorithm to compute a minimum cost spanning tree. 
35   /// 
36  33  
37  34  namespace lemon { 
38  35  
diff git a/lemon/network_simplex.h b/lemon/network_simplex.h
a

b


63  63  /// \tparam C The number type used for costs and potentials in the 
64  64  /// algorithm. By default, it is the same as \c V. 
65  65  /// 
66   /// \warning Both number types must be signed and all input data must 
 66  /// \warning Both \c V and \c C must be signed number types. 
 67  /// \warning All input data (capacities, supply values, and costs) must 
67  68  /// be integer. 
68  69  /// 
69  70  /// \note %NetworkSimplex provides five different pivot rule 