[Boost-commit] svn:boost r81603 - trunk/boost/graph

Subject: [Boost-commit] svn:boost r81603 - trunk/boost/graph
From: jewillco_at_[hidden]
Date: 2012-11-27 17:25:51

Author: jewillco
Date: 2012-11-27 17:25:50 EST (Tue, 27 Nov 2012)
New Revision: 81603
URL: http://svn.boost.org/trac/boost/changeset/81603

Log:
Removed unused code
Text files modified: 
   trunk/boost/graph/astar_search.hpp |   102 ----------------------------------------
   1 files changed, 0 insertions(+), 102 deletions(-)

Modified: trunk/boost/graph/astar_search.hpp
==============================================================================
--- trunk/boost/graph/astar_search.hpp	(original)
+++ trunk/boost/graph/astar_search.hpp	2012-11-27 17:25:50 EST (Tue, 27 Nov 2012)
@@ -229,108 +229,6 @@
 
     };
 
-    template <class AStarHeuristic, class UniformCostVisitor,
-              class UpdatableQueue, class PredecessorMap,
-              class CostMap, class DistanceMap, class WeightMap,
-              class BinaryFunction,
-              class BinaryPredicate>
-    struct astar_tree_bfs_visitor
-    {
-
-      typedef typename property_traits<CostMap>::value_type C;
-      typedef typename property_traits<DistanceMap>::value_type distance_type;
-
-      astar_tree_bfs_visitor(AStarHeuristic h, UniformCostVisitor vis,
-                             UpdatableQueue& Q, PredecessorMap p,
-                             CostMap c, DistanceMap d, WeightMap w,
-                             BinaryFunction combine,
-                             BinaryPredicate compare, C zero)
-        : m_h(h), m_vis(vis), m_Q(Q), m_predecessor(p), m_cost(c),
-          m_distance(d), m_weight(w),
-          m_combine(combine), m_compare(compare), m_zero(zero) {}
-
-
-      template <class Vertex, class Graph>
-      void initialize_vertex(Vertex u, const Graph& g) {
-        m_vis.initialize_vertex(u, g);
-      }
-      template <class Vertex, class Graph>
-      void discover_vertex(Vertex u, const Graph& g) {
-        m_vis.discover_vertex(u, g);
-      }
-      template <class Vertex, class Graph>
-      void examine_vertex(Vertex u, const Graph& g) {
-        m_vis.examine_vertex(u, g);
-      }
-      template <class Vertex, class Graph>
-      void finish_vertex(Vertex u, const Graph& g) {
-        m_vis.finish_vertex(u, g);
-      }
-      template <class Edge, class Graph>
-      void examine_edge(Edge e, const Graph& g) {
-        if (m_compare(get(m_weight, e), m_zero))
-          BOOST_THROW_EXCEPTION(negative_edge());
-        m_vis.examine_edge(e, g);
-      }
-      template <class Edge, class Graph>
-      void non_tree_edge(Edge, const Graph&) {}
-
-
-
-      template <class Edge, class Graph>
-      void tree_edge(Edge e, const Graph& g) {
-        using boost::get;
-        bool m_decreased =
-          relax(e, g, m_weight, m_predecessor, m_distance, m_combine, m_compare);
-
-        if(m_decreased) {
-          m_vis.edge_relaxed(e, g);
-          put(m_cost, target(e, g),
-              m_combine(get(m_distance, target(e, g)),
-                        m_h(target(e, g))));
-        } else
-          m_vis.edge_not_relaxed(e, g);
-      }
-
-
-      template <class Edge, class Graph>
-      void gray_target(Edge e, const Graph& g) {
-        abort(); // Should not get here in tree case
-      }
-
-
-      template <class Edge, class Graph>
-      void black_target(Edge e, const Graph& g) {
-        abort(); // Should not get here in tree case
-      }
-
-
-
-      AStarHeuristic m_h;
-      UniformCostVisitor m_vis;
-      UpdatableQueue& m_Q;
-      PredecessorMap m_predecessor;
-      CostMap m_cost;
-      DistanceMap m_distance;
-      WeightMap m_weight;
-      BinaryFunction m_combine;
-      BinaryPredicate m_compare;
-      C m_zero;
-
-    };
-
-    template <typename UnderlyingQ, typename CostMap>
-    struct astar_search_tree_queue_wrapper: public UnderlyingQ {
-      astar_search_tree_queue_wrapper(const UnderlyingQ& uq, CostMap cost): UnderlyingQ(uq), m_cost(cost) {}
-
-      typedef typename boost::property_traits<CostMap>::key_type key_type;
-      void push(const key_type& k) {UnderlyingQ::push(std::make_pair(k, get(m_cost, k)));}
-      key_type top() const {return UnderlyingQ::top().first;}
-
-      private:
-      CostMap m_cost;
-    };
-
   } // namespace detail