# HG changeset patch
# User Peter Kovacs <kpeter@inf.elte.hu>
# Date 1294499508 -3600
# Node ID 140c953ad5d154e1efd4683ef134c79e80d64afd
# Parent  4980b05606bdffb4ca3c522a9449dd5b1f5310d4
Minor doc improvements

diff -r 4980b05606bd -r 140c953ad5d1 lemon/capacity_scaling.h
--- a/lemon/capacity_scaling.h	Tue Nov 16 07:46:01 2010 +0100
+++ b/lemon/capacity_scaling.h	Sat Jan 08 16:11:48 2011 +0100
@@ -86,7 +86,8 @@
   /// In most cases, this parameter should not be set directly,
   /// consider to use the named template parameters instead.
   ///
-  /// \warning Both number types must be signed and all input data must
+  /// \warning Both \c V and \c C must be signed number types.
+  /// \warning All input data (capacities, supply values, and costs) must
   /// be integer.
   /// \warning This algorithm does not support negative costs for such
   /// arcs that have infinite upper bound.
diff -r 4980b05606bd -r 140c953ad5d1 lemon/cost_scaling.h
--- a/lemon/cost_scaling.h	Tue Nov 16 07:46:01 2010 +0100
+++ b/lemon/cost_scaling.h	Sat Jan 08 16:11:48 2011 +0100
@@ -113,7 +113,8 @@
   /// In most cases, this parameter should not be set directly,
   /// consider to use the named template parameters instead.
   ///
-  /// \warning Both number types must be signed and all input data must
+  /// \warning Both \c V and \c C must be signed number types.
+  /// \warning All input data (capacities, supply values, and costs) must
   /// be integer.
   /// \warning This algorithm does not support negative costs for such
   /// arcs that have infinite upper bound.
diff -r 4980b05606bd -r 140c953ad5d1 lemon/cycle_canceling.h
--- a/lemon/cycle_canceling.h	Tue Nov 16 07:46:01 2010 +0100
+++ b/lemon/cycle_canceling.h	Sat Jan 08 16:11:48 2011 +0100
@@ -65,7 +65,8 @@
   /// \tparam C The number type used for costs and potentials in the
   /// algorithm. By default, it is the same as \c V.
   ///
-  /// \warning Both number types must be signed and all input data must
+  /// \warning Both \c V and \c C must be signed number types.
+  /// \warning All input data (capacities, supply values, and costs) must
   /// be integer.
   /// \warning This algorithm does not support negative costs for such
   /// arcs that have infinite upper bound.
diff -r 4980b05606bd -r 140c953ad5d1 lemon/kruskal.h
--- a/lemon/kruskal.h	Tue Nov 16 07:46:01 2010 +0100
+++ b/lemon/kruskal.h	Sat Jan 08 16:11:48 2011 +0100
@@ -30,9 +30,6 @@
 ///\ingroup spantree
 ///\file
 ///\brief Kruskal's algorithm to compute a minimum cost spanning tree
-///
-///Kruskal's algorithm to compute a minimum cost spanning tree.
-///
 
 namespace lemon {
 
diff -r 4980b05606bd -r 140c953ad5d1 lemon/network_simplex.h
--- a/lemon/network_simplex.h	Tue Nov 16 07:46:01 2010 +0100
+++ b/lemon/network_simplex.h	Sat Jan 08 16:11:48 2011 +0100
@@ -63,7 +63,8 @@
   /// \tparam C The number type used for costs and potentials in the
   /// algorithm. By default, it is the same as \c V.
   ///
-  /// \warning Both number types must be signed and all input data must
+  /// \warning Both \c V and \c C must be signed number types.
+  /// \warning All input data (capacities, supply values, and costs) must
   /// be integer.
   ///
   /// \note %NetworkSimplex provides five different pivot rule