Changeset 2486:0c498f2239a8 in lemon-0.x

Timestamp:

10/02/07 16:15:18 (17 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3325

Message:

Doc bug fix

File:

• lemon/csp.h (modified) (4 diffs)

lemon/csp.h

@@ -24 +24 @@
 ///\brief Algorithm for the Resource Constrained Shortest Path problem.
 ///
-///
-///\todo dijkstraZero() solution should be revised.
 
 #include <lemon/list_graph.h>
@@ -38 +36 @@
 
   ///\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
@@ -92 +90 @@
   public:
     
-    ///\e
+    /// \brief Constructor
     
-    ///\e
+    ///Constructor
     ///
     ConstrainedShortestPath(const Graph &g, const CM &ct, const DM &dl)
@@ -124 +122 @@
     ///\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;