Customizable Route Planning开源代码（CRP）
# 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*.
文件下载
资源详情
[{"title":"（ 50 个子文件 14.88MB ） Customizable Route Planning开源代码（CRP）","children":[{"title":"CRP-master","children":[{"title":"constants.h <span style='color:#111;'> 1.58KB </span>","children":null,"spread":false},{"title":"metrics","children":[{"title":"HopFunction.h <span style='color:#111;'> 1.81KB </span>","children":null,"spread":false},{"title":"Metric.h <span style='color:#111;'> 9.29KB </span>","children":null,"spread":false},{"title":"CostFunction.h <span style='color:#111;'> 1.68KB </span>","children":null,"spread":false},{"title":"DistanceFunction.h <span style='color:#111;'> 1.88KB </span>","children":null,"spread":false},{"title":"TimeFunction.h <span style='color:#111;'> 2.90KB </span>","children":null,"spread":false}],"spread":true},{"title":"SConstruct <span style='color:#111;'> 6.31KB </span>","children":null,"spread":false},{"title":"io","children":[{"title":"OSMParser.cpp <span style='color:#111;'> 20.24KB </span>","children":null,"spread":false},{"title":"vector_io.h <span style='color:#111;'> 3.05KB </span>","children":null,"spread":false},{"title":"SaxHandler.h <span style='color:#111;'> 2.36KB </span>","children":null,"spread":false},{"title":"GraphIO.h <span style='color:#111;'> 2.28KB </span>","children":null,"spread":false},{"title":"GraphIO.cpp <span style='color:#111;'> 16.63KB </span>","children":null,"spread":false},{"title":"SaxParser.h <span style='color:#111;'> 1.83KB </span>","children":null,"spread":false},{"title":"OSMParser.h <span style='color:#111;'> 9.12KB </span>","children":null,"spread":false},{"title":"SaxParser.cpp <span style='color:#111;'> 5.19KB </span>","children":null,"spread":false}],"spread":true},{"title":"examples","children":[{"title":"karlsruhe","children":[{"title":"karlsruhe.mlp <span style='color:#111;'> 347.62KB </span>","children":null,"spread":false},{"title":"karlsruhe.osm.bz2 <span style='color:#111;'> 14.53MB </span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"LICENSE <span style='color:#111;'> 1.05KB </span>","children":null,"spread":false},{"title":"test","children":[{"title":"UnpackPathTest.cpp <span style='color:#111;'> 4.78KB </span>","children":null,"spread":false},{"title":"QueryTest.cpp <span style='color:#111;'> 5.25KB </span>","children":null,"spread":false},{"title":"OverlayGraphTest.cpp <span style='color:#111;'> 8.25KB </span>","children":null,"spread":false},{"title":"DijkstraTest.cpp <span style='color:#111;'> 5.03KB </span>","children":null,"spread":false}],"spread":true},{"title":"precalculation","children":[{"title":"Precalculation.cpp <span style='color:#111;'> 3.05KB </span>","children":null,"spread":false}],"spread":true},{"title":"README.md <span style='color:#111;'> 3.89KB </span>","children":null,"spread":false},{"title":"project_documentation.pdf <span style='color:#111;'> 243.98KB </span>","children":null,"spread":false},{"title":"algorithm","children":[{"title":"CRPQuery.cpp <span style='color:#111;'> 22.77KB </span>","children":null,"spread":false},{"title":"CRPQueryUni.cpp <span style='color:#111;'> 7.82KB </span>","children":null,"spread":false},{"title":"CRPQueryUni.h <span style='color:#111;'> 2.36KB </span>","children":null,"spread":false},{"title":"PathUnpacker.h <span style='color:#111;'> 4.07KB </span>","children":null,"spread":false},{"title":"Dijkstra.h <span style='color:#111;'> 2.02KB </span>","children":null,"spread":false},{"title":"ParallelCRPQuery.h <span style='color:#111;'> 2.41KB </span>","children":null,"spread":false},{"title":"PathUnpacker.cpp <span style='color:#111;'> 7.74KB </span>","children":null,"spread":false},{"title":"CRPQuery.h <span style='color:#111;'> 2.39KB </span>","children":null,"spread":false},{"title":"Dijkstra.cpp <span style='color:#111;'> 4.13KB </span>","children":null,"spread":false},{"title":"Query.h <span style='color:#111;'> 2.79KB </span>","children":null,"spread":false},{"title":"ParallelCRPQuery.cpp <span style='color:#111;'> 22.97KB </span>","children":null,"spread":false}],"spread":false},{"title":"timer.h <span style='color:#111;'> 1.51KB </span>","children":null,"spread":false},{"title":".gitignore <span style='color:#111;'> 324B </span>","children":null,"spread":false},{"title":"datastructures","children":[{"title":"OverlayWeights.cpp <span style='color:#111;'> 8.64KB </span>","children":null,"spread":false},{"title":"OverlayGraph.h <span style='color:#111;'> 8.70KB </span>","children":null,"spread":false},{"title":"OverlayGraph.cpp <span style='color:#111;'> 8.87KB </span>","children":null,"spread":false},{"title":"id_queue.h <span style='color:#111;'> 5.78KB </span>","children":null,"spread":false},{"title":"QueryResult.h <span style='color:#111;'> 1.58KB </span>","children":null,"spread":false},{"title":"OverlayWeights.h <span style='color:#111;'> 2.36KB </span>","children":null,"spread":false},{"title":"LevelInfo.h <span style='color:#111;'> 2.71KB </span>","children":null,"spread":false},{"title":"Graph.h <span style='color:#111;'> 13.62KB </span>","children":null,"spread":false},{"title":"MultiLevelPartition.h <span style='color:#111;'> 2.57KB </span>","children":null,"spread":false},{"title":"Graph.cpp <span style='color:#111;'> 5.20KB </span>","children":null,"spread":false},{"title":"MultiLevelPartition.cpp <span style='color:#111;'> 4.01KB </span>","children":null,"spread":false}],"spread":false},{"title":"customization","children":[{"title":"Customization.cpp <span style='color:#111;'> 2.99KB </span>","children":null,"spread":false}],"spread":true}],"spread":false}],"spread":true}]
评论信息
-
-
-
Liyuanr :下载完还没仔细看，不过免费真良心2018-08-29 -
其他资源
- Word2TeX 注册破解版 Word转Tex软件 doc转tex
- TIMIT语音数据库
- C#超市管理系统源码（含数据库，运行是自动附加）
- UltraEdit64位破解版
- zend-developer-tools：用于ZF2 MVC层的开发人员和调试工具模块-源码
- FreeFileSync_v11.1.exe
- C语言控制台版贪吃蛇游戏.rar
- 轩宇粮食收购管理系统 v1.0 单机版.zip
- 电动汽车充放电优化管理.rar
- 学生信息管理系统的开发与实现
- 在线商城（javaweb项目）
- Fuzzy_50__Key
- SQLyog-11.2.7 破解版 含注册码和破解方法
- Android评论功能以及评论区置顶效果
- 利用C++实现在控制台下的音乐播放器
- 人口健康信息平台解决方案
- stc系列封装库
- poco-1.8.0.1
- 2019微信墙，微信大屏，微信活动屏幕系统
- 大气宽屏简洁扁平bootstrap手机平板网站模板
免责申明
【只为小站】的资源来自网友分享，仅供学习研究，请务必在下载后24小时内给予删除，不得用于其他任何用途，否则后果自负。基于互联网的特殊性，【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查；无论 【只为小站】 经营者是否已进行审查，用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明