equal
deleted
inserted
replaced
86 Dijkstra<Graph, CoMap> _dij; |
86 Dijkstra<Graph, CoMap> _dij; |
87 ///\e |
87 ///\e |
88 |
88 |
89 ///\e |
89 ///\e |
90 /// |
90 /// |
91 ConstrainedShortestPath(Graph &g, CM &cost, DM &delay) |
91 ConstrainedShortestPath(Graph &g, CM &ct, DM &dl) |
92 : _g(g), _cost(cost), _delay(delay), |
92 : _g(g), _cost(ct), _delay(dl), |
93 _co_map(cost,delay), _dij(_g,_co_map) {} |
93 _co_map(ct,dl), _dij(_g,_co_map) {} |
94 |
94 |
95 |
95 |
96 ///Compute the cost of a path |
96 ///Compute the cost of a path |
97 double cost(const Path &p) |
97 double cost(const Path &p) |
98 { |
98 { |