Template Function min_cycle_ratio

Function Documentation

template<typename Graph, typename T, typename Fn1, typename Fn2, typename Container>
auto min_cycle_ratio(const Graph &G, T &r0, Fn1 &&get_cost, Fn2 &&get_time, Container &&dist, size_t max_iter = 1000)

minimum cost-to-time cycle ratio problem

This function solves the following network parametric problem: 

max  r
s.t. dist[v] - dist[u] \ge cost(u, v) - r * time(u, v)
     \forall e(u, v) \in G(V, E)

Template Parameters

  • Graph –

  • Fn1 –

  • Fn2 –

  • Container –

Parameters

  • G – [in]

  • r0 – [inout]

  • get_cost – [in]

  • get_time – [in]

  • dist – [inout]

Returns

auto