# HG changeset patch
# User alpar
# Date 1171976137 0
# Node ID 134639e6ea45d5eab7c69bf926b35d8c877db8f2
# Parent  7fcc0179fb2173773d9707b63ee1793946fbc730
Doc improvements

diff -r 7fcc0179fb21 -r 134639e6ea45 lemon/csp.h
--- a/lemon/csp.h	Mon Feb 19 19:55:13 2007 +0000
+++ b/lemon/csp.h	Tue Feb 20 12:55:37 2007 +0000
@@ -38,7 +38,13 @@
   
   ///Algorithms for the Resource Constrained Shortest Path Problem
   
-  ///\e
+  ///The Resource Constrained Shortest (Least Cost) Path problem is the
+  ///following. We are given a directed graph with two additive weightings
+  ///on the edges, referred as \e cost and \e delay. In addition,
+  ///a source and a destination node \e s and \e t and a delay
+  ///constraint \e D is given. A path \e p is called \e feasible
+  ///if <em>delay(p)\<=D</em>. Then, the task is to find the least cost
+  ///feasible path.
   ///
   template<class Graph,
 	   class CM=typename Graph:: template EdgeMap<double>,
diff -r 7fcc0179fb21 -r 134639e6ea45 lemon/elevator.h
--- a/lemon/elevator.h	Mon Feb 19 19:55:13 2007 +0000
+++ b/lemon/elevator.h	Tue Feb 20 12:55:37 2007 +0000
@@ -146,6 +146,9 @@
     }
   
     ///Activate item \c i.
+
+    ///Activate item \c i.
+    ///\pre Item \c i shouldn't be active before.
     void activate(Item i)
     {
       const int l=_level[i];
@@ -154,6 +157,9 @@
     }
   
     ///Deactivate item \c i.
+
+    ///Deactivate item \c i.
+    ///\pre Item \c i must be active before.
     void deactivate(Item i)  
     {
       swap(_where[i],_last_active[_level[i]]--);