上传源码
  1. 首页
  2. C/C++

Customizable Route Planning开源代码CRP

标签： CRP  • 文件类型: .zip • 文件大小: 14.88MB • 下载次数: 1 •

# CRP Open source C++ Implementation of Customizable Route Planning (CRP) by Delling et al. This project was part of a practical course at Karlsruhe Institute of Technology (KIT). Requirements ============ In order to build CRP you need to have the following software installed: - Boost C++ Library (http://www.boost.org), more specifically Boost Iostreams. - Scons (http://scons.org) - g++ >= 4.8 (https://gcc.gnu.org) Building CRP ============ If the Boost Library is not in your PATH, make sure to edit the *SConstruct* file in the root directory to point the build script to the correct location of Boost. There is a section *Libraries* in the *SConstruct* file where you can specify the paths. Once you have installed all the software packages listed above, you can build the CRP programs by typing ``` scons --target=CRP --optimize=Opt -jX ``` into your terminal where `X` is the number of cores you want to use for building the project. If you want to use a specific g++ compiler version you can add `--compiler=g++-Version`. We also support a debug and profiling build that you can call with `--optimize=Dbg` and `--optimize=Pro` respectively. This command will build three programs in the folder *deploy*: - *osmparser*: Used to parse an OpenStreetMap (OSM) bz2-compressed map file. Call it with `./deploy/osmparser path_to_osm.bz2 path_to_output.graph.bz2` - *precalculation*: Used to build an overlay graph based on a given partition. Call it with `./deploy/precalculation path_to_graph path_to_mlp output_directory`. Here, *path_to_mlp* is the path to a *MultiLevelPartition* file for the graph that you need to provide. For more details, take a look into our project documentation. - *customization*: Used to precompute the metric weights for the overlay graph. Call it with `./deploy/customization path_to_graph path_to_overlay_graph metric_output_directory metric_type`. We currently support the following metric types: *hop* (number of edges traversed), *time* and *dist*.
资源截图
小图 大图
代码片段和文件信息 
/*
 * CRPQuery.cpp
 *
 *  Created on: Jan 8 2016
 *      Author: Michael Wegner & Matthias Wolf
 *
 * Copyright （c） 2016 Michael Wegner and Matthias Wolf
 *
 * Permission is hereby granted free of charge to any person obtaining a copy
 * of this software and associated documentation files （the “Software“） to deal
 * in the Software without restriction including without limitation the rights
 * to use copy modify merge publish distribute sublicense and/or sell
 * copies of the Software and to permit persons to whom the Software is
 * furnished to do so subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED “AS IS“ WITHOUT WARRANTY OF ANY KIND EXPRESS OR
 * IMPLIED INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM DAMAGES OR OTHER
 * LIABILITY WHETHER IN AN ACTION OF CONTRACT TORT OR OTHERWISE ARISING FROM
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */

#include “CRPQuery.h“

#include 
#include 

#include “../timer.h“

