Changeset 2373:134639e6ea45 in lemon-0.x
- Timestamp:
- 02/20/07 13:55:37 (17 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3188
- Location:
- lemon
- Files:
-
- 2 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, -
lemon/elevator.h
r2352 r2373 147 147 148 148 ///Activate item \c i. 149 150 ///Activate item \c i. 151 ///\pre Item \c i shouldn't be active before. 149 152 void activate(Item i) 150 153 { … … 155 158 156 159 ///Deactivate item \c i. 160 161 ///Deactivate item \c i. 162 ///\pre Item \c i must be active before. 157 163 void deactivate(Item i) 158 164 {
Note: See TracChangeset
for help on using the changeset viewer.