Graph processing experiments based on boost::graph and GDAL / OGR to load data.
This project is not maintained. It has been created in 2019 to prepare work about tour planning at IGNF.
- src/egraph/routing/PathTree.h is using Boost Multi-Index to index
(visited,cost)to optimize Dijkstra path finding. - src/egraph/FeatureGraph.h is providing a Boost graph where vertex and edges are OGRFeature from GDAL
- CMake - Building on debian or ubuntu
- CMake - Building with docker
- CMake - Building on windows with Microsoft Visual Studio (nmake) and miniconda
- example/demo-boost.cpp : Getting started with
boost::graph - example/demo-dijkstra.cpp : Shortest path computation
- example/demo-ogr.cpp : Load
FeatureGraphusing GDAL/OGR and compute someShortestPathTree
example/demo-ogr "PG:dbname=gis" "graph.vertex" "graph.edge"
# or
example/demo-ogr "PG:dbname=gis" "graph.vertex" "graph.edge_distance_weighted"
valgrind --tool=callgrind example/demo-ogr 'PG:dbname=gis' 'graph.vertex' 'graph.edge_distance_weighted'
kcachegrind $(ls -tr callgrind.out.* | tail -1)