#include <iostream>
#include <numeric>
#include <utility>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdexcept>
#include <iomanip>
#include <cassert>
#include <cmath>
#include <list>
#include <limits>
Go to the source code of this file.
Classes | |
class | TransportSolver::List2D< T > |
struct | TransportSolver::List2D< T >::listElement |
class | TransportSolver::List2D< T >::iterator_template< Parent, typeT > |
struct | TransportSolver::List2D< T >::bufferElement |
class | TransportSolver::coordLess< E > |
class | TransportSolver::coordMore< E > |
class | TransportSolver::MatrixWrapper< T > |
class | TransportSolver::TransportationSolver< OPTIMIZER, DenseMatrix > |
Namespaces | |
namespace | TransportSolver |
Functions | |
template<class T > | |
void | TransportSolver::transpose (const MatrixWrapper< T > &input, MatrixWrapper< T > &result) |
template<class InputIterator , class OutputIteratorValue , class OutputIteratorIndex , class UnaryPredicate > | |
OutputIteratorValue | TransportSolver::copy_if (InputIterator first, InputIterator last, OutputIteratorValue result, OutputIteratorIndex resultIndex, UnaryPredicate pred) |
template<class Iterator , class T > | |
T | TransportSolver::_Normalize (Iterator begin, Iterator end, T initialValue) |