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
..
IO	move OM.h IO header to BGL package	2024-10-23 11:58:02 +02:00
boost/graph	BGL - add `CGAL::dijkstra_shortest_path(vs, vt, mesh)` (#8724)	2025-04-03 16:07:02 +02:00
draw_face_graph.h	solve a todo	2024-01-08 13:43:14 +01:00