network_graph.hpp

 
#ifndef FMM_NETWORK_GRAPH_HPP
#define FMM_NETWORK_GRAPH_HPP
 
#include "network/heap.hpp"
#include "network/graph.hpp"
#include "network/network.hpp"
 
namespace FMM {
namespace NETWORK {
class NetworkGraph {
 public:
  explicit NetworkGraph(const Network &network_arg);
  std::vector<EdgeIndex> shortest_path_dijkstra(
      NodeIndex source, NodeIndex target) const;
  double calc_heuristic_dist(
      const CORE::Point &p1, const CORE::Point &p2) const;
  std::vector<EdgeIndex> shortest_path_astar(NodeIndex source,
                                             NodeIndex target) const;
  std::vector<EdgeIndex> back_track(NodeIndex source,
                                    NodeIndex target,
                                    const PredecessorMap &pmap,
                                    const DistanceMap &dmap) const;
  void single_source_upperbound_dijkstra(NodeIndex source,
                                         double delta,
                                         PredecessorMap *pmap,
                                         DistanceMap *dmap) const;
  int get_edge_index(NodeIndex source, NodeIndex target,
                     double cost) const;
  inline int get_edge_id(EdgeIndex idx) const {
    return network.get_edge_id(idx);
  };
  inline int get_edge_id(NodeIndex source, NodeIndex target,
                         double cost) const {
    return network.get_edge_id(get_edge_index(source, target, cost));
  };
  inline int get_node_id(NodeIndex idx) const {
    return network.get_node_id(idx);
  };
  inline NodeIndex get_node_index(NodeID id) const {
    return network.get_node_index(id);
  };
  inline const FMM::CORE::Point &get_vertex_point(NodeIndex u) const {
    return network.get_vertex_point(u);
  };
  void print_graph() const;
  const Graph_T &get_boost_graph() const;
  const Network &get_network();
  unsigned int get_num_vertices() const;
 protected:
  Graph_T g; 
  static constexpr double DOUBLE_MIN = 1.e-6;
  const Network &network; 
  unsigned int num_vertices = 0; 
}; // NetworkGraph
}; // NETWORK
} // FMM
#endif /* FMM_NETWORK_GRAPH_HPP */