Sebastien Loriot ede0864914 BGL - add `CGAL::dijkstra_shortest_path(vs, vt, mesh)` (#8724) ... ## Summary of Changes computes the shortest path between two vertices, using Dijkstra algorithm Todo - [x] write doc and integrate to - [x] add np - [x] add measure to define what "shortest" means - [x] add to ref manual top page - [x] use in demo code ## Release Management * Affected package(s): BGL * [Small feature](https://cgalwiki.geometryfactory.com/CGAL/Members/wiki/Features/Small_Features/Add_CGAL::shortest_path(vs,_vt)) * Link to compiled documentation [CGAL::shortest_path_between_two_vertices()](https://cgal.github.io/8724/v0/BGL/group__PkgBGLTraversal.html#ga5627dee8a6fe4d238cb5c91e123aa763) * License and copyright ownership: unchanged		2025-04-03 16:07:02 +02:00
..
data	automatically move data files in data dir + update paths	2021-10-04 09:42:49 +02:00
CMakeLists.txt	BGL - add `CGAL::dijkstra_shortest_path(vs, vt, mesh)` (#8724)	2025-04-03 16:07:02 +02:00
connected_components.cpp	char* -> std::string	2021-10-04 09:49:24 +02:00
gwdwg.cpp	Add several #include	2024-03-14 10:09:07 +01:00
prim.cpp	Use wrapper files to suppress warning	2022-05-05 08:46:11 +01:00
seam_mesh.cpp	char* -> std::string	2021-10-04 09:49:24 +02:00
shortest_path.cpp	remove not used namespace	2025-03-27 10:04:38 +01:00
surface_mesh_dual.cpp	char* -> std::string	2021-10-04 09:49:24 +02:00
surface_mesh_partition.cpp	boost::tie -> std::tie	2025-01-24 14:20:00 +01:00
write_inp.cpp	Add several #include	2024-03-14 10:09:07 +01:00