Ticket #12555: boost-graph.patch

boost/graph/adjacency_matrix.hpp

@@ -443 +443 @@
     // graph type. Instead, use directedS, which also provides the
     // functionality required for a Bidirectional Graph (in_edges,
     // in_degree, etc.).
-    BOOST_STATIC_ASSERT(type_traits::ice_not<(is_same<Directed, bidirectionalS>::value)>::value);
+    BOOST_STATIC_ASSERT(!is_same<Directed, bidirectionalS>::value);
 
     typedef typename mpl::if_<is_directed,
                                     bidirectional_tag, undirected_tag>::type

boost/graph/bandwidth.hpp

@@ -10 +10 @@
 #include <algorithm> // for std::min and std::max
 #include <boost/config.hpp>
 #include <boost/graph/graph_traits.hpp>
+#include <boost/graph/properties.hpp>
 #include <boost/detail/numeric_traits.hpp>
 
 namespace boost {

boost/graph/chrobak_payne_drawing.hpp

@@ -14 +14 @@
 #include <stack>
 #include <boost/config.hpp>
 #include <boost/graph/graph_traits.hpp>
+#include <boost/graph/properties.hpp>
 #include <boost/property_map/property_map.hpp>
 
 

boost/graph/circle_layout.hpp

@@ -14 +14 @@
 #include <boost/graph/graph_traits.hpp>
 #include <boost/graph/iteration_macros.hpp>
 #include <boost/graph/topology.hpp>
+#include <boost/property_map/property_map.hpp>
 #include <boost/static_assert.hpp>
 
 namespace boost {

boost/graph/detail/edge.hpp

@@ -13 +13 @@
 
 #include <iosfwd>
 
+#include <boost/functional/hash.hpp>
+
 namespace boost {
 
   namespace  detail {

boost/graph/detail/index.hpp

@@ -8 +8 @@
 #define BOOST_GRAPH_DETAIL_INDEX_HPP
 
 #include <boost/graph/graph_traits.hpp>
+#include <boost/graph/properties.hpp>
 
 // The structures in this module are responsible for selecting and defining
 // types for accessing a builting index map. Note that the selection of these

boost/graph/dimacs.hpp

@@ -18 +18 @@
 #include <vector>
 #include <queue>
 #include <boost/assert.hpp>
+#include <boost/throw_exception.hpp>
 
 namespace boost { namespace graph {
 

boost/graph/edge_connectivity.hpp

@@ -16 +16 @@
 #include <vector>
 #include <set>
 #include <algorithm>
+#include <boost/graph/adjacency_list.hpp>
 #include <boost/graph/edmonds_karp_max_flow.hpp>
 
 namespace boost {

boost/graph/graph_mutability_traits.hpp

@@ -11 +11 @@
 #include <boost/mpl/if.hpp>
 #include <boost/mpl/and.hpp>
 #include <boost/mpl/bool.hpp>
+#include <boost/type_traits/is_convertible.hpp>
 #include <boost/type_traits/is_same.hpp>
 
 namespace boost {

boost/graph/graph_stats.hpp

@@ -11 +11 @@
 
 #include <map>
 #include <list>
+#include <boost/graph/graph_traits.hpp>
 #include <boost/graph/iteration_macros.hpp>
+#include <boost/graph/properties.hpp>
+#include <boost/tuple/tuple.hpp>
 #include <boost/assert.hpp>
 
 namespace boost { namespace graph {

boost/graph/howard_cycle_ratio.hpp

@@ -579 +579 @@
     typedef typename remove_const<
         typename property_traits<EdgeWeightMap>::value_type
     >::type Weight;
-    typename std::vector<Weight> ed_w2(boost::num_edges(g), 1);
+    typename std::vector<Weight> ed_w2(num_edges(g), 1);
     return maximum_cycle_ratio(g, vim, ewm,
                                make_iterator_property_map(ed_w2.begin(), eim),
                                pcc, ft);
@@ -613 +613 @@
     typedef typename remove_const<
         typename property_traits<EdgeWeightMap>::value_type
     >::type Weight;
-    typename std::vector<Weight> ed_w2(boost::num_edges(g), 1);
+    typename std::vector<Weight> ed_w2(num_edges(g), 1);
     return minimum_cycle_ratio(g, vim, ewm,
                                make_iterator_property_map(ed_w2.begin(), eim),
                                pcc, ft);

boost/graph/labeled_graph.hpp

@@ -18 +18 @@
 #include <boost/type_traits/is_same.hpp>
 #include <boost/type_traits/is_unsigned.hpp>
 #include <boost/pending/container_traits.hpp>
+#include <boost/graph/adjacency_list.hpp>
 #include <boost/graph/graph_traits.hpp>
+#include <boost/property_map/property_map.hpp>
 
 // This file implements a utility for creating mappings from arbitrary
 // identifiers to the vertices of a graph.

boost/graph/metis.hpp

@@ -24 +24 @@
 #include <vector>
 #include <algorithm>
 
+#include <boost/throw_exception.hpp>
+
 namespace boost { namespace graph {
 
 class metis_exception : public std::exception {};

boost/graph/planar_canonical_ordering.hpp

@@ -14 +14 @@
 #include <boost/config.hpp>
 #include <boost/next_prior.hpp>
 #include <boost/graph/graph_traits.hpp>
+#include <boost/graph/properties.hpp>
 #include <boost/property_map/property_map.hpp>
 
 

boost/graph/point_traits.hpp

@@ -9 +9 @@
 #ifndef BOOST_GRAPH_POINT_TRAITS_HPP
 #define BOOST_GRAPH_POINT_TRAITS_HPP
 
+#include <cstddef>
+
 namespace boost { namespace graph {
 
 template<typename Point>

boost/graph/r_c_shortest_paths.hpp

@@ -8 +8 @@
 #ifndef BOOST_GRAPH_R_C_SHORTEST_PATHS_HPP
 #define BOOST_GRAPH_R_C_SHORTEST_PATHS_HPP
 
+#include <list>
 #include <map>
 #include <queue>
 #include <vector>

boost/graph/small_world_generator.hpp

@@ -11 +11 @@
 
 #include <iterator>
 #include <utility>
+#include <boost/graph/graph_traits.hpp>
 #include <boost/random/uniform_01.hpp>
 #include <boost/random/uniform_int.hpp>
 

boost/graph/ssca_graph_generator.hpp

@@ -15 +15 @@
 #include <queue>
 #include <boost/config.hpp>
 #include <boost/random/uniform_int.hpp>
+#include <boost/random/uniform_01.hpp>
 #include <boost/graph/graph_traits.hpp>
 #include <boost/type_traits/is_base_and_derived.hpp>
 #include <boost/type_traits/is_same.hpp>

boost/graph/tree_traits.hpp

@@ -6 +6 @@
 #ifndef BOOST_TREE_STRUCTURE_HPP
 #define BOOST_TREE_STRUCTURE_HPP
 
+#include <boost/tuple/tuple.hpp>
+
 namespace boost {
 
   template <class T>

boost/graph/write_dimacs.hpp

@@ -41 +41 @@
 #include <string>
 #include <ostream>
 
+#include <boost/graph/graph_traits.hpp>
+#include <boost/tuple/tuple.hpp>
+
 namespace boost {
 
 template <class Graph, class CapacityMap, class IndexMap>