COIN-OR::LEMON - Graph Library

Changeset 2486:0c498f2239a8 in lemon-0.x for lemon


Ignore:
Timestamp:
10/02/07 16:15:18 (12 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3325
Message:

Doc bug fix

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/csp.h

    r2401 r2486  
    2424///\brief Algorithm for the Resource Constrained Shortest Path problem.
    2525///
    26 ///
    27 ///\todo dijkstraZero() solution should be revised.
    2826
    2927#include <lemon/list_graph.h>
     
    3836
    3937  ///\ingroup approx
    40  
    41   ///Algorithms for the Resource Constrained Shortest Path Problem
    42  
     38  ///
     39  ///\brief Algorithms for the Resource Constrained Shortest Path Problem
     40  ///
    4341  ///The Resource Constrained Shortest (Least Cost) Path problem is the
    4442  ///following. We are given a directed graph with two additive weightings
     
    9290  public:
    9391   
    94     ///\e
     92    /// \brief Constructor
    9593   
    96     ///\e
     94    ///Constructor
    9795    ///
    9896    ConstrainedShortestPath(const Graph &g, const CM &ct, const DM &dl)
     
    124122    ///\param s source node
    125123    ///\param t target node
     124    ///\param delta upper bound on the delta
    126125    ///\retval lo_bo a lower bound on the optimal solution
    127126    ///\return the found path or an empty
    128127    Path larac(Node s, Node t, double delta, double &lo_bo)
    129128    {
    130       NoCounter cnt("LARAC iterations: ");
    131129      double lambda=0;
    132130      double cp,cq,dp,dq,cr,dr;
Note: See TracChangeset for help on using the changeset viewer.