#include "paal/utils/accumulate_functors.hpp"
#include "paal/utils/functors.hpp"
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/dijkstra_shortest_paths.hpp>
#include <boost/graph/graph_concepts.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/kruskal_min_spanning_tree.hpp>
#include <boost/graph/named_function_params.hpp>
#include <boost/graph/properties.hpp>
#include <boost/graph/two_bit_color_map.hpp>
#include <boost/property_map/property_map.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/range/algorithm/fill.hpp>
#include <boost/range/algorithm/sort.hpp>
#include <boost/range/algorithm/unique.hpp>
#include <boost/range/as_array.hpp>
#include <boost/range/numeric.hpp>
#include <algorithm>
#include <utility>
Go to the source code of this file.
|
enum | edge_base_t { edge_base
} |
| enum for edge base property
|
|
enum | paal::Terminals { NONTERMINAL,
TERMINAL
} |
| enum indicates if given color represents terminal or NONTERMINAL.
|
|
|
| boost::BOOST_INSTALL_PROPERTY (edge, base) |
| macro create edge base property
|
|
template<typename NearestMap , typename LastEdgeMap , typename Tag > |
nearest_recorder< NearestMap,
LastEdgeMap, Tag > | paal::detail::make_nearest_recorder (NearestMap &nearest_map, LastEdgeMap &vpred, Tag) |
|
template<typename Graph , typename OutputIterator , typename EdgeWeightMap , typename ColorMap > |
auto | paal::steiner_tree_greedy (const Graph &g, OutputIterator out, EdgeWeightMap edge_weight, ColorMap color_map) -> typename std::pair< typename boost::property_traits< EdgeWeightMap >::value_type, typename boost::property_traits< EdgeWeightMap >::value_type > |
| non-named version of steiner_tree_greedy More...
|
|
template<typename Graph , typename OutputIterator , typename P , typename T , typename R > |
auto | paal::steiner_tree_greedy (const Graph &g, OutputIterator out, const boost::bgl_named_params< P, T, R > ¶ms) |
| named version of steiner_tree_greedy More...
|
|
template<typename Graph , typename OutputIterator > |
auto | paal::steiner_tree_greedy (const Graph &g, OutputIterator out) |
| version of steiner_tree_greedy with all default parameters More...
|
|
- Author
- Piotr Wygocki, Piotr Smulewicz
- Version
- 1.0
- Date
- 2013-11-27
Definition in file steiner_tree_greedy.hpp.