cgal/Cone_spanners_2/examples/Cone_spanners_2
Sébastien Loriot 4f9791a40b fix dependencies 2024-01-03 18:11:50 +01:00
..
data replace tabs with 4 spaces 2016-05-31 09:48:36 +02:00
CMakeLists.txt fix dependencies 2024-01-03 18:11:50 +01:00
README run astyle 2016-05-31 10:05:12 +02:00
compute_cones.cpp fix runtime issues 2021-10-04 10:22:13 +02:00
dijkstra_theta.cpp remove .cmd files for examples 2021-09-23 18:54:46 +02:00
theta_io.cpp Replace use of lexical_cast<std::string> with std::to_string 2023-01-15 17:23:04 +00:00

README

[Examples description]
compute_cones.cpp: this example computes the cone boundaries given the number of cones
   and the initial direction.

theta_io.cpp: this example constructs a Theta graph exactly with an input file containing a vertex list,
   and then generates the Gnuplot files for plotting the constructed Theta graph.

dijkstra_theta.cpp: this example constructs Theta graph first and then calculates
   the shortest paths on this graph by calling the Dijkstra's algorithm from BGL.