ADdV questions

ADdV answers

• Traveling salesman problem when not all cities are connected and with the possibility of multiple visits
• How can we find the largest contiguous region of a graph with two different "ID"s?
• How do I select the node that minimizes the maximum shortest distance to the other nodes in a graph?
• Find the most similar text in a list of strings
• Can you monkey-patch built in classes and if not, how do I overload an operator to define addition for two different classes?