composite_graph.hpp

 
#ifndef FMM_COMPOSITEGRAPH_HPP
#define FMM_COMPOSITEGRAPH_HPP
 
#include "network/network_graph.hpp"
 
namespace FMM {
 
namespace MM {
 
typedef unsigned int DummyIndex;
 
class DummyGraph {
 public:
  DummyGraph();
  DummyGraph(const Traj_Candidates &traj_candidates);
 
  NETWORK::Graph_T *get_graph_ptr();
 
  const NETWORK::Graph_T &get_boost_graph() const;
 
  int get_num_vertices() const;
  bool containNodeIndex(NETWORK::NodeIndex external_index) const;
 
  NETWORK::NodeIndex get_external_index(DummyIndex inner_index) const;
 
  DummyIndex get_internal_index(NETWORK::NodeIndex external_index) const;
  int get_edge_index(NETWORK::NodeIndex source,
                     NETWORK::NodeIndex target, double cost) const;
  void print_node_index_map() const;
 protected:
  void add_edge(NETWORK::NodeIndex source, NETWORK::NodeIndex target,
                NETWORK::EdgeIndex edge_index, double cost);
 private:
  static constexpr double DOUBLE_MIN = 1e-6;
  NETWORK::Graph_T g;
  std::vector<NETWORK::NodeIndex> external_index_vec;
  std::unordered_map<NETWORK::NodeIndex, DummyIndex> internal_index_map;
};
 
struct CompEdgeProperty {
  NETWORK::NodeIndex v; 
  double cost; 
};
 
class CompositeGraph {
 public:
  CompositeGraph(const NETWORK::NetworkGraph &g,
                 const DummyGraph &dg);
  unsigned int get_dummy_node_start_index() const;
  int get_edge_index(NETWORK::NodeIndex u,
                     NETWORK::NodeIndex v, double cost) const;
  NETWORK::EdgeID get_edge_id(NETWORK::NodeIndex u,
                     NETWORK::NodeIndex v, double cost) const;
  std::vector<CompEdgeProperty> out_edges(NETWORK::NodeIndex u) const;
  bool check_dummy_node(NETWORK::NodeIndex u) const;
 private:
  const NETWORK::NetworkGraph &g_;
  const DummyGraph &dg_;
  unsigned int num_vertices;
};
}
}
#endif