pgrouting::tsp Namespace Reference

Classes
class	Dmatrix
class	EuclideanDmatrix
class	Tour
class	TSP

Functions
double	get_distance (std::pair< double, double > p1, std::pair< double, double > p2)
std::ostream &	operator<< (std::ostream &log, const Dmatrix &matrix)
std::ostream &	operator<< (std::ostream &log, const EuclideanDmatrix &matrix)
std::ostream &	operator<< (std::ostream &log, const Tour &tour)

Function Documentation

get_distance()

double pgrouting::tsp::get_distance	(	std::pair< double, double >	p1,
		std::pair< double, double >	p2
	)

Definition at line 127 of file Dmatrix.cpp.

                                                                      {
    auto dx = p1.first - p2.first;
    auto dy = p1.second - p2.second;
    return std::sqrt(dx * dx + dy * dy);
}

Referenced by pgrouting::tsp::Dmatrix::Dmatrix().

operator<<() [1/3]

std::ostream& pgrouting::tsp::operator<<	(	std::ostream &	log,
		const Dmatrix &	matrix
	)

Definition at line 216 of file Dmatrix.cpp.

                                                               {
    for (const auto id : matrix.ids) {
        log << "\t" << id;
    }
    log << "\n";
    size_t i = 0;
    for (const auto &row : matrix.costs) {
        size_t j = 0;
        for (const auto cost : row) {
            log << "Internal(" << i << "," << j << ")"
                << "\tUsers(" << matrix.ids[i] << "," << matrix.ids[j] << ")"
                << "\t = " << cost
#if 0
                << "\t(" << matrix.get_index(matrix.ids[i])
                << "," << matrix.get_index(matrix.ids[j]) << ")"
                << "\t = " << matrix.costs[i][j]
                << "\t = " << matrix.costs[j][i]
                << "=inf:"
                <<  (matrix.costs[i][j] ==
                        (std::numeric_limits<double>::infinity)())
                << "=inf:"
                <<  (matrix.costs[j][i] ==
                        (std::numeric_limits<double>::infinity)())
#endif
                << "\n";
            ++j;
        }
        ++i;
    }
#if 0
    for (size_t i = 0; i < matrix.costs.size(); ++i) {
        for (size_t j = 0; j < matrix.costs.size(); ++j) {
            for (size_t k = 0; k < matrix.costs.size(); ++k) {
                log << matrix.costs[i][k] << " <= ("
                    << matrix.costs[i][j] << " + "  << matrix.costs[j][k] << ")"
                    << (matrix.costs[i][k]
                            <= (matrix.costs[i][j] + matrix.costs[j][k]))
                    << "\n";
            }
        }
    }
#endif
    return log;
}

References pgrouting::tsp::Dmatrix::costs, pgrouting::tsp::Dmatrix::get_index(), and pgrouting::tsp::Dmatrix::ids.

operator<<() [2/3]

std::ostream& pgrouting::tsp::operator<<	(	std::ostream &	log,
		const EuclideanDmatrix &	matrix
	)

Definition at line 157 of file euclideanDmatrix.cpp.

                                                                        {
    for (const auto id : matrix.ids) {
        log << "\t" << id;
    }
    log << "\n";
    for (const auto row : matrix.coordinates) {
        log << row.id << "(" << row.x << "," << row.y << ")\n";
    }
    return log;
}

References pgrouting::tsp::EuclideanDmatrix::coordinates, and pgrouting::tsp::EuclideanDmatrix::ids.

operator<<() [3/3]

std::ostream& pgrouting::tsp::operator<<	(	std::ostream &	log,
		const Tour &	tour
	)

Definition at line 36 of file tour.cpp.

                          {
    for (const auto &city : tour.cities) {
        log << city << ", ";
    }
    return log;
}

References pgrouting::tsp::Tour::cities.