143 lines
5.8 KiB
C++
143 lines
5.8 KiB
C++
/*
|
|
|
|
Copyright (c) 2014, Project OSRM, Dennis Luxen, others
|
|
All rights reserved.
|
|
|
|
Redistribution and use in source and binary forms, with or without modification,
|
|
are permitted provided that the following conditions are met:
|
|
|
|
Redistributions of source code must retain the above copyright notice, this list
|
|
of conditions and the following disclaimer.
|
|
Redistributions in binary form must reproduce the above copyright notice, this
|
|
list of conditions and the following disclaimer in the documentation and/or
|
|
other materials provided with the distribution.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
|
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
|
|
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
|
|
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
// This class constructs the edge-expanded routing graph
|
|
|
|
#ifndef EDGE_BASED_GRAPH_FACTORY_HPP_
|
|
#define EDGE_BASED_GRAPH_FACTORY_HPP_
|
|
|
|
#include "speed_profile.hpp"
|
|
#include "../typedefs.h"
|
|
#include "../data_structures/compressed_edge_container.hpp"
|
|
#include "../data_structures/deallocating_vector.hpp"
|
|
#include "../data_structures/edge_based_node.hpp"
|
|
#include "../data_structures/original_edge_data.hpp"
|
|
#include "../data_structures/query_node.hpp"
|
|
#include "../data_structures/turn_instructions.hpp"
|
|
#include "../data_structures/node_based_graph.hpp"
|
|
#include "../data_structures/restriction_map.hpp"
|
|
|
|
#include <algorithm>
|
|
#include <iosfwd>
|
|
#include <memory>
|
|
#include <queue>
|
|
#include <string>
|
|
#include <unordered_map>
|
|
#include <unordered_set>
|
|
#include <vector>
|
|
|
|
#include <boost/filesystem/fstream.hpp>
|
|
|
|
struct lua_State;
|
|
|
|
class EdgeBasedGraphFactory
|
|
{
|
|
public:
|
|
EdgeBasedGraphFactory() = delete;
|
|
EdgeBasedGraphFactory(const EdgeBasedGraphFactory &) = delete;
|
|
|
|
explicit EdgeBasedGraphFactory(std::shared_ptr<NodeBasedDynamicGraph> node_based_graph,
|
|
const CompressedEdgeContainer &compressed_edge_container,
|
|
const std::unordered_set<NodeID> &barrier_nodes,
|
|
const std::unordered_set<NodeID> &traffic_lights,
|
|
std::shared_ptr<const RestrictionMap> restriction_map,
|
|
const std::vector<QueryNode> &node_info_list,
|
|
SpeedProfileProperties speed_profile);
|
|
|
|
#ifdef DEBUG_GEOMETRY
|
|
void Run(const std::string &original_edge_data_filename,
|
|
lua_State *lua_state,
|
|
const std::string &edge_segment_lookup_filename,
|
|
const std::string &edge_penalty_filename,
|
|
const bool generate_edge_lookup,
|
|
const std::string &debug_turns_path);
|
|
#else
|
|
void Run(const std::string &original_edge_data_filename,
|
|
lua_State *lua_state,
|
|
const std::string &edge_segment_lookup_filename,
|
|
const std::string &edge_penalty_filename,
|
|
const bool generate_edge_lookup);
|
|
#endif
|
|
|
|
void GetEdgeBasedEdges(DeallocatingVector<EdgeBasedEdge> &edges);
|
|
|
|
void GetEdgeBasedNodes(std::vector<EdgeBasedNode> &nodes);
|
|
void GetStartPointMarkers(std::vector<bool> &node_is_startpoint);
|
|
|
|
unsigned GetHighestEdgeID();
|
|
|
|
TurnInstruction AnalyzeTurn(const NodeID u, const NodeID v, const NodeID w, const double angle) const;
|
|
|
|
int GetTurnPenalty(double angle, lua_State *lua_state) const;
|
|
|
|
private:
|
|
using EdgeData = NodeBasedDynamicGraph::EdgeData;
|
|
|
|
//! maps index from m_edge_based_node_list to ture/false if the node is an entry point to the graph
|
|
std::vector<bool> m_edge_based_node_is_startpoint;
|
|
//! list of edge based nodes (compressed segments)
|
|
std::vector<EdgeBasedNode> m_edge_based_node_list;
|
|
DeallocatingVector<EdgeBasedEdge> m_edge_based_edge_list;
|
|
unsigned m_max_edge_id;
|
|
|
|
const std::vector<QueryNode>& m_node_info_list;
|
|
std::shared_ptr<NodeBasedDynamicGraph> m_node_based_graph;
|
|
std::shared_ptr<RestrictionMap const> m_restriction_map;
|
|
|
|
const std::unordered_set<NodeID>& m_barrier_nodes;
|
|
const std::unordered_set<NodeID>& m_traffic_lights;
|
|
const CompressedEdgeContainer& m_compressed_edge_container;
|
|
|
|
SpeedProfileProperties speed_profile;
|
|
|
|
void CompressGeometry();
|
|
unsigned RenumberEdges();
|
|
void GenerateEdgeExpandedNodes();
|
|
#ifdef DEBUG_GEOMETRY
|
|
void GenerateEdgeExpandedEdges(const std::string &original_edge_data_filename,
|
|
lua_State *lua_state,
|
|
const std::string &edge_segment_lookup_filename,
|
|
const std::string &edge_fixed_penalties_filename,
|
|
const bool generate_edge_lookup,
|
|
const std::string &debug_turns_path);
|
|
#else
|
|
void GenerateEdgeExpandedEdges(const std::string &original_edge_data_filename,
|
|
lua_State *lua_state,
|
|
const std::string &edge_segment_lookup_filename,
|
|
const std::string &edge_fixed_penalties_filename,
|
|
const bool generate_edge_lookup);
|
|
#endif
|
|
|
|
void InsertEdgeBasedNode(const NodeID u, const NodeID v);
|
|
|
|
void FlushVectorToStream(std::ofstream &edge_data_file,
|
|
std::vector<OriginalEdgeData> &original_edge_data_vector) const;
|
|
|
|
};
|
|
|
|
#endif /* EDGE_BASED_GRAPH_FACTORY_HPP_ */
|