From 1fa81ebff20ed2753894fa3cc03453d169b1ef1a Mon Sep 17 00:00:00 2001 From: andreacassioli Date: Sun, 25 Oct 2026 10:34:54 +0100 Subject: [PATCH] add few details about labels --- .../pages/algorithms/shortest_paths/r_c_shortest_paths.adoc | 5 +++++ 1 file changed, 5 insertions(+) diff --git a/doc/modules/ROOT/pages/algorithms/shortest_paths/r_c_shortest_paths.adoc b/doc/modules/ROOT/pages/algorithms/shortest_paths/r_c_shortest_paths.adoc index a5529208a..3faa18e9c 100644 --- a/doc/modules/ROOT/pages/algorithms/shortest_paths/r_c_shortest_paths.adoc +++ b/doc/modules/ROOT/pages/algorithms/shortest_paths/r_c_shortest_paths.adoc @@ -593,6 +593,11 @@ bool b = ref( const Graph& g, | `ref` must return `true` if and only if the extension is feasible, i.e., if `new_cont` fulfills all resource constraints at the target vertex of `ed`. |=== +Before invocation, new_cont is initialized as a copy of old_cont. The function should mutate new_cont to reflect the resources consumed along the edge. + +Return true if the extension is feasible, or false to discard the label (e.g. when a resource limit would be exceeded). The old_cont parameter is provided for reference, in case the update is more naturally expressed relative to the prior state. + + Moreover, a reference to a type modelling the ResourceExtensionFunction concept can be passed as a parameter to `r_c_shortest_paths`, see above. Hence, a type modelling the ResourceExtensionFunction concept is likely to be a function or a http://www.boost.org/sgi/stl/functors.html[function object].