Imported Upstream version 1.57.0

[platform/upstream/boost.git] / boost / graph / adjacency_list.hpp

diff --git a/boost/graph/adjacency_list.hpp b/boost/graph/adjacency_list.hpp
index 21b7500..d7fbc06 100644 (file)
--- a/boost/graph/adjacency_list.hpp
+++ b/boost/graph/adjacency_list.hpp
@@ -188,6 +188,7 @@ namespace boost {
 
   } // namespace detail
 
+  template <typename Selector> struct is_distributed_selector: mpl::false_ {};
 
 
   //===========================================================================
@@ -328,7 +329,6 @@ namespace boost {
       : Base(num_vertices), m_property(new graph_property_type(p))
     { }
 
-#if !defined(BOOST_MSVC) || BOOST_MSVC >= 1300
     // Required by Iterator Constructible Graph
     template <class EdgeIterator>
     adjacency_list(EdgeIterator first, EdgeIterator last,
@@ -346,7 +346,6 @@ namespace boost {
                           const GraphProperty& p = GraphProperty())
       : Base(n, first, last, ep_iter), m_property(new graph_property_type(p))
     { }
-#endif
 
     void swap(adjacency_list& x) {
       // Is there a more efficient way to do this?