WIP: Consolidation of shortest path calculations,

various chaining algorithms are replaced with the improved TSP
algorithm.
This commit is contained in:
bubnikv 2019-09-26 17:30:03 +02:00
parent 10eecb2cab
commit d06831076d
8 changed files with 43 additions and 78 deletions

View file

@ -3,6 +3,7 @@
%{
#include <xsinit.h>
#include "libslic3r/Geometry.hpp"
#include "libslic3r/ShortestPath.hpp"
%}
@ -49,7 +50,7 @@ std::vector<Points::size_type>
chained_path(points)
Points points
CODE:
Slic3r::Geometry::chained_path(points, RETVAL);
RETVAL = chain_points(points);
OUTPUT:
RETVAL
@ -58,7 +59,7 @@ chained_path_from(points, start_from)
Points points
Point* start_from
CODE:
Slic3r::Geometry::chained_path(points, RETVAL, *start_from);
RETVAL = chain_points(points, start_from);
OUTPUT:
RETVAL