mirror of https://github.com/CGAL/cgal
ede0864914
## 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 |
||
|---|---|---|
| .. | ||
| IO | ||
| METIS | ||
| internal | ||
| Dual.h | ||
| Euler_operations.h | ||
| Face_filtered_graph.h | ||
| Graph_with_descriptor_with_graph.h | ||
| Graph_with_descriptor_with_graph_fwd.h | ||
| Seam_mesh.h | ||
| alpha_expansion_graphcut.h | ||
| backward_compatibility_functions.h | ||
| breadth_first_search.h | ||
| copy_face_graph.h | ||
| dijkstra_shortest_path.h | ||
| generators.h | ||
| graph_concepts.h | ||
| graph_traits_OpenMesh.h | ||
| graph_traits_PolyMesh_ArrayKernelT.h | ||
| graph_traits_Seam_mesh.h | ||
| graph_traits_TriMesh_ArrayKernelT.h | ||
| graph_traits_inheritance_macros.h | ||
| halfedge_graph_traits.h | ||
| helpers.h | ||
| io.h | ||
| iterator.h | ||
| kruskal_min_spanning_tree.h | ||
| named_params_helper.h | ||
| partition.h | ||
| prim_minimum_spanning_tree.h | ||
| properties.h | ||
| properties_OpenMesh.h | ||
| properties_PolyMesh_ArrayKernelT.h | ||
| properties_Seam_mesh.h | ||
| properties_TriMesh_ArrayKernelT.h | ||
| property_maps.h | ||
| selection.h | ||
| split_graph_into_polylines.h | ||
| visitor.h | ||