edgeInfo.h

Go to the documentation of this file.

/*PGR-GNU*****************************************************************
 
FILE: edgeInfo.h
 
Copyright (c) 2017 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_TRSP_EDGEINFO_H_
#define INCLUDE_TRSP_EDGEINFO_H_
 
#include <vector>
 
 
#include "c_types/pgr_edge_t.h"
#include "cpp_common/pgr_assert.h"
 
namespace pgrouting {
namespace trsp {
 
 
class EdgeInfo {
 public:
     EdgeInfo() = default;
 
     EdgeInfo(
             pgr_edge_t edgeIn,
             size_t edgeIndex);
 
     inline size_t idx() const {return m_edgeIndex;}
 
     inline int64_t startNode() const {
         pgassert(m_edge.source >= 0);
         return m_edge.source;
     }
     inline int64_t endNode() const {
         pgassert(m_edge.target >= 0);
         return m_edge.target;}
 
     inline int64_t edgeID() const {return m_edge.id;}
     inline double cost() const {return m_edge.cost;}
     inline double r_cost() const {return m_edge.reverse_cost;}
     inline double get_cost(int64_t node) const {
         pgassert(node == startNode() || node == endNode());
         return node == startNode() ?
             cost() :
             r_cost();
     }
 
     void connect_endEdge(size_t edge_idx) {
         m_endConnectedEdge.push_back(edge_idx);
     }
     void connect_startEdge(size_t edge_idx) {
         m_startConnectedEdge.push_back(edge_idx);
     }
 
     std::vector<size_t> endConnectedEdge() const {
         return m_endConnectedEdge;
     }
 
     std::vector<size_t> startConnectedEdge() const {
         return m_startConnectedEdge;
     }
 
     std::vector<size_t> get_idx(bool isStart) const {
         return isStart ?
             startConnectedEdge() :
             endConnectedEdge();
     }
 
 
 private:
     pgr_edge_t m_edge;
     size_t m_edgeIndex;
     std::vector<size_t> m_startConnectedEdge;
     std::vector<size_t> m_endConnectedEdge;
};
 
}  // namespace trsp
}  // namespace pgrouting
 
#endif  // INCLUDE_TRSP_EDGEINFO_H_