euclideanDmatrix.h

Go to the documentation of this file.

/*PGR-GNU*****************************************************************
 
FILE: euclideanDmatrix.h
 
Copyright (c) 2015 pgRouting developers
Mail: [email protected]
 
------
 
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
 
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
 
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 
 ********************************************************************PGR-GNU*/
 
#ifndef INCLUDE_TSP_EUCLIDEANDMATRIX_H_
#define INCLUDE_TSP_EUCLIDEANDMATRIX_H_
#pragma once
 
#include <iostream>
#include <vector>
 
#include "c_types/coordinate_t.h"
 
namespace pgrouting {
namespace tsp {
 
class Tour;
 
class EuclideanDmatrix {
 public:
    EuclideanDmatrix() = default;
    explicit EuclideanDmatrix(
            const std::vector< Coordinate_t > &data_coordinates);
 
    bool has_no_infinity() const;
    bool obeys_triangle_inequality() const;
    bool is_symmetric() const;
 
    void set(size_t i, size_t j, double dist) {
        row = i; column = j; special_distance = dist;}
 
    bool has_id(int64_t id) const;
 
    size_t get_index(int64_t id) const;
 
    int64_t get_id(size_t idx) const;
 
    size_t size() const {return ids.size();}
 
    double tourCost(const Tour &tour) const;
 
    const std::vector<double> get_row(size_t idx) const;
 
    double comparable_distance(size_t i, size_t j) const;
    double distance(size_t i, size_t j) const;
 
    friend std::ostream& operator<<(
            std::ostream &log,
            const EuclideanDmatrix &matrix);
 
 protected:
    void set_ids();
    std::vector<int64_t> ids;
 
 private:
    std::vector < Coordinate_t >  coordinates;
    size_t row;
    size_t column;
    double special_distance;
};
 
}  // namespace tsp
}  // namespace pgrouting
 
#endif  // INCLUDE_TSP_EUCLIDEANDMATRIX_H_