min_cycle_ratio.hpp file
Classes
-
template<typename DiGraph, typename Ratio>class CycleRatioAPI
- CycleRatioAPI.
-
template<typename DiGraph, typename Ratio>class MinCycleRatioSolver
- Minimum Cycle Ratio Solver.
Functions
-
template<typename DiGraph, typename Ratio, typename Fn1, typename Fn2, typename Mapping, typename Domain>auto min_cycle_ratio(const DiGraph& gra, Ratio& r0, Fn1&& get_cost, Fn2&& get_time, Mapping& dist, Domain dummy) -> auto
- minimum cost-to-time cycle ratio problem
Function documentation
template<typename DiGraph, typename Ratio, typename Fn1, typename Fn2, typename Mapping, typename Domain>
auto min_cycle_ratio(const DiGraph& gra,
Ratio& r0,
Fn1&& get_cost,
Fn2&& get_time,
Mapping& dist,
Domain dummy)
minimum cost-to-time cycle ratio problem
| Template parameters | |
|---|---|
| DiGraph | |
| Ratio | |
| Fn1 | |
| Fn2 | |
| Mapping | |
| Domain | |
| Parameters | |
| gra in | |
| r0 in/out | |
| get_cost in | |
| get_time in | |
| dist in/out | |
| dummy | |
| Returns | auto |
This function solves the following network parametric problem:
max r
s.t. dist[vtx] - dist[utx] \ge cost(utx, vtx) - r * time(utx, vtx)
\forall edge(utx, vtx) \in gra(V, E)