Package: libboost-graph1.42.0
Version: 1.42.0-4
Severity: normal
Tags: upstream patch
Please apply this patch to debian package which is also forwarded upstream
https://svn.boost.org/trac/boost/ticket/4631
-- System Information:
Debian Release: squeeze/sid
APT prefers unstable
APT policy: (500, 'unstable'), (1, 'experimental')
Architecture: amd64 (x86_64)
Kernel: Linux 2.6.32-5-amd64 (SMP w/6 CPU cores)
Locale: LANG=en_US.UTF-8, LC_CTYPE=en_US.UTF-8 (charmap=UTF-8)
Shell: /bin/sh linked to /bin/dash
Versions of packages libboost-graph1.42.0 depends on:
ii libboost-regex1.42.0 1.42.0-4 regular expression library for C++
ii libc6 2.11.2-4 Embedded GNU C Library: Shared lib
ii libgcc1 1:4.4.4-11 GCC support library
ii libstdc++6 4.4.4-11 The GNU Standard C++ Library v3
libboost-graph1.42.0 recommends no packages.
Versions of packages libboost-graph1.42.0 suggests:
ii graphviz 2.26.3-5 rich set of graph drawing tools
-- no debconf information
Fix crash in r_c_shortest_paths when no paths were found and only one were asked for.
Author: Esben Mose Hansen <es...@ange.dk>
--- boost1.42-1.42.0.orig/boost/graph/r_c_shortest_paths.hpp
+++ boost1.42-1.42.0/boost/graph/r_c_shortest_paths.hpp
@@ -559,8 +559,10 @@ void r_c_shortest_paths
dominance,
la,
vis );
- pareto_optimal_solution = pareto_optimal_solutions[0];
- pareto_optimal_resource_container = pareto_optimal_resource_containers[0];
+ if (!pareto_optimal_solutions.empty()) {
+ pareto_optimal_solution = pareto_optimal_solutions[0];
+ pareto_optimal_resource_container = pareto_optimal_resource_containers[0];
+ }
}
// third overload:
@@ -644,8 +646,10 @@ void r_c_shortest_paths
dominance,
default_r_c_shortest_paths_allocator(),
default_r_c_shortest_paths_visitor() );
- pareto_optimal_solution = pareto_optimal_solutions[0];
- pareto_optimal_resource_container = pareto_optimal_resource_containers[0];
+ if (!pareto_optimal_solutions.empty()) {
+ pareto_optimal_solution = pareto_optimal_solutions[0];
+ pareto_optimal_resource_container = pareto_optimal_resource_containers[0];
+ }
}
// r_c_shortest_paths
