{"id":15470667,"url":"https://github.com/mborne/graph-experiments","last_synced_at":"2025-03-28T12:41:05.424Z","repository":{"id":71407397,"uuid":"240265737","full_name":"mborne/graph-experiments","owner":"mborne","description":"[DEV]Graph processing experiments based on boost::graph and GDAL / OGR to load data.","archived":false,"fork":false,"pushed_at":"2023-11-19T10:52:22.000Z","size":1129,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-02T13:12:57.594Z","etag":null,"topics":["boost-graph","cxx","dijkstra-shortest-path","experiment","gdal","graph-algorithms","isochrones","multi-indexing"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/mborne.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2020-02-13T13:23:18.000Z","updated_at":"2024-06-09T08:23:27.000Z","dependencies_parsed_at":"2023-06-28T21:45:39.153Z","dependency_job_id":null,"html_url":"https://github.com/mborne/graph-experiments","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mborne%2Fgraph-experiments","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mborne%2Fgraph-experiments/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mborne%2Fgraph-experiments/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mborne%2Fgraph-experiments/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mborne","download_url":"https://codeload.github.com/mborne/graph-experiments/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246034197,"owners_count":20712851,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["boost-graph","cxx","dijkstra-shortest-path","experiment","gdal","graph-algorithms","isochrones","multi-indexing"],"created_at":"2024-10-02T02:06:10.624Z","updated_at":"2025-03-28T12:41:05.405Z","avatar_url":"https://github.com/mborne.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# graph-experiments\n\n## Description\n\nGraph processing experiments based on **boost::graph** and **GDAL / OGR** to load data.\n\n## Motivation\n\n**This project is not maintained.** It has been created in 2019 to prepare work about tour planning at [IGNF](https://github.com/IGNF).\n\n## Key Features\n\n* [src/egraph/routing/PathTree.h](src/egraph/routing/PathTree.h) is using [Boost Multi-Index](https://www.boost.org/doc/libs/1_63_0/libs/multi_index/doc/index.html) to index `(visited,cost)` to optimize **Dijkstra path finding**.\n* [src/egraph/FeatureGraph.h](src/egraph/FeatureGraph.h) is providing a [Boost graph](https://www.boost.org/doc/libs/1_75_0/libs/graph/doc/index.html) where vertex and edges are [OGRFeature](https://gdal.org/doxygen/classOGRFeature.html) from [GDAL](https://gdal.org/doxygen/index.html)\n\n\n## Build\n\n* [CMake - Building on debian or ubuntu](docs/build-debian.md)\n* [CMake - Building with docker](docs/build-docker.md)\n* [CMake - Building on windows with Microsoft Visual Studio (nmake) and miniconda](docs/build-windows.md)\n\n## Examples\n\n* [example/demo-boost.cpp](example/demo-boost.cpp) : Getting started with `boost::graph`\n* [example/demo-dijkstra.cpp](example/demo-dijkstra.cpp) : Shortest path computation\n* [example/demo-ogr.cpp](example/demo-ogr.cpp) : Load `FeatureGraph` using GDAL/OGR and compute some `ShortestPathTree`\n\n```bash\nexample/demo-ogr \"PG:dbname=gis\" \"graph.vertex\" \"graph.edge\"\n# or\nexample/demo-ogr \"PG:dbname=gis\" \"graph.vertex\" \"graph.edge_distance_weighted\"\n```\n\n![Dijkstra shortest path tree](img/path-tree-1.png)\n\n## Performance debug\n\n```bash\nvalgrind --tool=callgrind example/demo-ogr 'PG:dbname=gis' 'graph.vertex' 'graph.edge_distance_weighted'\nkcachegrind $(ls -tr callgrind.out.* | tail -1)\n```\n\n## License\n\n[MIT](LICENSE)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmborne%2Fgraph-experiments","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmborne%2Fgraph-experiments","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmborne%2Fgraph-experiments/lists"}