capacitated_voronoi.hpp File Reference

#include "paal/data_structures/metric/metric_traits.hpp"
#include "paal/utils/irange.hpp"
#include <boost/graph/adjacency_list.hpp>
#include <boost/range/as_array.hpp>
#include <boost/range/numeric.hpp>
#include <boost/iterator/transform_iterator.hpp>
#include <boost/graph/successive_shortest_path_nonnegative_weights.hpp>
#include <boost/graph/find_flow_cost.hpp>
#include <unordered_map>

Go to the source code of this file.

Classes
class	paal::data_structures::capacitated_voronoi< Metric, GeneratorsCapacieties, VerticesDemands >
	This class is assigning vertices demands to capacitated generators in such a way that the total cost is minimized. The solution is based on the min cost max flow algorithm. More...
class	paal::data_structures::capacitated_voronoi< Metric, GeneratorsCapacieties, VerticesDemands >::Dist
	this class store as a distance: More...

Namespaces
	paal
	global namespace of project.
	paal::data_structures
	Data Structure namespace.

Detailed Description

Author

Piotr Wygocki

Version

1.0

Date

2013-03-20

Definition in file capacitated_voronoi.hpp.