/ CustomizableRoutePlanning开源代码（CRP）
CustomizableRoutePlanning开源代码（CRP）
CustomizableRoutePlanning开源代码（CRP）
#CRPOpensourceC++ImplementationofCustomizableRoutePlanning(CRP)byDellingetal.ThisprojectwaspartofapracticalcourseatKarlsruheInstituteofTechnology(KIT).Requirements============InordertobuildCRPyouneedtohavethefollowingsoftwareinstalled:-BoostC++Library(http://www.boost.org),morespecificallyBoostIostreams.-Scons(http://scons.org)-g++＞=4.8(https://gcc.gnu.org)BuildingCRP============IftheBoostLibraryisnotinyourPATH,makesuretoeditthe*SConstruct*fileintherootdirectorytopointthebuildscripttothecorrectlocationofBoost.Thereisasection*Libraries*inthe*SConstruct*filewhereyoucanspecifythepaths.Onceyouhaveinstalledallthesoftwarepackageslistedabove,youcanbuildtheCRPprogramsbytyping```scons--target=CRP--optimize=Opt-jX```intoyourterminalwhere`X`isthenumberofcoresyouwanttouseforbuildingtheproject.Ifyouwanttouseaspecificg++compilerversionyoucanadd`--compiler=g++-Version`.Wealsosupportadebugandprofilingbuildthatyoucancallwith`--optimize=Dbg`and`--optimize=Pro`respectively.Thisco妹妹andwillbuildthreeprogramsinthefolder*deploy*:-*osmparser*:UsedtoparseanOpenStreetMap(OSM)bz2-compressedmapfile.Callitwith`./deploy/osmparserpath_to_osm.bz2path_to_output.graph.bz2`-*precalculation*:Usedtobuildanoverlaygraphbasedonagivenpartition.Callitwith`./deploy/precalculationpath_to_graphpath_to_mlpoutput_directory`.Here,*path_to_mlp*isthepathtoa*MultiLevelPartition*fileforthegraphthatyouneedtoprovide.Formoredetails,takealookintoourprojectdocumentation.-*customization*:Usedtoprecomputethemetricweightsfortheoverlaygraph.Callitwith`./deploy/customizationpath_to_graphpath_to_overlay_graphmetric_output_directorymetric_type`.Wecurrentlysupportthefollowingmetrictypes:*hop*(numberofedgestraversed),*time*and*dist*. 本软件ID:10383527
#CRPOpensourceC++ImplementationofCustomizableRoutePlanning(CRP)byDellingetal.ThisprojectwaspartofapracticalcourseatKarlsruheInstituteofTechnology(KIT).Requirements============InordertobuildCRPyouneedtohavethefollowingsoftwareinstalled:-BoostC++Library(http://www.boost.org),morespecificallyBoostIostreams.-Scons(http://scons.org)-g++＞=4.8(https://gcc.gnu.org)BuildingCRP============IftheBoostLibraryisnotinyourPATH,makesuretoeditthe*SConstruct*fileintherootdirectorytopointthebuildscripttothecorrectlocationofBoost.Thereisasection*Libraries*inthe*SConstruct*filewhereyoucanspecifythepaths.Onceyouhaveinstalledallthesoftwarepackageslistedabove,youcanbuildtheCRPprogramsbytyping```scons--target=CRP--optimize=Opt-jX```intoyourterminalwhere`X`isthenumberofcoresyouwanttouseforbuildingtheproject.Ifyouwanttouseaspecificg++compilerversionyoucanadd`--compiler=g++-Version`.Wealsosupportadebugandprofilingbuildthatyoucancallwith`--optimize=Dbg`and`--optimize=Pro`respectively.Thisco妹妹andwillbuildthreeprogramsinthefolder*deploy*:-*osmparser*:UsedtoparseanOpenStreetMap(OSM)bz2-compressedmapfile.Callitwith`./deploy/osmparserpath_to_osm.bz2path_to_output.graph.bz2`-*precalculation*:Usedtobuildanoverlaygraphbasedonagivenpartition.Callitwith`./deploy/precalculationpath_to_graphpath_to_mlpoutput_directory`.Here,*path_to_mlp*isthepathtoa*MultiLevelPartition*fileforthegraphthatyouneedtoprovide.Formoredetails,takealookintoourprojectdocumentation.-*customization*:Usedtoprecomputethemetricweightsfortheoverlaygraph.Callitwith`./deploy/customizationpath_to_graphpath_to_overlay_graphmetric_output_directorymetric_type`.Wecurrentlysupportthefollowingmetrictypes:*hop*(numberofedgestraversed),*time*and*dist*. 本软件ID:10383527
文件下载
资源详情
[{"title":"（50个子文件14.88MB）CustomizableRoutePlanning开源代码（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
其他资源
- Javaswing开发的先生信息管理系统
- 旋钮编码器STM32F407
- 蓝牙经典书籍：蓝牙核心技术pdf
- buildroot-2020.02.11.tar.bz2
- MATLAB源码集锦-基于小波神经网络的短时交通流量工夫序列预测程序
- fastreport在qt中的调用
- 海康威视NVR-Web控件开发包（含32位和64位）
- jboss反序列化漏洞检测工具
- GaA全局优化算法.zip
- rhino.python教程（英文）
- 利用钩子技术控制进程创建(源码)
- java系统二手信息发布交易.zip
- docker-compose安装redis、mysql、es集群
- 4-3(View游戏框架).7z
- IBindStatusCallback子类
- javaweb超市进销系统
- IDLViewer便于IDL的开发
- 分割阈值（opencv2）
- EPop激活工具
- 黑页源码给力！
免责申明
【好快吧下载】的资源来自网友分享，仅供学习研究，请务必在下载后24小时内给予删除，不得用于其他任何用途，否则后果自负。基于互联网的特殊性，【好快吧下载】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查；无论 【好快吧下载】 经营者是否已进行审查，用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，8686821#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，8686821#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明