boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-01-19 04:12:11 +00:00
Code Issues Projects Releases Wiki Activity

fix reverse graph example example broken link; fix rcsp functions parameters

Browse Source
This commit is contained in:
andrea-cassioli-maersk
2024-01-26 11:41:05 +01:00
parent a7c3845f28
commit 72cad02a0b
2 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
doc/r_c_shortest_paths.html
View File

@@ -57,7 +57,7 @@ void r_c_shortest_paths( const Graph& g,
typename graph_traits<Graph>::vertex_descriptor s,
typename graph_traits<Graph>::vertex_descriptor t,
std::vector<typename graph_traits<Graph>::edge_descriptor>& pareto_optimal_solution,
Resource_Container>& pareto_optimal_resource_container,
Resource_Container& pareto_optimal_resource_container,
const Resource_Container& rc,
const Resource_Extension_Function& ref,
const Dominance_Function& dominance,
@@ -93,7 +93,7 @@ void r_c_shortest_paths( const Graph& g,
typename graph_traits<Graph>::vertex_descriptor s,
typename graph_traits<Graph>::vertex_descriptor t,
std::vector<typename graph_traits<Graph>::edge_descriptor>& pareto_optimal_solution,
Resource_Container>& pareto_optimal_resource_container,
Resource_Container& pareto_optimal_resource_container,
const Resource_Container& rc,
const Resource_Extension_Function& ref,
const Dominance_Function& dominance )
@@ -554,7 +554,7 @@ When <tt>b_result_must_be_equal_to_desired_final_resource_levels==true</tt> (<tt
<p>
The file <a href="../example/r_c_shortest_paths_example.cpp">
<rr>example/r_c_shortest_paths_example.cpp</tt></a> provides examples for how SPPRCs can be solved with the <tt>r_c_shortest_paths</tt> functions. There is an example for an SPP without resource constraints and an example for a shortest path problem with time windows.<br>
<tt>example/r_c_shortest_paths_example.cpp</tt></a> provides examples for how SPPRCs can be solved with the <tt>r_c_shortest_paths</tt> functions. There is an example for an SPP without resource constraints and an example for a shortest path problem with time windows.<br>
It is obvious that one would not use the algorithm for SPPs without resource constraints, because there are faster algorithms for this problem, but one would expect a code for the SPP with resource constraints to be able to handle such a case.
</p>

2
doc/reverse_graph.html
View File

@@ -33,7 +33,7 @@ way to obtain a transposed view of a graph.
<H3>Example</H3>
The example from <a
href="../example/reverse-graph-eg.cpp"><tt>examples/reverse-graph-eg.cpp</tt></a>.
href="../example/reverse_graph.cpp"><tt>example/reverse_graph.cpp</tt></a>.
<pre>
int