network.hpp

 
#ifndef FMM_NETWORK_HPP
#define FMM_NETWORK_HPP
 
#include "network/type.hpp"
#include "core/gps.hpp"
#include "mm/mm_type.hpp"
#include <ogrsf_frmts.h> // C++ API for GDAL
#include <iostream>
#include <math.h> // Calulating probability
#include <iomanip>
#include <algorithm> // Partial sort copy
#include <unordered_set> // Partial sort copy
 
// Data structures for Rtree
#include <boost/geometry/geometries/box.hpp>
#include <boost/geometry/index/rtree.hpp>
#include <boost/function_output_iterator.hpp>
 
namespace FMM {
namespace NETWORK {
class Network {
 public:
  typedef boost::geometry::model::box<FMM::CORE::Point> boost_box;
  typedef std::pair<boost_box, Edge *> Item;
  typedef boost::geometry::index::rtree<
      Item, boost::geometry::index::quadratic<16> > Rtree;
  Network(const std::string &filename,
          const std::string &id_name = "id",
          const std::string &source_name = "source",
          const std::string &target_name = "target");   // Network constructor
  int get_node_count() const;
  int get_edge_count() const;
  const std::vector<Edge> &get_edges() const;
  EdgeID get_edge_id(EdgeIndex index) const;
  EdgeIndex get_edge_index(EdgeID id) const;
  NodeID get_node_id(NodeIndex index) const;
  NodeIndex get_node_index(NodeID id) const;
  FMM::CORE::Point get_node_geom_from_idx(NodeIndex index) const;
 
  FMM::MM::Traj_Candidates search_tr_cs_knn(
      FMM::CORE::Trajectory &trajectory, std::size_t k, double radius) const;
 
  FMM::MM::Traj_Candidates search_tr_cs_knn(const FMM::CORE::LineString &geom,
                                            std::size_t k,
                                            double radius) const;
  const FMM::CORE::LineString &get_edge_geom(EdgeID edge_id) const;
  FMM::CORE::LineString complete_path_to_geometry(
      const FMM::CORE::LineString &traj,
      const MM::C_Path &complete_path) const;
  const std::vector<FMM::CORE::Point> &get_vertex_points() const;
  const FMM::CORE::Point &get_vertex_point(NodeIndex u) const;
  FMM::CORE::LineString route2geometry(const std::vector<EdgeID> &path) const;
  FMM::CORE::LineString route2geometry(
      const std::vector<EdgeIndex> &path) const;
  static bool candidate_compare(const MM::Candidate &a, const MM::Candidate &b);
 private:
  static void append_segs_to_line(FMM::CORE::LineString *line,
                                  const FMM::CORE::LineString &segs,
                                  int offset = 0);
  void build_rtree_index();
  int srid;   // Spatial reference id
  Rtree rtree;   // Network rtree structure
  std::vector<Edge> edges;   // all edges in the network
  NodeIDVec node_id_vec;
  unsigned int num_vertices;
  NodeIndexMap node_map;
  EdgeIndexMap edge_map;
  std::vector<FMM::CORE::Point> vertex_points;
}; // Network
} // NETWORK
} // FMM
#endif /* FMM_NETWORK_HPP */