# HG changeset patch
# User deba
# Date 1191334518 0
# Node ID 0c498f2239a8d2fb4d05cc93657c152cfea15a60
# Parent  88aa7870756a789e69282b1915768fe6a7586171
Doc bug fix

diff -r 88aa7870756a -r 0c498f2239a8 lemon/csp.h
--- a/lemon/csp.h	Tue Oct 02 12:34:43 2007 +0000
+++ b/lemon/csp.h	Tue Oct 02 14:15:18 2007 +0000
@@ -23,8 +23,6 @@
 ///\file
 ///\brief Algorithm for the Resource Constrained Shortest Path problem.
 ///
-///
-///\todo dijkstraZero() solution should be revised.
 
 #include <lemon/list_graph.h>
 #include <lemon/graph_utils.h>
@@ -37,9 +35,9 @@
 namespace lemon {
 
   ///\ingroup approx
-  
-  ///Algorithms for the Resource Constrained Shortest Path Problem
-  
+  ///
+  ///\brief Algorithms for the Resource Constrained Shortest Path Problem
+  ///
   ///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,
@@ -91,9 +89,9 @@
 
   public:
     
-    ///\e
+    /// \brief Constructor
     
-    ///\e
+    ///Constructor
     ///
     ConstrainedShortestPath(const Graph &g, const CM &ct, const DM &dl)
       : _g(g), _cost(ct), _delay(dl),
@@ -123,11 +121,11 @@
     ///a delay constrained least cost path.
     ///\param s source node
     ///\param t target node
+    ///\param delta upper bound on the delta
     ///\retval lo_bo a lower bound on the optimal solution
     ///\return the found path or an empty 
     Path larac(Node s, Node t, double delta, double &lo_bo) 
     {
-      NoCounter cnt("LARAC iterations: ");
       double lambda=0;
       double cp,cq,dp,dq,cr,dr;
       Path p;