Changeset 2373:134639e6ea45 in lemon0.x for lemon/csp.h
 Timestamp:
 02/20/07 13:55:37 (13 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3188
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/csp.h
r2360 r2373 39 39 ///Algorithms for the Resource Constrained Shortest Path Problem 40 40 41 ///\e 41 ///The Resource Constrained Shortest (Least Cost) Path problem is the 42 ///following. We are given a directed graph with two additive weightings 43 ///on the edges, referred as \e cost and \e delay. In addition, 44 ///a source and a destination node \e s and \e t and a delay 45 ///constraint \e D is given. A path \e p is called \e feasible 46 ///if <em>delay(p)\<=D</em>. Then, the task is to find the least cost 47 ///feasible path. 42 48 /// 43 49 template<class Graph,
Note: See TracChangeset
for help on using the changeset viewer.