-
**Is your feature request related to a problem? Please describe.**
Yes, when a hole is going through the top layer, the infill pattern creates a visible line stemming from the hole, not following the…
-
To find cul-de-sacs and in a road network and other uses, calculating the valency of of points is helpful.
https://gis.stackexchange.com/a/48270/9410
https://desktop.arcgis.com/en/arcmap/latest/…
-
It's possible to export a netlist from DIYLC. This is part way towards _importing_ a netlist from a schematic, which would be a useful feature. (This is mentioned, but lost among many other issues in …
-
In general, it seems that retraction allows a limited amount of oozeless travel time, and the amount of ooze/error then starts increasing proportionally (but not linearly) with travel times beyond tha…
ghost updated
3 years ago
-
- what is the size of fruitymesh code (to know if it can fits in my project).
- what is the differnece between these variables : totalInConnections,totalOutConnections,meshMaxInConnections,meshMaxOut…
-
**Is your feature request related to a problem? Please describe.**
Is there any plan to integrate NP algorithms like finding Hamiltonian paths or solving the TSP?
**Describe the solution you'd lik…
-
Hi Chaitanya,
Recently I have been studying your paper ''An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem'', and tried to understand your proposed GCN model. H…
-
While moving the friendship theorem into the main part of set.mm (see #1389), I noticed some intricatenesses which bother me a lot:
1. Edges:
To be compatible with the definition of multigraphs…
-
Hi there! The objective of the Cumulative Traveling Salesman Problem (CTSP) is to minimize the sum of arrival times at customers, instead of the total travelling time. This is different than minimizin…
-
Missing Travelling Salesman Problem