namespace CRP {

CRPQuery::CRPQuery（const Graph& graph const OverlayGraph& overlayGraph const std::vector& metrics PathUnpacker& pathUnpacker） : Query（graph overlayGraph metrics） pathUnpacker（pathUnpacker） {
	const count vectorSize = 2 * graph.getMaxEdgesInCell（） + overlayGraph.numberOfVertices（）;
	forwardInfo = std::vector（vectorSize {inf_weight 0}）;
	backwardInfo = std::vector（vectorSize {inf_weight 0}）;	
	
	forwardGraphPQ = MinIDQueue（2 * graph.getMaxEdgesInCell（））;
	forwardOverlayGraphPQ = MinIDQueue（overlayGraph.numberOfVertices（））;

	backwardGraphPQ = MinIDQueue（2*graph.getMaxEdgesInCell（））;
	backwardOverlayGraphPQ = MinIDQueue（overlayGraph.numberOfVertices（））;

	currentRound = 0;
}

QueryResult CRPQuery::vertexQuery（index sourceVertexId index targetVertexId index metricId） {
	const BackwardEdge &backwardEdgeToStart = graph.getBackwardEdge（graph.getEntryOffset（sourceVertexId））;
	index sourceEdgeId = graph.getExitOffset（backwardEdgeToStart.tail） + backwardEdgeToStart.exitPoint;

	const ForwardEdge &forwardEdgeFromTarget = graph.getForwardEdge（graph.getExitOffset（targetVertexId））;
	index targetEdgeId = graph.getEntryOffset（forwardEdgeFromTarget.head） + forwardEdgeFromTarget.entryPoint;
	
	return edgeQuery（sourceEdgeId targetEdgeId metricId）;
}

QueryResult CRPQuery::edgeQuery（index sourceEdgeId index targetEdgeId index metricId） {
	currentRound++;

	const index s = graph.getForwardEdge（sourceEdgeId）.head;
	const index sGlobalId = graph.getEntryOffset（s） + graph.getForwardEdge（sourceEdgeId）.entryPoint;
	const pv sCellNumber = graph.getCellNumber（s）;

 属性            大小     日期    时间   名称
----------- ---------  ---------- -----  ----
     目录           0  2016-04-29 09:55  CRP-master
     文件         324  2016-04-29 09:55  CRP-master.gitignore
     文件        1080  2016-04-29 09:55  CRP-masterLICENSE
     文件        3985  2016-04-29 09:55  CRP-masterREADME.md
     文件        6458  2016-04-29 09:55  CRP-masterSConstruct
     目录           0  2016-04-29 09:55  CRP-masteralgorithm
     文件       23318  2016-04-29 09:55  CRP-masteralgorithmCRPQuery.cpp
     文件        2447  2016-04-29 09:55  CRP-masteralgorithmCRPQuery.h
     文件        8004  2016-04-29 09:55  CRP-masteralgorithmCRPQueryUni.cpp
     文件        2420  2016-04-29 09:55  CRP-masteralgorithmCRPQueryUni.h
     文件        4229  2016-04-29 09:55  CRP-masteralgorithmDijkstra.cpp
     文件        2065  2016-04-29 09:55  CRP-masteralgorithmDijkstra.h
     文件       23519  2016-04-29 09:55  CRP-masteralgorithmParallelCRPQuery.cpp
     文件        2467  2016-04-29 09:55  CRP-masteralgorithmParallelCRPQuery.h
     文件        7927  2016-04-29 09:55  CRP-masteralgorithmPathUnpacker.cpp
     文件        4166  2016-04-29 09:55  CRP-masteralgorithmPathUnpacker.h
     文件        2862  2016-04-29 09:55  CRP-masteralgorithmQuery.h
     文件        1623  2016-04-29 09:55  CRP-masterconstants.h
     目录           0  2016-04-29 09:55  CRP-mastercustomization
     文件        3062  2016-04-29 09:55  CRP-mastercustomizationCustomization.cpp
     目录           0  2016-04-29 09:55  CRP-masterdatastructures
     文件        5321  2016-04-29 09:55  CRP-masterdatastructuresGraph.cpp
     文件       13948  2016-04-29 09:55  CRP-masterdatastructuresGraph.h
     文件        2779  2016-04-29 09:55  CRP-masterdatastructuresLevelInfo.h
     文件        4106  2016-04-29 09:55  CRP-masterdatastructuresMultiLevelPartition.cpp
     文件        2630  2016-04-29 09:55  CRP-masterdatastructuresMultiLevelPartition.h
     文件        9080  2016-04-29 09:55  CRP-masterdatastructuresOverlayGraph.cpp
     文件        8907  2016-04-29 09:55  CRP-masterdatastructuresOverlayGraph.h
     文件        8846  2016-04-29 09:55  CRP-masterdatastructuresOverlayWeights.cpp
     文件        2419  2016-04-29 09:55  CRP-masterdatastructuresOverlayWeights.h
     文件        1617  2016-04-29 09:55  CRP-masterdatastructuresQueryResult.h
............此处省略29个文件信息
立即下载
C++ Primer 英文版_完整版_第五版   WFQ算法实现c/c++
0 0

版权声明：本文内容由互联网用户自发贡献，该文观点仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容， 请发送邮件举报，一经查实，本站将立刻删除。

发表评论

评论列表（条）