60528c5c2a
(rewrote the Dijkstra shortest path algorithm to use a binary priority heap instead of a dumb O(n^2) algorithm, added some bounding box tests to avoid expensive in-polygon tests if possible). |
||
---|---|---|
.. | ||
lib/Slic3r | ||
src | ||
t | ||
xsp | ||
Build.PL | ||
MANIFEST | ||
MANIFEST.SKIP |