equal
deleted
inserted
replaced
36 #include <lemon/counter.h> |
36 #include <lemon/counter.h> |
37 namespace lemon { |
37 namespace lemon { |
38 |
38 |
39 ///Algorithms for the Resource Constrained Shortest Path Problem |
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 template<class Graph, |
49 template<class Graph, |
44 class CM=typename Graph:: template EdgeMap<double>, |
50 class CM=typename Graph:: template EdgeMap<double>, |
45 class DM=CM> |
51 class DM=CM> |
46 class ConstrainedShortestPath |
52 class ConstrainedShortestPath |