File: prim_minimum_spanning_tree.hpp

package info (click to toggle)
boost1.62 1.62.0+dfsg-4
 `12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091` ``````//======================================================================= // Copyright 1997, 1998, 1999, 2000 University of Notre Dame. // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) //======================================================================= // #ifndef BOOST_GRAPH_MST_PRIM_HPP #define BOOST_GRAPH_MST_PRIM_HPP #include #include #include namespace boost { namespace detail { // this should be somewhere else in boost... template struct _project2nd { V operator()(U, V v) const { return v; } }; } namespace detail { // This is Prim's algorithm to calculate the Minimum Spanning Tree // for an undirected graph with weighted edges. template inline void prim_mst_impl(const Graph& G, typename graph_traits::vertex_descriptor s, const bgl_named_params& params, Weight) { typedef typename property_traits::value_type W; std::less compare; detail::_project2nd combine; dijkstra_shortest_paths(G, s, params.distance_compare(compare). distance_combine(combine)); } } // namespace detail template inline void prim_minimum_spanning_tree (const VertexListGraph& g, typename graph_traits::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, DijkstraVisitor vis) { typedef typename property_traits::value_type W; std::less compare; detail::_project2nd combine; dijkstra_shortest_paths(g, s, predecessor, distance, weight, index_map, compare, combine, (std::numeric_limits::max)(), 0, vis); } template inline void prim_minimum_spanning_tree (const VertexListGraph& g, PredecessorMap p_map, const bgl_named_params& params) { detail::prim_mst_impl (g, choose_param(get_param(params, root_vertex_t()), *vertices(g).first), params.predecessor_map(p_map), choose_const_pmap(get_param(params, edge_weight), g, edge_weight)); } template inline void prim_minimum_spanning_tree (const VertexListGraph& g, PredecessorMap p_map) { detail::prim_mst_impl (g, *vertices(g).first, predecessor_map(p_map). weight_map(get(edge_weight, g)), get(edge_weight, g)); } } // namespace boost #endif // BOOST_GRAPH_MST_PRIM_HPP ``````